From c163e6d0d2b57863facd1dd280cfaeca18e8fae1 Mon Sep 17 00:00:00 2001
From: Khalid Shakir <kshakir@broadinstitute.org>
Date: Thu, 27 Feb 2014 01:56:00 +0800
Subject: [PATCH 01/18] Separate failsafe directories for each of the
 integration test types [#66515572]

---
 pom.xml                      |  4 ----
 public/package-tests/pom.xml |  2 --
 public/sting-root/pom.xml    | 11 +++++++++--
 3 files changed, 9 insertions(+), 8 deletions(-)

diff --git a/pom.xml b/pom.xml
index 3abf73151..96074d881 100644
--- a/pom.xml
+++ b/pom.xml
@@ -609,7 +609,6 @@
                                 <properties>
                                     <integrationtests.profile.enabled>true</integrationtests.profile.enabled>
                                     <sting.packageintegrationtests.skipped>${sting.packageintegrationtests.skipped}</sting.packageintegrationtests.skipped>
-                                    <failsafe.summaryFile>${project.build.directory}/failsafe-reports/integration/failsafe-summary-${it.test}.xml</failsafe.summaryFile>
                                 </properties>
                             </configuration>
                         </execution>
@@ -628,7 +627,6 @@
                                 <properties>
                                     <integrationtests.profile.enabled>true</integrationtests.profile.enabled>
                                     <sting.packagepipelinetests.skipped>${sting.packagepipelinetests.skipped}</sting.packagepipelinetests.skipped>
-                                    <failsafe.summaryFile>${project.build.directory}/failsafe-reports/pipeline/failsafe-summary-${it.test}.xml</failsafe.summaryFile>
                                 </properties>
                             </configuration>
                         </execution>
@@ -647,7 +645,6 @@
                                 <properties>
                                     <integrationtests.profile.enabled>true</integrationtests.profile.enabled>
                                     <sting.packagelargescaletests.skipped>${sting.packagelargescaletests.skipped}</sting.packagelargescaletests.skipped>
-                                    <failsafe.summaryFile>${project.build.directory}/failsafe-reports/largescale/failsafe-summary-${it.test}.xml</failsafe.summaryFile>
                                 </properties>
                             </configuration>
                         </execution>
@@ -666,7 +663,6 @@
                                 <properties>
                                     <integrationtests.profile.enabled>true</integrationtests.profile.enabled>
                                     <sting.packageknowledgebasetests.skipped>${sting.packageknowledgebasetests.skipped}</sting.packageknowledgebasetests.skipped>
-                                    <failsafe.summaryFile>${project.build.directory}/failsafe-reports/knowledgebase/failsafe-summary-${it.test}.xml</failsafe.summaryFile>
                                 </properties>
                             </configuration>
                         </execution>
diff --git a/public/package-tests/pom.xml b/public/package-tests/pom.xml
index 817cfecdb..6d7e356cb 100644
--- a/public/package-tests/pom.xml
+++ b/public/package-tests/pom.xml
@@ -24,7 +24,6 @@
         <sting.packagepipelinetests.skipped>true</sting.packagepipelinetests.skipped>
         <sting.packagelargescaletests.skipped>true</sting.packagelargescaletests.skipped>
         <sting.packageknowledgebasetests.skipped>true</sting.packageknowledgebasetests.skipped>
-        <failsafe.summaryFile>${project.build.directory}/failsafe-reports/failsafe-summary.xml</failsafe.summaryFile>
     </properties>
 
     <!-- Dependency configuration (versions, etc.) -->
@@ -149,7 +148,6 @@
                             <workingDirectory>${sting.packagetests.basedir}</workingDirectory>
                             <classesDirectory>${project.build.outputDirectory}/ignored_by_package_test</classesDirectory>
                             <testClassesDirectory>${sting.packagetests.testClasses}</testClassesDirectory>
-                            <summaryFile>${failsafe.summaryFile}</summaryFile>
                         </configuration>
                         <executions>
                             <execution>
diff --git a/public/sting-root/pom.xml b/public/sting-root/pom.xml
index 84edd9be5..279897f8e 100644
--- a/public/sting-root/pom.xml
+++ b/public/sting-root/pom.xml
@@ -353,7 +353,6 @@
                             <property>
                                 <name>usedefaultlisteners</name>
                                 <value>false</value>
-                                <!-- TODO: Why do the default listeners take so long post tests, what is the "old" directory, and why doesn't ant have this problem? -->
                             </property>
                         </properties>
                         <systemPropertyVariables>
@@ -376,6 +375,7 @@
                             <configuration>
                                 <!-- TODO: Re-enable unit tests by default? -->
                                 <skip>${sting.unittests.skipped}</skip>
+                                <reportsDirectory>${project.build.directory}/surefire-reports/unit/${test}</reportsDirectory>
                                 <includes>
                                     <include>**/*UnitTest.class</include>
                                 </includes>
@@ -399,7 +399,6 @@
                             <property>
                                 <name>usedefaultlisteners</name>
                                 <value>false</value>
-                                <!-- TODO: Why do the default listeners take so long post tests, what is the "old" directory, and why doesn't ant have this problem? -->
                             </property>
                         </properties>
                         <systemPropertyVariables>
@@ -421,6 +420,8 @@
                             <configuration>
                                 <!-- TODO: Re-enable integration tests by default? -->
                                 <skip>${sting.integrationtests.skipped}</skip>
+                                <reportsDirectory>${project.build.directory}/failsafe-reports/integration/${it.test}</reportsDirectory>
+                                <summaryFile>${project.build.directory}/failsafe-reports/integration/failsafe-summary-${it.test}.xml</summaryFile>
                                 <includes>
                                     <include>**/*IntegrationTest.class</include>
                                 </includes>
@@ -436,6 +437,8 @@
                             <configuration>
                                 <!-- TODO: Re-enable pipeline tests by default? -->
                                 <skip>${sting.pipelinetests.skipped}</skip>
+                                <reportsDirectory>${project.build.directory}/failsafe-reports/pipeline/${it.test}</reportsDirectory>
+                                <summaryFile>${project.build.directory}/failsafe-reports/pipeline/failsafe-summary-${it.test}.xml</summaryFile>
                                 <includes>
                                     <include>**/*PipelineTest.class</include>
                                 </includes>
@@ -450,6 +453,8 @@
                             <!-- run large scale tests -->
                             <configuration>
                                 <skip>${sting.largescaletests.skipped}</skip>
+                                <reportsDirectory>${project.build.directory}/failsafe-reports/largescale/${it.test}</reportsDirectory>
+                                <summaryFile>${project.build.directory}/failsafe-reports/largescale/failsafe-summary-${it.test}.xml</summaryFile>
                                 <includes>
                                     <include>**/*LargeScaleTest.class</include>
                                 </includes>
@@ -464,6 +469,8 @@
                             <!-- run knowledge base tests -->
                             <configuration>
                                 <skip>${sting.knowledgebasetests.skipped}</skip>
+                                <reportsDirectory>${project.build.directory}/failsafe-reports/knowledgebasetests/${it.test}</reportsDirectory>
+                                <summaryFile>${project.build.directory}/failsafe-reports/knowledgebasetests/failsafe-summary-${it.test}.xml</summaryFile>
                                 <includes>
                                     <include>**/*KnowledgeBaseTest.class</include>
                                 </includes>

From da587d48ed6dd78171cd3130215b48ee3dad7d98 Mon Sep 17 00:00:00 2001
From: Khalid Shakir <kshakir@broadinstitute.org>
Date: Thu, 27 Feb 2014 04:43:29 +0800
Subject: [PATCH 02/18] Using absolute paths in generated diff commands, to
 ease running them from any directory.

---
 .../src/test/java/org/broadinstitute/sting/MD5DB.java           | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/public/gatk-framework/src/test/java/org/broadinstitute/sting/MD5DB.java b/public/gatk-framework/src/test/java/org/broadinstitute/sting/MD5DB.java
index 7bd6f7bc4..4c0f8b11a 100644
--- a/public/gatk-framework/src/test/java/org/broadinstitute/sting/MD5DB.java
+++ b/public/gatk-framework/src/test/java/org/broadinstitute/sting/MD5DB.java
@@ -120,7 +120,7 @@ public class MD5DB {
         for ( String dir : Arrays.asList(GLOBAL_MD5_DB_DIR, LOCAL_MD5_DB_DIR)) {
             File f = getFileForMD5(md5, dir);
             if ( f.exists() && f.canRead() )
-                return f.getPath();
+                return f.getAbsolutePath();
         }
 
         return valueIfNotFound;

From e61ba8b3408eeedb9b3c7e5498f7ac5b8d9314bb Mon Sep 17 00:00:00 2001
From: Chris Whelan <cwhelan@broadinstitute.org>
Date: Wed, 26 Feb 2014 11:40:01 -0500
Subject: [PATCH 03/18] Added command line checks for duplicate files in ROD
 lists

  -- Keep a list of processed files in ArgumentTypeDescriptor.getRodBindingsCollection
  -- Throw user exception if a file name duplicates one that was previously parsed
  -- Throw user exception if the ROD list is empty
  -- Added two unit tests to RodBindingCollectionUnitTest
---
 .../commandline/ArgumentTypeDescriptor.java   | 54 ++++++++++++++++++-
 .../RodBindingCollectionUnitTest.java         | 22 ++++++++
 2 files changed, 74 insertions(+), 2 deletions(-)

diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/commandline/ArgumentTypeDescriptor.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/commandline/ArgumentTypeDescriptor.java
index 8f0abe360..9ab317251 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/commandline/ArgumentTypeDescriptor.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/commandline/ArgumentTypeDescriptor.java
@@ -455,6 +455,8 @@ public abstract class ArgumentTypeDescriptor {
     /**
      * Retrieve and parse a collection of RodBindings from the given file.
      *
+     * If the file contains duplicate entries or is empty, an exception will be thrown.
+     *
      * @param file             the source file
      * @param parsingEngine    the engine responsible for parsing
      * @param parameterType    the Tribble Feature parameter type
@@ -471,6 +473,9 @@ public abstract class ArgumentTypeDescriptor {
                                                   final String fieldName) throws IOException {
         final List<RodBinding> bindings = new ArrayList<>();
 
+        // Keep track of the files in this list so that we can check for duplicates and empty files
+        final Set<String> fileValues = new HashSet<>();
+
         // parse each line separately using the given Tags if none are provided on each line
         for ( final String line: FileUtils.readLines(file) ) {
             final String[] tokens = line.split("\\s+");
@@ -481,14 +486,15 @@ public abstract class ArgumentTypeDescriptor {
             }
             // use the default tags if none are provided for this binding
             else if ( tokens.length == 1 ) {
-                final ArgumentMatchValue value = new ArgumentMatchStringValue(tokens[0]);
+                final ArgumentMatchValue value = parseAndValidateArgumentMatchValue(tokens[0], fileValues, fieldName, file.getName());
                 binding = (RodBinding)parseBinding(value, parameterType, RodBinding.class, bindingName, defaultTags, fieldName);
                 parsingEngine.addTags(binding, defaultTags);
+
             }
             // use the new tags if provided
             else if ( tokens.length == 2 ) {
                 final Tags tags = ParsingMethod.parseTags(fieldName, tokens[0]);
-                final ArgumentMatchValue value = new ArgumentMatchStringValue(tokens[1]);
+                final ArgumentMatchValue value = parseAndValidateArgumentMatchValue(tokens[1], fileValues, fieldName, file.getName());
                 binding = (RodBinding)parseBinding(value, parameterType, RodBinding.class, bindingName, tags, fieldName);
                 parsingEngine.addTags(binding, tags);
             } else {
@@ -499,8 +505,52 @@ public abstract class ArgumentTypeDescriptor {
             parsingEngine.addRodBinding(binding);
         }
 
+        if (fileValues.isEmpty()) {
+            throw new UserException.BadArgumentValue(fieldName, "The input list " + file.getName() + " is empty.");
+        }
+
         return RodBindingCollection.createRodBindingCollectionOfType(parameterType, bindings);
     }
+
+    /**
+     * Validates the resource file name and constructs an ArgumentMatchValue from it.
+     *
+     * If the list name has already been processed in the current list, throws a UserException, otherwise
+     * creates an ArgumentMatchValue to represent the list.
+     *
+     * @param token Name of the ROD resource file.
+     * @param fileValues Set of names of ROD files that have already been processed.
+     * @param fieldName Name of the argument field being populated.
+     * @param listFileName Name of the list file being processed.
+     * @return
+     */
+    private static ArgumentMatchValue parseAndValidateArgumentMatchValue(final String token, final Set<String> fileValues, final String fieldName,
+                                                                         final String listFileName) {
+        checkForDuplicateFileName(token, fileValues, fieldName, listFileName);
+        return new ArgumentMatchStringValue(token);
+    }
+
+    /**
+     * Checks to make sure that the current file name to be processed has not already been processed.
+     *
+     * Checks the name of the current file against the names that have already been processed, throwing
+     * an informative BadArgumentValue exception if it has already been seen. As a side effect adds the
+     * current file name to the set of filenames that have already been processed.
+     *
+     * @param currentFile Name of the current file to process
+     * @param processedFiles Set of file names that have already been processed
+     * @param fieldName Name of the argument that is being populated
+     * @param listName Filename of the list that is being processed
+     */
+    protected static void checkForDuplicateFileName(final String currentFile, final Set<String> processedFiles,
+                                                    final String fieldName, final String listName) {
+        if (processedFiles.contains(currentFile)) {
+            throw new UserException.BadArgumentValue(fieldName, "The input list " + listName + " contains file " + currentFile +
+                                                     " multiple times, which isn't allowed. If you are intentionally trying to " +
+                                                     "include the same file more than once, you will need to specify it in separate file lists.");
+        }
+        processedFiles.add(currentFile);
+    }
 }
 
 /**
diff --git a/public/gatk-framework/src/test/java/org/broadinstitute/sting/commandline/RodBindingCollectionUnitTest.java b/public/gatk-framework/src/test/java/org/broadinstitute/sting/commandline/RodBindingCollectionUnitTest.java
index 29d38ec19..853c51543 100644
--- a/public/gatk-framework/src/test/java/org/broadinstitute/sting/commandline/RodBindingCollectionUnitTest.java
+++ b/public/gatk-framework/src/test/java/org/broadinstitute/sting/commandline/RodBindingCollectionUnitTest.java
@@ -26,6 +26,7 @@
 package org.broadinstitute.sting.commandline;
 
 import org.broadinstitute.sting.BaseTest;
+import org.broadinstitute.sting.utils.exceptions.UserException;
 import org.broadinstitute.variant.variantcontext.VariantContext;
 import org.testng.Assert;
 import org.testng.annotations.BeforeMethod;
@@ -105,6 +106,27 @@ public class RodBindingCollectionUnitTest extends BaseTest {
         Assert.assertEquals(parsingEngine.getTags(binding), mytags);
     }
 
+    @Test(expectedExceptions = UserException.BadArgumentValue.class)
+    public void testDuplicateEntriesInFile() throws IOException {
+
+        final File testFile = File.createTempFile("RodBindingCollectionUnitTest.variantListWithDuplicates", ".list");
+        testFile.deleteOnExit();
+        final FileWriter writer = new FileWriter(testFile);
+        writer.write(testVCFFileName + "\n");
+        writer.write(testVCFFileName + "\n");
+        writer.close();
+
+        ArgumentTypeDescriptor.getRodBindingsCollection(testFile, parsingEngine, VariantContext.class, "foo", mytags, "input");
+    }
+
+    @Test(expectedExceptions = UserException.BadArgumentValue.class)
+    public void testValidateEmptyFile() throws IOException {
+        final File testFile = File.createTempFile("RodBindingCollectionUnitTest.emptyVCFList", ".list");
+        testFile.deleteOnExit();
+
+        ArgumentTypeDescriptor.getRodBindingsCollection(testFile, parsingEngine, VariantContext.class, "foo", mytags, "input");
+    }
+
     @Test
     public void testOverrideTagsInFile() throws IOException {
         final File testFile = File.createTempFile("RodBindingCollectionUnitTest.overrideTags", ".list");

From 387188e5bbcf35a14ed8d5f1d8f3c6c062ecd250 Mon Sep 17 00:00:00 2001
From: Khalid Shakir <kshakir@broadinstitute.org>
Date: Sat, 1 Mar 2014 15:13:58 +0800
Subject: [PATCH 04/18] Attempting to limit gc during Maven tests, using
 defaults found in JavaCommandLineFunction

---
 public/sting-root/pom.xml | 5 ++++-
 1 file changed, 4 insertions(+), 1 deletion(-)

diff --git a/public/sting-root/pom.xml b/public/sting-root/pom.xml
index 279897f8e..171eb7620 100644
--- a/public/sting-root/pom.xml
+++ b/public/sting-root/pom.xml
@@ -37,7 +37,10 @@
         <sting.pipelinetests.run>false</sting.pipelinetests.run>
         <scala.maxmemory>1g</scala.maxmemory>
         <test.maxmemory>4g</test.maxmemory>
-        <test.args>-Xmx${test.maxmemory}</test.args>
+        <java.gc.threads>4</java.gc.threads>
+        <java.gc.timeLimit>50</java.gc.timeLimit>
+        <java.gc.heapFreeLimit>10</java.gc.heapFreeLimit>
+        <test.args>-Xmx${test.maxmemory} -XX:+UseParallelOldGC -XX:ParallelGCThreads=${java.gc.threads} -XX:GCTimeLimit=${java.gc.timeLimit} -XX:GCHeapFreeLimit=${java.gc.heapFreeLimit}</test.args>
 
         <!-- Version numbers for picard sam-jdk. Usually kept in sync. -->
         <picard.public.version>1.107.1683</picard.public.version>

From 22ad18b919fa972288a51a2f5038687bf00816d8 Mon Sep 17 00:00:00 2001
From: Eric Banks <ebanks@broadinstitute.org>
Date: Fri, 28 Feb 2014 02:05:02 -0500
Subject: [PATCH 06/18] Moving Reduce Reads to the archive.

The GATK now fails with a user error if you try to run with a reduced bam.
(I added a unit test for that; everything else here is just the removal of all traces of RR)
---
 .../gatk/walkers/annotator/Coverage.java      |    8 +-
 .../annotator/DepthPerAlleleBySample.java     |    6 +-
 .../walkers/annotator/DepthPerSampleHC.java   |    5 +-
 .../gatk/walkers/annotator/FisherStrand.java  |   26 +-
 .../walkers/annotator/RMSMappingQuality.java  |   12 +-
 .../gatk/walkers/annotator/RankSumTest.java   |    6 +-
 .../walkers/annotator/SpanningDeletions.java  |    6 +-
 .../gatk/walkers/bqsr/BaseRecalibrator.java   |    3 -
 .../reducereads/BaseAndQualsCounts.java       |  207 ---
 .../compression/reducereads/BaseCounts.java   |  411 ------
 .../compression/reducereads/BaseIndex.java    |  136 --
 .../reducereads/CompressionStash.java         |  107 --
 .../compression/reducereads/Compressor.java   |  108 --
 .../reducereads/FinishedGenomeLoc.java        |   82 --
 .../reducereads/HeaderElement.java            |  393 ------
 .../reducereads/MultiSampleCompressor.java    |  163 ---
 .../compression/reducereads/ReduceReads.java  |  782 ------------
 .../reducereads/ReduceReadsStash.java         |  160 ---
 .../reducereads/SingleSampleCompressor.java   |  153 ---
 .../reducereads/SlidingWindow.java            | 1110 -----------------
 .../reducereads/SyntheticRead.java            |  369 ------
 .../DiploidSNPGenotypeLikelihoods.java        |   12 -
 .../gatk/walkers/genotyper/ErrorModel.java    |    3 +-
 ...GeneralPloidyIndelGenotypeLikelihoods.java |    3 +-
 .../GenotypeLikelihoodsCalculationModel.java  |    2 +-
 ...elGenotypeLikelihoodsCalculationModel.java |    2 +-
 .../genotyper/UnifiedGenotyperEngine.java     |    2 +-
 .../PairHMMLikelihoodCalculationEngine.java   |    4 +-
 .../haplotypecaller/ReadErrorCorrector.java   |    4 -
 .../ReferenceConfidenceModel.java             |   12 +-
 .../readthreading/HaplotypeGraph.java         |    4 +-
 .../readthreading/ReadThreadingAssembler.java |    6 +-
 .../readthreading/ReadThreadingGraph.java     |   47 +-
 .../readthreading/SequenceForKmers.java       |   21 +-
 .../indels/PairHMMIndelErrorModel.java        |   15 +-
 .../walkers/qc/AssessReducedCoverage.java     |  175 ---
 .../gatk/walkers/qc/AssessReducedQuals.java   |  208 ---
 .../sting/utils/recalibration/RecalUtils.java |   18 -
 .../walkers/annotator/RankSumUnitTest.java    |   12 +-
 .../reducereads/BaseCountsUnitTest.java       |  201 ---
 .../reducereads/HeaderElementUnitTest.java    |  214 ----
 .../ReduceReadsIntegrationTest.java           |  347 ------
 .../reducereads/ReduceReadsUnitTest.java      |  214 ----
 .../reducereads/SlidingWindowUnitTest.java    |  964 --------------
 .../BiasedDownsamplingIntegrationTest.java    |  162 ---
 ...dGenotyperReducedReadsIntegrationTest.java |   87 --
 .../AssemblyResultSetUnitTest.java            |    2 +-
 .../HaplotypeCallerIntegrationTest.java       |   22 -
 .../ReferenceConfidenceModelUnitTest.java     |   20 -
 .../ReadThreadingGraphUnitTest.java           |   12 +-
 .../SequenceForKmersUnitTest.java             |   18 +-
 .../pairhmm/ActiveRegionTestDataSet.java      |    4 +-
 .../gatk/datasources/reads/SAMDataSource.java |   15 +-
 .../AlleleBiasedDownsamplingUtils.java        |   39 +-
 .../sting/gatk/downsampling/Downsampler.java  |   11 -
 .../gatk/walkers/coverage/CallableLoci.java   |    7 +-
 .../gatk/walkers/coverage/CoverageUtils.java  |    6 +-
 .../sting/utils/DeprecatedToolChecks.java     |    1 +
 .../sting/utils/clipping/ClippingOp.java      |    6 -
 .../genotyper/PerReadAlleleLikelihoodMap.java |   14 +-
 .../locusiterator/AlignmentStateMachine.java  |    9 -
 .../sting/utils/pileup/PileupElement.java     |   39 -
 .../utils/pileup/ReadBackedPileupImpl.java    |    5 +-
 .../sting/utils/sam/ArtificialSAMUtils.java   |   25 -
 .../sting/utils/sam/GATKSAMRecord.java        |  206 +--
 .../sting/utils/sam/ReadUtils.java            |   12 +-
 .../reads/SAMDataSourceUnitTest.java          |   17 +
 ...AlleleBiasedDownsamplingUtilsUnitTest.java |   34 +-
 .../FractionalDownsamplerUnitTest.java        |   33 -
 .../LevelingDownsamplerUnitTest.java          |   41 -
 .../ReservoirDownsamplerUnitTest.java         |   43 -
 .../SimplePositionalDownsamplerUnitTest.java  |   44 -
 .../TAROrderedReadCacheUnitTest.java          |   44 -
 .../coverage/CallableLociIntegrationTest.java |    9 -
 .../utils/clipping/ReadClipperUnitTest.java   |   16 -
 .../utils/pileup/PileupElementUnitTest.java   |    2 -
 .../utils/sam/GATKSAMRecordUnitTest.java      |  156 +--
 77 files changed, 142 insertions(+), 7762 deletions(-)
 delete mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/BaseAndQualsCounts.java
 delete mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/BaseCounts.java
 delete mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/BaseIndex.java
 delete mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/CompressionStash.java
 delete mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/Compressor.java
 delete mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/FinishedGenomeLoc.java
 delete mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/HeaderElement.java
 delete mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/MultiSampleCompressor.java
 delete mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/ReduceReads.java
 delete mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/ReduceReadsStash.java
 delete mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/SingleSampleCompressor.java
 delete mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/SlidingWindow.java
 delete mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/SyntheticRead.java
 delete mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/qc/AssessReducedCoverage.java
 delete mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/qc/AssessReducedQuals.java
 delete mode 100644 protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/BaseCountsUnitTest.java
 delete mode 100644 protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/HeaderElementUnitTest.java
 delete mode 100644 protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/ReduceReadsIntegrationTest.java
 delete mode 100644 protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/ReduceReadsUnitTest.java
 delete mode 100644 protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/SlidingWindowUnitTest.java
 delete mode 100644 protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/genotyper/BiasedDownsamplingIntegrationTest.java
 delete mode 100644 protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/genotyper/UnifiedGenotyperReducedReadsIntegrationTest.java

diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/Coverage.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/Coverage.java
index 5c48417ac..29cee9e15 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/Coverage.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/Coverage.java
@@ -57,9 +57,6 @@ import org.broadinstitute.sting.utils.genotyper.PerReadAlleleLikelihoodMap;
 import org.broadinstitute.variant.vcf.VCFConstants;
 import org.broadinstitute.variant.vcf.VCFInfoHeaderLine;
 import org.broadinstitute.variant.vcf.VCFStandardHeaderLines;
-import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
-import org.broadinstitute.sting.utils.sam.ReadUtils;
-import org.broadinstitute.variant.variantcontext.Allele;
 import org.broadinstitute.variant.variantcontext.VariantContext;
 
 import java.util.Arrays;
@@ -98,10 +95,7 @@ public class Coverage extends InfoFieldAnnotation implements StandardAnnotation,
                 return null;
 
             for (PerReadAlleleLikelihoodMap maps : perReadAlleleLikelihoodMap.values() ) {
-                for (Map.Entry<GATKSAMRecord,Map<Allele,Double>> el : maps.getLikelihoodReadMap().entrySet()) {
-                    final GATKSAMRecord read = el.getKey();
-                    depth += (read.isReducedRead() ? read.getReducedCount(ReadUtils.getReadCoordinateForReferenceCoordinateUpToEndOfRead(read, vc.getStart(), ReadUtils.ClippingTail.RIGHT_TAIL)) : 1);
-                }
+                depth += maps.getLikelihoodReadMap().size();
             }
         }
         else
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/DepthPerAlleleBySample.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/DepthPerAlleleBySample.java
index 0da865a85..52b09d251 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/DepthPerAlleleBySample.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/DepthPerAlleleBySample.java
@@ -60,7 +60,6 @@ import org.broadinstitute.variant.vcf.VCFStandardHeaderLines;
 import org.broadinstitute.sting.utils.pileup.PileupElement;
 import org.broadinstitute.sting.utils.pileup.ReadBackedPileup;
 import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
-import org.broadinstitute.sting.utils.sam.ReadUtils;
 import org.broadinstitute.variant.variantcontext.Allele;
 import org.broadinstitute.variant.variantcontext.Genotype;
 import org.broadinstitute.variant.variantcontext.GenotypeBuilder;
@@ -119,7 +118,7 @@ public class DepthPerAlleleBySample extends GenotypeAnnotation implements Standa
         final ReadBackedPileup pileup = stratifiedContext.getBasePileup();
         for ( final PileupElement p : pileup ) {
             if ( alleleCounts.containsKey(p.getBase()) )
-                alleleCounts.put(p.getBase(), alleleCounts.get(p.getBase())+p.getRepresentativeCount());
+                alleleCounts.put(p.getBase(), alleleCounts.get(p.getBase())+1);
         }
 
         // we need to add counts in the correct order
@@ -146,8 +145,7 @@ public class DepthPerAlleleBySample extends GenotypeAnnotation implements Standa
             if (! a.isInformative() ) continue; // read is non-informative
             final GATKSAMRecord read = el.getKey();
             final int prevCount = alleleCounts.get(a.getMostLikelyAllele());
-            final int incCount = read.isReducedRead() ? read.getReducedCount(ReadUtils.getReadCoordinateForReferenceCoordinateUpToEndOfRead(read, vc.getStart(), ReadUtils.ClippingTail.RIGHT_TAIL)) : 1;
-            alleleCounts.put(a.getMostLikelyAllele(), prevCount + incCount);
+            alleleCounts.put(a.getMostLikelyAllele(), prevCount + 1);
         }
 
         final int[] counts = new int[alleleCounts.size()];
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/DepthPerSampleHC.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/DepthPerSampleHC.java
index 21325e6f1..8e5ca83e0 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/DepthPerSampleHC.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/DepthPerSampleHC.java
@@ -54,7 +54,6 @@ import org.broadinstitute.sting.gatk.walkers.annotator.interfaces.GenotypeAnnota
 import org.broadinstitute.sting.utils.genotyper.MostLikelyAllele;
 import org.broadinstitute.sting.utils.genotyper.PerReadAlleleLikelihoodMap;
 import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
-import org.broadinstitute.sting.utils.sam.ReadUtils;
 import org.broadinstitute.variant.variantcontext.Allele;
 import org.broadinstitute.variant.variantcontext.Genotype;
 import org.broadinstitute.variant.variantcontext.GenotypeBuilder;
@@ -109,9 +108,7 @@ public class DepthPerSampleHC extends GenotypeAnnotation {
             for (Map.Entry<GATKSAMRecord,Map<Allele,Double>> el : alleleLikelihoodMap.getLikelihoodReadMap().entrySet()) {
                 final MostLikelyAllele a = PerReadAlleleLikelihoodMap.getMostLikelyAllele(el.getValue(), alleles);
                 if ( a.isInformative() ) {
-                    final GATKSAMRecord read = el.getKey();
-                    final int incCount = read.isReducedRead() ? read.getReducedCount(ReadUtils.getReadCoordinateForReferenceCoordinateUpToEndOfRead(read, vc.getStart(), ReadUtils.ClippingTail.RIGHT_TAIL)) : 1;
-                    dp += incCount;
+                    dp++;
                 }
             }
 
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/FisherStrand.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/FisherStrand.java
index a04815e62..a90f555a1 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/FisherStrand.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/FisherStrand.java
@@ -64,7 +64,6 @@ import org.broadinstitute.variant.vcf.VCFHeaderLineType;
 import org.broadinstitute.variant.vcf.VCFInfoHeaderLine;
 import org.broadinstitute.sting.utils.pileup.PileupElement;
 import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
-import org.broadinstitute.sting.utils.sam.ReadUtils;
 import org.broadinstitute.variant.variantcontext.Allele;
 import org.broadinstitute.variant.variantcontext.VariantContext;
 
@@ -418,8 +417,7 @@ public class FisherStrand extends InfoFieldAnnotation implements StandardAnnotat
             for (final Map.Entry<GATKSAMRecord,Map<Allele,Double>> el : maps.getLikelihoodReadMap().entrySet()) {
                 final MostLikelyAllele mostLikelyAllele = PerReadAlleleLikelihoodMap.getMostLikelyAllele(el.getValue());
                 final GATKSAMRecord read = el.getKey();
-                final int representativeCount = read.isReducedRead() ? read.getReducedCount(ReadUtils.getReadCoordinateForReferenceCoordinateUpToEndOfRead(read, vc.getStart(), ReadUtils.ClippingTail.RIGHT_TAIL)) : 1;
-                updateTable(myTable, mostLikelyAllele.getAlleleIfInformative(), read, ref, alt, representativeCount);
+                updateTable(myTable, mostLikelyAllele.getAlleleIfInformative(), read, ref, alt);
             }
             if ( passesMinimumThreshold(myTable) )
                 copyToMainTable(myTable, table);
@@ -464,7 +462,7 @@ public class FisherStrand extends InfoFieldAnnotation implements StandardAnnotat
                 if ( p.getQual() < minQScoreToConsider || p.getMappingQual() < minQScoreToConsider )
                     continue;
 
-                updateTable(myTable, Allele.create(p.getBase(), false), p.getRead(), ref, alt, p.getRepresentativeCount());
+                updateTable(myTable, Allele.create(p.getBase(), false), p.getRead(), ref, alt);
             }
             if ( passesMinimumThreshold(myTable) )
                 copyToMainTable(myTable, table);
@@ -487,7 +485,7 @@ public class FisherStrand extends InfoFieldAnnotation implements StandardAnnotat
                 ((int) p.getQual()) < QualityUtils.MIN_USABLE_Q_SCORE);
     }
 
-    private static void updateTable(final int[] table, final Allele allele, final GATKSAMRecord read, final Allele ref, final Allele alt, final int representativeCount) {
+    private static void updateTable(final int[] table, final Allele allele, final GATKSAMRecord read, final Allele ref, final Allele alt) {
 
         final boolean matchesRef = allele.equals(ref, true);
         final boolean matchesAlt = allele.equals(alt, true);
@@ -496,21 +494,15 @@ public class FisherStrand extends InfoFieldAnnotation implements StandardAnnotat
             final int offset = matchesRef ? 0 : 2;
 
             if ( read.isStrandless() ) {
-
-                // ignore strandless reduced reads because they are always on the forward strand!
-                if ( !read.isReducedRead() ) {
-
-                    // a strandless read counts as observations on both strand, at 50% weight, with a minimum of 1
-                    // (the 1 is to ensure that a strandless read always counts as an observation on both strands, even
-                    // if the read is only seen once, because it's a merged read or other)
-                    final int toAdd = Math.max(representativeCount / 2, 1);
-                    table[offset] += toAdd;
-                    table[offset + 1] += toAdd;
-                }
+                // a strandless read counts as observations on both strand, at 50% weight, with a minimum of 1
+                // (the 1 is to ensure that a strandless read always counts as an observation on both strands, even
+                // if the read is only seen once, because it's a merged read or other)
+                table[offset]++;
+                table[offset + 1]++;
             } else {
                 // a normal read with an actual strand
                 final boolean isFW = !read.getReadNegativeStrandFlag();
-                table[offset + (isFW ? 0 : 1)] += representativeCount;
+                table[offset + (isFW ? 0 : 1)]++;
             }
         }
     }
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/RMSMappingQuality.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/RMSMappingQuality.java
index d9bc5966c..44e44c63b 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/RMSMappingQuality.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/RMSMappingQuality.java
@@ -56,7 +56,6 @@ import org.broadinstitute.sting.gatk.walkers.annotator.interfaces.StandardAnnota
 import org.broadinstitute.sting.utils.genotyper.PerReadAlleleLikelihoodMap;
 import org.broadinstitute.sting.utils.MathUtils;
 import org.broadinstitute.sting.utils.QualityUtils;
-import org.broadinstitute.sting.utils.sam.ReadUtils;
 import org.broadinstitute.variant.vcf.VCFConstants;
 import org.broadinstitute.variant.vcf.VCFInfoHeaderLine;
 import org.broadinstitute.variant.vcf.VCFStandardHeaderLines;
@@ -87,7 +86,7 @@ public class RMSMappingQuality extends InfoFieldAnnotation implements StandardAn
             for ( final Map.Entry<String, AlignmentContext> sample : stratifiedContexts.entrySet() ) {
                 final AlignmentContext context = sample.getValue();
                 for ( final PileupElement p : context.getBasePileup() )
-                    fillMappingQualitiesFromPileup(p.getRead().getMappingQuality(), p.getRepresentativeCount(), qualities);
+                    fillMappingQualitiesFromPileup(p.getRead().getMappingQuality(), qualities);
             }
         }
         else if (perReadAlleleLikelihoodMap != null) {
@@ -96,7 +95,7 @@ public class RMSMappingQuality extends InfoFieldAnnotation implements StandardAn
 
             for ( final PerReadAlleleLikelihoodMap perReadLikelihoods : perReadAlleleLikelihoodMap.values() ) {
                 for ( final GATKSAMRecord read : perReadLikelihoods.getStoredElements() )
-                    fillMappingQualitiesFromPileup(read.getMappingQuality(), (read.isReducedRead() ? read.getReducedCount(ReadUtils.getReadCoordinateForReferenceCoordinateUpToEndOfRead(read, vc.getStart(), ReadUtils.ClippingTail.RIGHT_TAIL)) : 1), qualities);
+                    fillMappingQualitiesFromPileup(read.getMappingQuality(), qualities);
             }
         }
         else
@@ -106,12 +105,9 @@ public class RMSMappingQuality extends InfoFieldAnnotation implements StandardAn
         return Collections.singletonMap(getKeyNames().get(0), (Object)String.format("%.2f", rms));
     }
 
-    private static void fillMappingQualitiesFromPileup(final int mq, final int representativeCount, final List<Integer> qualities) {
+    private static void fillMappingQualitiesFromPileup(final int mq, final List<Integer> qualities) {
         if ( mq != QualityUtils.MAPPING_QUALITY_UNAVAILABLE ) {
-            if ( representativeCount == 1 )
-                qualities.add(mq);
-            else
-                qualities.addAll(Collections.nCopies(representativeCount, mq));
+            qualities.add(mq);
         }
     }
 
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/RankSumTest.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/RankSumTest.java
index ab5a40145..13211c44c 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/RankSumTest.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/RankSumTest.java
@@ -236,8 +236,7 @@ public abstract class RankSumTest extends InfoFieldAnnotation implements ActiveR
         return !(p.isDeletion() ||
                  p.getMappingQual() == 0 ||
                  p.getMappingQual() == QualityUtils.MAPPING_QUALITY_UNAVAILABLE ||
-                 ((int) p.getQual()) < QualityUtils.MIN_USABLE_Q_SCORE || // need the unBAQed quality score here
-                 p.getRead().isReducedRead() );
+                 ((int) p.getQual()) < QualityUtils.MIN_USABLE_Q_SCORE); // need the unBAQed quality score here
     }
 
     /**
@@ -249,8 +248,7 @@ public abstract class RankSumTest extends InfoFieldAnnotation implements ActiveR
      */
     protected boolean isUsableRead(final GATKSAMRecord read, final int refLoc) {
         return !( read.getMappingQuality() == 0 ||
-                read.getMappingQuality() == QualityUtils.MAPPING_QUALITY_UNAVAILABLE ||
-                read.isReducedRead() );
+                read.getMappingQuality() == QualityUtils.MAPPING_QUALITY_UNAVAILABLE );
     }
 
     /**
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/SpanningDeletions.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/SpanningDeletions.java
index dd57c8ac6..417f3b595 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/SpanningDeletions.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/annotator/SpanningDeletions.java
@@ -56,7 +56,6 @@ import org.broadinstitute.sting.utils.genotyper.PerReadAlleleLikelihoodMap;
 import org.broadinstitute.sting.utils.pileup.PileupElement;
 import org.broadinstitute.variant.vcf.VCFHeaderLineType;
 import org.broadinstitute.variant.vcf.VCFInfoHeaderLine;
-import org.broadinstitute.sting.utils.pileup.ReadBackedPileup;
 import org.broadinstitute.variant.variantcontext.VariantContext;
 
 import java.util.Arrays;
@@ -90,10 +89,9 @@ public class SpanningDeletions extends InfoFieldAnnotation implements StandardAn
         int depth = 0;
         for ( Map.Entry<String, AlignmentContext> sample : stratifiedContexts.entrySet() ) {
             for ( final PileupElement p : sample.getValue().getBasePileup() ) {
-                final int actualSampleDepth = p.getRepresentativeCount();
-                depth += actualSampleDepth;
+                depth++;
                 if ( p.isDeletion() )
-                    deletions += actualSampleDepth;
+                    deletions++;
             }
         }
         Map<String, Object> map = new HashMap<String, Object>();
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/bqsr/BaseRecalibrator.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/bqsr/BaseRecalibrator.java
index 3882b70fa..3da04ef86 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/bqsr/BaseRecalibrator.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/bqsr/BaseRecalibrator.java
@@ -61,7 +61,6 @@ import org.broadinstitute.sting.gatk.refdata.RefMetaDataTracker;
 import org.broadinstitute.sting.gatk.walkers.*;
 import org.broadinstitute.sting.utils.MathUtils;
 import org.broadinstitute.sting.utils.BaseUtils;
-import org.broadinstitute.sting.utils.Utils;
 import org.broadinstitute.sting.utils.baq.BAQ;
 import org.broadinstitute.sting.utils.clipping.ReadClipper;
 import org.broadinstitute.sting.utils.collections.Pair;
@@ -74,7 +73,6 @@ import org.broadinstitute.sting.utils.recalibration.covariates.Covariate;
 import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
 import org.broadinstitute.sting.utils.sam.ReadUtils;
 
-import java.io.File;
 import java.io.IOException;
 import java.io.PrintStream;
 import java.util.ArrayList;
@@ -216,7 +214,6 @@ public class BaseRecalibrator extends ReadWalker<Long, Long> implements NanoSche
         }
 
         initializeRecalibrationEngine();
-        RecalUtils.checkForInvalidRecalBams(getToolkit().getSAMFileHeaders(), getToolkit().getArguments().ALLOW_BQSR_ON_REDUCED_BAMS);
         minimumQToUse = getToolkit().getArguments().PRESERVE_QSCORES_LESS_THAN;
         referenceReader = getToolkit().getReferenceDataSource().getReference();
     }
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/BaseAndQualsCounts.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/BaseAndQualsCounts.java
deleted file mode 100644
index 28a48c212..000000000
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/BaseAndQualsCounts.java
+++ /dev/null
@@ -1,207 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.compression.reducereads;
-
-/**
- * An object that keeps track of the base counts as well as the sum of the base, insertion and deletion qualities of each base.
- *
- * @author Mauricio Carneiro
- * @since 6/15/12
- */
-public class BaseAndQualsCounts extends BaseCounts {
-
-    private long sumInsertionQual_A = 0;
-    private long sumDeletionQual_A = 0;
-    private long sumInsertionQual_C = 0;
-    private long sumDeletionQual_C = 0;
-    private long sumInsertionQual_G = 0;
-    private long sumDeletionQual_G = 0;
-    private long sumInsertionQual_T = 0;
-    private long sumDeletionQual_T = 0;
-    private long sumInsertionQual_D = 0;
-    private long sumDeletionQual_D = 0;
-    private long sumInsertionQual_I = 0;
-    private long sumDeletionQual_I = 0;
-    private long sumInsertionQual_N = 0;
-    private long sumDeletionQual_N = 0;
-
-    /*
-     * Increments the count
-     *
-     * @param base            the base
-     * @param baseQual        the base quality
-     * @param insQual         the insertion quality
-     * @param delQual         the deletion quality
-     * @param baseMappingQual the mapping quality
-     * @param isLowQualBase   true if the base is low quality
-     */
-    public void incr(final byte base, final byte baseQual, final byte insQual, final byte delQual, final int baseMappingQual, final boolean isLowQualBase) {
-        incr(base, baseQual, insQual, delQual, baseMappingQual, isLowQualBase, false);
-    }
-
-    /*
-     * Increments the count
-     *
-     * @param base            the base
-     * @param baseQual        the base quality
-     * @param insQual         the insertion quality
-     * @param delQual         the deletion quality
-     * @param baseMappingQual the mapping quality
-     * @param isLowQualBase   true if the base is low quality
-     * @param isSoftClip      true if is soft-clipped
-     */
-    public void incr(final byte base, final byte baseQual, final byte insQual, final byte delQual, final int baseMappingQual, final boolean isLowQualBase, final boolean isSoftClip) {
-        // if we already have high quality bases, ignore low quality ones
-        if ( isLowQualBase && !isLowQuality() )
-            return;
-
-        // if this is a high quality base then remove any low quality bases and start from scratch
-        if ( !isLowQualBase && isLowQuality() ) {
-            if ( totalCount() > 0 )
-                clear();
-            setLowQuality(false);
-        }
-
-        final BaseIndex i = BaseIndex.byteToBase(base);
-        super.incr(i, baseQual, baseMappingQual, isSoftClip);
-        switch (i) {
-            case A: sumInsertionQual_A += insQual; sumDeletionQual_A += delQual; break;
-            case C: sumInsertionQual_C += insQual; sumDeletionQual_C += delQual; break;
-            case G: sumInsertionQual_G += insQual; sumDeletionQual_G += delQual; break;
-            case T: sumInsertionQual_T += insQual; sumDeletionQual_T += delQual; break;
-            case D: sumInsertionQual_D += insQual; sumDeletionQual_D += delQual; break;
-            case I: sumInsertionQual_I += insQual; sumDeletionQual_I += delQual; break;
-            case N: sumInsertionQual_N += insQual; sumDeletionQual_N += delQual; break;
-        }
-    }
-
-    /*
-     * Decrements the count
-     *
-     * @param base            the base
-     * @param baseQual        the base quality
-     * @param insQual         the insertion quality
-     * @param delQual         the deletion quality
-     * @param baseMappingQual the mapping quality
-     * @param isLowQualBase   true if the base is low quality
-     */
-   public void decr(final byte base, final byte baseQual, final byte insQual, final byte delQual, final int baseMappingQual, final boolean isLowQualBase) {
-        decr(base, baseQual, insQual, delQual, baseMappingQual, isLowQualBase, false);
-    }
-
-    /*
-     * Decrements the count
-     *
-     * @param base            the base
-     * @param baseQual        the base quality
-     * @param insQual         the insertion quality
-     * @param delQual         the deletion quality
-     * @param baseMappingQual the mapping quality
-     * @param isLowQualBase   true if the base is low quality
-     * @param isSoftClip      true if is soft-clipped
-     */
-    public void decr(final byte base, final byte baseQual, final byte insQual, final byte delQual, final int baseMappingQual, final boolean isLowQualBase, final boolean isSoftClip) {
-        // if this is not the right type of base, ignore it
-        if ( isLowQualBase != isLowQuality() )
-            return;
-
-        final BaseIndex i = BaseIndex.byteToBase(base);
-        super.decr(i, baseQual, baseMappingQual, isSoftClip);
-        switch (i) {
-            case A: sumInsertionQual_A -= insQual; sumDeletionQual_A -= delQual; break;
-            case C: sumInsertionQual_C -= insQual; sumDeletionQual_C -= delQual; break;
-            case G: sumInsertionQual_G -= insQual; sumDeletionQual_G -= delQual; break;
-            case T: sumInsertionQual_T -= insQual; sumDeletionQual_T -= delQual; break;
-            case D: sumInsertionQual_D -= insQual; sumDeletionQual_D -= delQual; break;
-            case I: sumInsertionQual_I -= insQual; sumDeletionQual_I -= delQual; break;
-            case N: sumInsertionQual_N -= insQual; sumDeletionQual_N -= delQual; break;
-        }
-    }
-
-    public byte averageInsertionQualsOfBase(final BaseIndex base) {
-        return (byte) (getInsertionQual(base) / countOfBase(base));
-    }
-
-    public byte averageDeletionQualsOfBase(final BaseIndex base) {
-        return (byte) (getDeletionQual(base) / countOfBase(base));
-    }
-
-    private long getInsertionQual(final BaseIndex base) {
-        switch (base) {
-            case A: return sumInsertionQual_A;
-            case C: return sumInsertionQual_C;
-            case G: return sumInsertionQual_G;
-            case T: return sumInsertionQual_T;
-            case D: return sumInsertionQual_D;
-            case I: return sumInsertionQual_I;
-            case N: return sumInsertionQual_N;
-            default: throw new IllegalArgumentException(base.name());
-        }
-    }
-
-    private long getDeletionQual(final BaseIndex base) {
-        switch (base) {
-            case A: return sumDeletionQual_A;
-            case C: return sumDeletionQual_C;
-            case G: return sumDeletionQual_G;
-            case T: return sumDeletionQual_T;
-            case D: return sumDeletionQual_D;
-            case I: return sumDeletionQual_I;
-            case N: return sumDeletionQual_N;
-            default: throw new IllegalArgumentException(base.name());
-        }
-    }
-
-    /**
-     * Clears out all stored data in this object
-     */
-    public void clear() {
-        super.clear();
-        sumInsertionQual_A = sumInsertionQual_C = sumInsertionQual_G = sumInsertionQual_T = sumInsertionQual_D = sumInsertionQual_I = sumInsertionQual_N = 0;
-        sumDeletionQual_A = sumDeletionQual_C = sumDeletionQual_G = sumDeletionQual_T = sumDeletionQual_D = sumDeletionQual_I = sumDeletionQual_N = 0;
-    }
-}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/BaseCounts.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/BaseCounts.java
deleted file mode 100644
index e1329db3b..000000000
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/BaseCounts.java
+++ /dev/null
@@ -1,411 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.compression.reducereads;
-
-import com.google.java.contract.Ensures;
-import com.google.java.contract.Requires;
-import it.unimi.dsi.fastutil.ints.IntArrayList;
-import org.broadinstitute.sting.utils.MathUtils;
-
-
-/**
- * An object to keep track of the number of occurrences of each base and it's quality.
- *
- * User: depristo
- * Date: 4/8/11
- * Time: 2:55 PM
- */
-
- public class BaseCounts {
-    public final static BaseIndex MAX_BASE_INDEX_WITH_NO_COUNTS = BaseIndex.N;
-    public final static byte MAX_BASE_WITH_NO_COUNTS = MAX_BASE_INDEX_WITH_NO_COUNTS.getByte();
-
-
-    private int count_A = 0;              // keeps track of the base counts
-    private int sumQual_A = 0;            // keeps track of the quals of each base
-    private int count_C = 0;
-    private int sumQual_C = 0;
-    private int count_G = 0;
-    private int sumQual_G = 0;
-    private int count_T = 0;
-    private int sumQual_T = 0;
-    private int count_D = 0;
-    private int sumQual_D = 0;
-    private int count_I = 0;
-    private int sumQual_I = 0;
-    private int count_N = 0;
-    private int sumQual_N = 0;
-    private int totalCount = 0;       // keeps track of total count since this is requested so often
-    private int nSoftClippedBases = 0;
-    private final IntArrayList mappingQualities = new IntArrayList();  // keeps the mapping quality of each read that contributed to this
-    private boolean isLowQuality = true;  // this object represents low quality bases unless we are told otherwise
-
-
-    public static BaseCounts createWithCounts(int[] countsACGT) {
-        BaseCounts baseCounts = new BaseCounts();
-        baseCounts.count_A = countsACGT[0];
-        baseCounts.count_C = countsACGT[1];
-        baseCounts.count_G = countsACGT[2];
-        baseCounts.count_T = countsACGT[3];
-        baseCounts.totalCount = countsACGT[0] + countsACGT[1] + countsACGT[2] + countsACGT[3];
-        return baseCounts;
-    }
-
-    @Requires("other != null")
-    public void add(final BaseCounts other) {
-        this.count_A += other.count_A;
-        this.count_C += other.count_C;
-        this.count_G += other.count_G;
-        this.count_T += other.count_T;
-        this.count_D += other.count_D;
-        this.count_I += other.count_I;
-        this.count_N += other.count_N;
-        this.totalCount += other.totalCount;
-        this.nSoftClippedBases = other.nSoftClippedBases;
-        this.mappingQualities.addAll(other.mappingQualities);
-    }
-
-    @Requires("other != null")
-    public void sub(final BaseCounts other) {
-        this.count_A -= other.count_A;
-        this.count_C -= other.count_C;
-        this.count_G -= other.count_G;
-        this.count_T -= other.count_T;
-        this.count_D -= other.count_D;
-        this.count_I -= other.count_I;
-        this.count_N -= other.count_N;
-        this.totalCount -= other.totalCount;
-        this.nSoftClippedBases -= other.nSoftClippedBases;
-        this.mappingQualities.removeAll(other.mappingQualities);
-    }
-
-    @Ensures("totalCount() == old(totalCount()) || totalCount() == old(totalCount()) + 1")
-    public void incr(final byte base) {
-        add(BaseIndex.byteToBase(base), 1);
-    }
-
-    @Ensures("totalCount() == old(totalCount()) || totalCount() == old(totalCount()) + 1")
-    public void incr(final BaseIndex base, final byte qual, final int mappingQuality, final boolean isSoftclip) {
-        switch (base) {
-            case A: ++count_A; sumQual_A += qual; break;
-            case C: ++count_C; sumQual_C += qual; break;
-            case G: ++count_G; sumQual_G += qual; break;
-            case T: ++count_T; sumQual_T += qual; break;
-            case D: ++count_D; sumQual_D += qual; break;
-            case I: ++count_I; sumQual_I += qual; break;
-            case N: ++count_N; sumQual_N += qual; break;
-        }
-        ++totalCount;
-        nSoftClippedBases += isSoftclip ? 1 : 0;
-        mappingQualities.add(mappingQuality);
-    }
-
-    @Ensures("totalCount() == old(totalCount()) || totalCount() == old(totalCount()) - 1")
-    public void decr(final byte base) {
-        add(BaseIndex.byteToBase(base), -1);
-    }
-
-    private void add(final BaseIndex base, int amount) {
-        switch(base) {
-            case A: count_A += amount; break;
-            case C: count_C += amount; break;
-            case G: count_G += amount; break;
-            case T: count_T += amount; break;
-            case D: count_D += amount; break;
-            case I: count_I += amount; break;
-            case N: count_N += amount; break;
-        }
-        totalCount += amount;
-    }
-
-    @Ensures("totalCount() == old(totalCount()) || totalCount() == old(totalCount()) - 1")
-    public void decr(final BaseIndex base, final byte qual, final int mappingQuality, final boolean isSoftclip) {
-        switch (base) {
-            case A: --count_A; sumQual_A -= qual; break;
-            case C: --count_C; sumQual_C -= qual; break;
-            case G: --count_G; sumQual_G -= qual; break;
-            case T: --count_T; sumQual_T -= qual; break;
-            case D: --count_D; sumQual_D -= qual; break;
-            case I: --count_I; sumQual_I -= qual; break;
-            case N: --count_N; sumQual_N -= qual; break;
-        }
-        --totalCount;
-        nSoftClippedBases -= isSoftclip ? 1 : 0;
-        mappingQualities.remove((Integer) mappingQuality);
-    }
-
-    @Ensures("result >= 0")
-    public long getSumQuals(final byte base) {
-        return getSumQuals(BaseIndex.byteToBase(base));
-    }
-
-    @Ensures("result >= 0")
-    public long getSumQuals(final BaseIndex base) {
-        switch (base) {
-            case A: return sumQual_A;
-            case C: return sumQual_C;
-            case G: return sumQual_G;
-            case T: return sumQual_T;
-            case D: return sumQual_D;
-            case I: return sumQual_I;
-            case N: return sumQual_N;
-            default: throw new IllegalArgumentException(base.name());
-        }
-    }
-
-    @Ensures("result >= 0")
-    public byte averageQuals(final byte base) {
-        return averageQuals(BaseIndex.byteToBase(base));
-    }
-
-    @Ensures("result >= 0")
-    public byte averageQuals(final BaseIndex base) {
-        return (byte) (getSumQuals(base) / countOfBase(base));
-    }
-
-    @Ensures("result >= 0")
-    public int countOfBase(final byte base) {
-        return countOfBase(BaseIndex.byteToBase(base));
-    }
-
-    @Ensures("result >= 0")
-    public int countOfBase(final BaseIndex base) {
-        switch (base) {
-            case A: return count_A;
-            case C: return count_C;
-            case G: return count_G;
-            case T: return count_T;
-            case D: return count_D;
-            case I: return count_I;
-            case N: return count_N;
-            default: throw new IllegalArgumentException(base.name());
-        }
-    }
-
-    @Ensures("result >= 0")
-    public long sumQualsOfBase(final BaseIndex base) {
-        return getSumQuals(base);
-    }
-
-    @Ensures("result >= 0")
-    public byte averageQualsOfBase(final BaseIndex base) {
-        return (byte) (sumQualsOfBase(base) / countOfBase(base));
-    }
-
-    @Ensures("result >= 0")
-    public int nSoftclips() {
-        return nSoftClippedBases;
-    }
-
-    @Ensures("result >= 0")
-    public int totalCount() {
-        return totalCount;
-    }
-
-    /**
-     * The RMS of the mapping qualities of all reads that contributed to this object
-     *
-     * @return the RMS of the mapping qualities of all reads that contributed to this object
-     */
-    public double getRMS() {
-        return MathUtils.rms(mappingQualities);
-    }
-
-    /**
-     * Given a base , it returns the proportional count of this base compared to all other bases
-     *
-     * @param base     base
-     * @return the proportion of this base over all other bases
-     */
-    @Ensures({"result >=0.0", "result<= 1.0"})
-    public double baseCountProportion(final byte base) {
-        return baseCountProportion(BaseIndex.byteToBase(base));
-    }
-
-    /**
-     * Given a base , it returns the proportional count of this base compared to all other bases
-     *
-     * @param baseIndex    base
-     * @return the proportion of this base over all other bases
-     */
-    @Ensures({"result >=0.0", "result<= 1.0"})
-    public double baseCountProportion(final BaseIndex baseIndex) {
-        return (totalCount == 0) ? 0.0 : (double)countOfBase(baseIndex) / (double)totalCount;
-    }
-
-    @Ensures("result != null")
-    public String toString() {
-        StringBuilder b = new StringBuilder();
-        for (final BaseIndex i : BaseIndex.values()) {
-            b.append(i.toString()).append("=").append(countOfBase(i)).append(",");
-        }
-        return b.toString();
-    }
-
-    public byte baseWithMostCounts() {
-        return baseIndexWithMostCounts().getByte();
-    }
-
-    /**
-     * @return the base index for which the count is highest, including indel indexes
-     */
-    @Ensures("result != null")
-    public BaseIndex baseIndexWithMostCounts() {
-        return baseIndexWithMostCounts(true);
-    }
-
-    /**
-     * @return the base index for which the count is highest, excluding indel indexes
-     */
-    @Ensures("result != null")
-    public BaseIndex baseIndexWithMostCountsWithoutIndels() {
-        return baseIndexWithMostCounts(false);
-    }
-
-    /**
-     * Finds the base index with the most counts
-     *
-     * @param allowIndels    should we allow base indexes representing indels?
-     * @return non-null base index
-     */
-    @Ensures("result != null")
-    protected BaseIndex baseIndexWithMostCounts(final boolean allowIndels) {
-        BaseIndex maxI = MAX_BASE_INDEX_WITH_NO_COUNTS;
-        int maxCount = countOfBase(maxI);
-
-        for (final BaseIndex i : BaseIndex.values()) {
-            if ( !allowIndels && !i.isNucleotide() )
-                continue;
-
-            final int myCount = countOfBase(i);
-            if (myCount > maxCount) {
-                maxI = i;
-                maxCount = myCount;
-            }
-        }
-        return maxI;
-    }
-
-    public byte baseWithMostProbability() {
-        return baseIndexWithMostProbability().getByte();
-    }
-
-    @Ensures("result != null")
-    public BaseIndex baseIndexWithMostProbability() {
-        return baseIndexWithMostProbability(true);
-    }
-
-    @Ensures("result != null")
-    public BaseIndex baseIndexWithMostProbabilityWithoutIndels() {
-        return baseIndexWithMostProbability(false);
-    }
-
-    /**
-     * Finds the base index with the most probability
-     *
-     * @param allowIndels    should we allow base indexes representing indels?
-     * @return non-null base index
-     */
-    @Ensures("result != null")
-    public BaseIndex baseIndexWithMostProbability(final boolean allowIndels) {
-        BaseIndex maxI = MAX_BASE_INDEX_WITH_NO_COUNTS;
-        long maxSum = getSumQuals(maxI);
-
-        for (final BaseIndex i : BaseIndex.values()) {
-            if ( !allowIndels && !i.isNucleotide() )
-                continue;
-
-            final long mySum = getSumQuals(i);
-            if (mySum > maxSum) {
-                maxI = i;
-                maxSum = mySum;
-            }
-        }
-        return (maxSum > 0L ? maxI : baseIndexWithMostCounts(allowIndels));
-    }
-
-    @Ensures("result >=0")
-    public int totalCountWithoutIndels() {
-        return totalCount - countOfBase(BaseIndex.D) - countOfBase(BaseIndex.I);
-    }
-
-    /**
-     * Calculates the proportional count of a base compared to all other bases except indels (I and D)
-     *
-     * @param base      base
-     * @return the proportion of this base over all other bases except indels
-     */
-    @Requires("base.isNucleotide()")
-    @Ensures({"result >=0.0", "result<= 1.0"})
-    public double baseCountProportionWithoutIndels(final BaseIndex base) {
-        final int total = totalCountWithoutIndels();
-        return (total == 0) ? 0.0 : (double)countOfBase(base) / (double)total;
-    }
-
-    /**
-     * @return true if this instance represents low quality bases
-     */
-    public boolean isLowQuality() { return isLowQuality; }
-
-    /**
-     * Sets the low quality value
-     *
-     * @param value    true if this instance represents low quality bases false otherwise
-     */
-    public void setLowQuality(final boolean value) { isLowQuality = value; }
-
-    /**
-     * Clears out all stored data in this object
-     */
-    public void clear() {
-        count_A = count_C = count_G = count_T = count_D = count_I = count_N = 0;
-        sumQual_A = sumQual_C = sumQual_G = sumQual_T = sumQual_D = sumQual_I = sumQual_N = 0;
-        totalCount = 0;
-        nSoftClippedBases = 0;
-        mappingQualities.clear();
-    }
-}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/BaseIndex.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/BaseIndex.java
deleted file mode 100644
index 665e3e7ce..000000000
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/BaseIndex.java
+++ /dev/null
@@ -1,136 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.compression.reducereads;
-
-import org.broadinstitute.sting.utils.exceptions.ReviewedStingException;
-
-/**
- * Simple byte / base index conversions
- *
- *
- * @author carneiro
- * @since 8/26/11
- */
-public enum BaseIndex {
-    A ( 'A', 0 ),
-    C ( 'C', 1 ),
-    G ( 'G', 2 ),
-    T ( 'T', 3 ),
-    D ( 'D', 4 ),
-    I ( 'I', 5 ), // insertion to the right of the base
-    N ( 'N', 6 );
-
-    final byte b;
-    final int index;
-
-    public byte getByte() { return b; }
-
-    /**
-     * Ordinal is stored in SyntheticRead rather than enum to save object reference, and store as byte for compactness.
-     * It is stored as byte, and this method merely eliminates a cast.
-     */
-    public byte getOrdinalByte() { return (byte)ordinal(); }
-
-    private BaseIndex(char base, int index) {
-        this.b = (byte)base;
-        this.index = index;
-    }
-
-    /**
-     * Converts a byte representation of a base to BaseIndex
-     *
-     * @param base the byte representation of the base
-     * @return the BaseIndex representation of the base;
-     */
-    public static BaseIndex byteToBase(final byte base) {
-        switch (base) {
-            case 'A':
-            case 'a':
-                return A;
-            case 'C':
-            case 'c':
-                return C;
-            case 'G':
-            case 'g':
-                return G;
-            case 'T':
-            case 't':
-                return T;
-            case 'D':
-            case 'd':
-            case '-':
-                return D;
-            case 'I':
-            case 'i':
-                return I;
-            case 'N':
-            case 'n':
-                return N;
-            default: throw new ReviewedStingException("Tried to create a byte index for an impossible base " + base);
-        }
-    }
-
-    /**
-     * Definition of a nucleotide for the BaseIndex is anything that has been read as a base
-     * by the machine (A,C,G,T), even if it couldn't tell which base it was, but it knows
-     * there is a base there (N).
-     *
-     * @return whether or not it is a nucleotide, given the definition above
-     */
-    public final boolean isNucleotide() {
-        return !isIndel();
-    }
-
-    /**
-     * Whether or not this base is an insertion or a deletion
-     *
-     * @return true for I or D, false otherwise
-     */
-    public final boolean isIndel() {
-        return this == D || this == I;
-    }
-}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/CompressionStash.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/CompressionStash.java
deleted file mode 100644
index 22ea78521..000000000
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/CompressionStash.java
+++ /dev/null
@@ -1,107 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.compression.reducereads;
-
-import it.unimi.dsi.fastutil.objects.ObjectAVLTreeSet;
-import it.unimi.dsi.fastutil.objects.ObjectSortedSet;
-import org.broadinstitute.sting.utils.*;
-
-import java.util.Collection;
-
-
-/**
- * A stash of regions that must be kept uncompressed in all samples
- *
- * In general, these are regions that were kept uncompressed by a tumor sample and we want to force
- * all other samples (normals and/or tumors) to also keep these regions uncompressed
- *
- * User: carneiro
- * Date: 10/15/12
- * Time: 4:08 PM
- */
-public class CompressionStash extends ObjectAVLTreeSet<FinishedGenomeLoc> {
-    public CompressionStash() {
-        super();
-    }
-
-    /**
-     * Adds a UnvalidatingGenomeLoc to the stash and merges it with any overlapping (and contiguous) existing loc
-     * in the stash.
-     *
-     * @param insertLoc the new loc to be inserted
-     * @return true if the loc, or it's merged version, wasn't present in the list before.
-     */
-    @Override
-    public boolean add(final FinishedGenomeLoc insertLoc) {
-        ObjectSortedSet<FinishedGenomeLoc> removedLocs = new ObjectAVLTreeSet<FinishedGenomeLoc>();
-        for (FinishedGenomeLoc existingLoc : this) {
-            if (existingLoc.isPast(insertLoc)) {
-                break;                                          // if we're past the loc we're done looking for overlaps.
-            }
-            if (existingLoc.equals(insertLoc)) {
-                return false;                                   // if this loc was already present in the stash, we don't need to insert it.
-            }
-            if (existingLoc.contiguousP(insertLoc)) {
-                removedLocs.add(existingLoc);                   // list the original loc for merging
-            }
-        }
-
-        this.removeAll(removedLocs);                            // remove all locs that will be merged
-        removedLocs.add(insertLoc);                             // add the new loc to the list of locs that will be merged
-
-        return super.add(new FinishedGenomeLoc(GenomeLoc.merge(removedLocs), insertLoc.isFinished()));
-    }
-
-    @Override
-    public boolean addAll(Collection<? extends FinishedGenomeLoc> locs) {
-        boolean result = false;
-        for (final FinishedGenomeLoc loc : locs) {
-            result |= this.add(loc);
-        }
-        return result;
-    }
-}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/Compressor.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/Compressor.java
deleted file mode 100644
index 1c0336ebf..000000000
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/Compressor.java
+++ /dev/null
@@ -1,108 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.compression.reducereads;
-
-import com.google.java.contract.Ensures;
-import com.google.java.contract.Requires;
-import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
-
-/*
- * Copyright (c) 2009 The Broad Institute
- *
- * 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.
- */
-
-/**
- * Created by IntelliJ IDEA.
- * User: depristo
- * Date: 4/10/11
- * Time: 8:49 AM
- *
- * A general interface for ReadCompressors.  Read compressors have the following semantics:
- *
- * The accept a stream of reads, in order, and after each added read returns a compressed stream
- * of reads for emission.  This stream of reads is a "reduced" representation of the total stream
- * of reads.  The actual compression approach is left up to the implementing class.
- */
-public interface Compressor {
-    /**
-     * Adds the read to the compressor.  The returned iteratable collection of
-     * reads represents the incremental compressed output.
-     * @param read the next uncompressed read in the input stream to the compressor
-     * @return an iterator over the incrementally available compressed reads
-     */
-    @Requires("read != null")
-    @Ensures("result != null")
-    Iterable<GATKSAMRecord> addAlignment(GATKSAMRecord read);
-
-    /**
-     * Must be called after the last read has been added to finalize the compressor state
-     * and return the last compressed reads from the compressor.
-     * @return an iterator over the final compressed reads of this compressor
-     */
-    @Ensures("result != null")
-    Iterable<GATKSAMRecord> close();
-}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/FinishedGenomeLoc.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/FinishedGenomeLoc.java
deleted file mode 100644
index 13010f905..000000000
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/FinishedGenomeLoc.java
+++ /dev/null
@@ -1,82 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.compression.reducereads;
-
-import org.broadinstitute.sting.utils.GenomeLoc;
-import org.broadinstitute.sting.utils.UnvalidatingGenomeLoc;
-
-/**
- * GenomeLocs are very useful objects to keep track of genomic locations and perform set operations
- * with them.
- *
- * However, GenomeLocs are bound to strict validation through the GenomeLocParser and cannot
- * be created easily for small tasks that do not require the rigors of the GenomeLocParser validation
- *
- * UnvalidatingGenomeLoc is a simple utility to create GenomeLocs without going through the parser. Should
- * only be used outside of the engine.
- *
- * User: carneiro
- * Date: 10/16/12
- * Time: 2:07 PM
- */
-public class FinishedGenomeLoc extends UnvalidatingGenomeLoc {
-    private boolean finished;
-
-    public FinishedGenomeLoc(final String contigName, final int contigIndex, final int start, final int stop, final boolean finished) {
-        super(contigName, contigIndex, start, stop);
-        this.finished = finished;
-    }
-
-    public FinishedGenomeLoc(final GenomeLoc loc, final boolean finished) {
-        super(loc.getContig(), loc.getContigIndex(), loc.getStart(), loc.getStop());
-        this.finished = finished;
-    }
-
-    public boolean isFinished() {
-        return finished;
-    }
-}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/HeaderElement.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/HeaderElement.java
deleted file mode 100644
index 5e84076fd..000000000
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/HeaderElement.java
+++ /dev/null
@@ -1,393 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.compression.reducereads;
-
-import it.unimi.dsi.fastutil.objects.ObjectArrayList;
-import org.broadinstitute.sting.utils.MathUtils;
-import org.broadinstitute.sting.utils.exceptions.ReviewedStingException;
-
-
-/**
- * The element that describes the header of the sliding window.
- *
- * Each site has a header element containing the counts of each base, it's reference based location and whether or
- * not the site has insertions (to it's right). It also contains information about the bases that have been filtered
- * out due to mapping or base quality.
- */
-public class HeaderElement {
-    private BaseAndQualsCounts positiveConsensusBaseCounts;                                                                     // How many A,C,G,T (and D's) are in this site.
-    private BaseAndQualsCounts negativeConsensusBaseCounts;                                                                     // How many A,C,G,T (and D's) are in this site.
-    private BaseAndQualsCounts filteredBaseCounts;                                                                      // How many A,C,G,T (and D's) were filtered out in this site.
-    private int insertionsToTheRight;                                                                                   // How many reads in this site had insertions to the immediate right
-    private int location;                                                                                               // Genome location of this site (the sliding window knows which contig we're at
-
-    protected static final int MIN_COUNT_FOR_USING_PVALUE = 2;
-
-    public int getLocation() {
-        return location;
-    }
-
-    /**
-     * Get the base counts object for the consensus type
-     *
-     * @param consensusType   the type to use
-     * @return non-null base counts
-     */
-    public BaseAndQualsCounts getBaseCounts(final SlidingWindow.ConsensusType consensusType) {
-        if ( consensusType == SlidingWindow.ConsensusType.POSITIVE_CONSENSUS )
-            return positiveConsensusBaseCounts;
-        if ( consensusType == SlidingWindow.ConsensusType.NEGATIVE_CONSENSUS )
-            return negativeConsensusBaseCounts;
-        return filteredBaseCounts;
-    }
-
-    /**
-     * Creates a new HeaderElement with the following default values: - empty consensusBaseCounts - empty
-     * filteredBaseCounts - 0 insertions to the right - empty mappingQuality list
-     *
-     * @param location the reference location for the new element
-     */
-    public HeaderElement(final int location) {
-        this(new BaseAndQualsCounts(), new BaseAndQualsCounts(), new BaseAndQualsCounts(), 0, location);
-    }
-
-    /**
-     * Creates a new HeaderElement with the following default values: - empty consensusBaseCounts - empty
-     * filteredBaseCounts - empty mappingQuality list
-     *
-     * @param location the reference location for the new element
-     */
-    public HeaderElement(final int location, final int insertionsToTheRight) {
-        this(new BaseAndQualsCounts(), new BaseAndQualsCounts(), new BaseAndQualsCounts(), insertionsToTheRight, location);
-    }
-
-    /**
-     * Creates a new HeaderElement with all given parameters
-     *
-     * @param positiveConsensusBaseCounts  the BaseCounts object for the running positive consensus synthetic read
-     * @param negativeConsensusBaseCounts  the BaseCounts object for the running negative consensus synthetic read
-     * @param filteredBaseCounts   the BaseCounts object for the filtered data synthetic read
-     * @param insertionsToTheRight number of insertions to the right of this HeaderElement
-     * @param location             the reference location of this reference element
-     *                             HeaderElement
-     */
-    public HeaderElement(final BaseAndQualsCounts positiveConsensusBaseCounts, final BaseAndQualsCounts negativeConsensusBaseCounts, final BaseAndQualsCounts filteredBaseCounts, final int insertionsToTheRight, final int location) {
-        this.positiveConsensusBaseCounts = positiveConsensusBaseCounts;
-        this.negativeConsensusBaseCounts = negativeConsensusBaseCounts;
-        this.filteredBaseCounts = filteredBaseCounts;
-        this.insertionsToTheRight = insertionsToTheRight;
-        this.location = location;
-    }
-
-    /**
-     * Whether or not the site represented by this HeaderElement is variant according to the definitions of variant
-     * by insertion, deletion and mismatches.
-     *
-     * @param minVariantPvalue       min p-value for deciding that a position is or is not variable due to mismatches
-     * @param minVariantProportion   min proportion for deciding that a position is or is not variable due to mismatches
-     * @param minIndelProportion     min proportion for deciding that a position is or is not variable due to indels
-     * @return true if site is variant by any definition. False otherwise.
-     */
-    public boolean isVariant(final double minVariantPvalue, final double minVariantProportion, final double minIndelProportion) {
-        return ( hasConsensusData(SlidingWindow.ConsensusType.POSITIVE_CONSENSUS) || hasConsensusData(SlidingWindow.ConsensusType.NEGATIVE_CONSENSUS) )
-                && (isVariantFromInsertions(minIndelProportion) || isVariantFromMismatches(minVariantPvalue, minVariantProportion) || isVariantFromDeletions(minIndelProportion) || isVariantFromSoftClips());
-    }
-
-    /**
-     * Adds a new base to the HeaderElement updating all counts accordingly
-     *
-     * @param base               the base to add
-     * @param baseQual           the base quality
-     * @param insQual            the base insertion quality
-     * @param delQual            the base deletion quality
-     * @param baseMappingQuality the mapping quality of the read this base belongs to
-     * @param minBaseQual        the minimum base qual allowed to be a good base
-     * @param minMappingQual     the minimum mapping qual allowed to be a good read
-     * @param isSoftClipped      true if the base is soft-clipped in the original read
-     * @param isNegativeStrand   true if the base comes from a read on the negative strand
-     */
-    public void addBase(final byte base, final byte baseQual, final byte insQual, final byte delQual, final int baseMappingQuality, final int minBaseQual, final int minMappingQual, final boolean isSoftClipped, final boolean isNegativeStrand) {
-        // If the base passes the MQ filter it is included in the consensus base counts, otherwise it's part of the filtered counts
-        if ( baseMappingQuality >= minMappingQual ) {
-            if ( isNegativeStrand )
-                negativeConsensusBaseCounts.incr(base, baseQual, insQual, delQual, baseMappingQuality, baseQual < minBaseQual, isSoftClipped);
-            else
-                positiveConsensusBaseCounts.incr(base, baseQual, insQual, delQual, baseMappingQuality, baseQual < minBaseQual, isSoftClipped);
-        } else {
-            filteredBaseCounts.incr(base, baseQual, insQual, delQual, baseMappingQuality, baseQual < minBaseQual);
-        }
-    }
-
-    /**
-     * Adds a new base to the HeaderElement updating all counts accordingly
-     *
-     * @param base               the base to add
-     * @param baseQual           the base quality
-     * @param insQual            the base insertion quality
-     * @param delQual            the base deletion quality
-     * @param baseMappingQuality the mapping quality of the read this base belongs to
-     * @param minBaseQual        the minimum base qual allowed to be a good base
-     * @param minMappingQual     the minimum mapping qual allowed to be a good read
-     * @param isSoftClipped      true if the base is soft-clipped in the original read
-     * @param isNegativeStrand   true if the base comes from a read on the negative strand
-     */
-    public void removeBase(final byte base, final byte baseQual, final byte insQual, final byte delQual, final int baseMappingQuality, final int minBaseQual, final int minMappingQual, final boolean isSoftClipped, final boolean isNegativeStrand) {
-        // If the base passes the MQ filter it is included in the consensus base counts, otherwise it's part of the filtered counts
-        if ( baseMappingQuality >= minMappingQual ) {
-            if ( isNegativeStrand )
-                negativeConsensusBaseCounts.decr(base, baseQual, insQual, delQual, baseMappingQuality, baseQual < minBaseQual, isSoftClipped);
-            else
-                positiveConsensusBaseCounts.decr(base, baseQual, insQual, delQual, baseMappingQuality, baseQual < minBaseQual, isSoftClipped);
-        } else {
-            filteredBaseCounts.decr(base, baseQual, insQual, delQual, baseMappingQuality, baseQual < minBaseQual);
-        }
-    }
-
-    /**
-     * Adds an insertions to the right of the HeaderElement and updates all counts accordingly. All insertions
-     * should be added to the right of the element.
-     */
-    public void addInsertionToTheRight() {
-        insertionsToTheRight++;
-    }
-
-    /**
-     * Does this HeaderElement contain consensus data?
-     *
-     * @param consensusType   the type to use
-     * @return whether or not this HeaderElement contains consensus data
-     */
-    public boolean hasConsensusData(final SlidingWindow.ConsensusType consensusType) {
-        return getBaseCounts(consensusType).totalCount() > 0;
-    }
-
-    /**
-     * A HeaderElement is empty if it has no consensus or filtered data
-     *
-     * @return whether or not this HeaderElement has no data
-     */
-    public boolean isEmpty() {
-        return !hasConsensusData(SlidingWindow.ConsensusType.POSITIVE_CONSENSUS) && !hasConsensusData(SlidingWindow.ConsensusType.NEGATIVE_CONSENSUS) && !hasConsensusData(SlidingWindow.ConsensusType.FILTERED);
-    }
-
-    /**
-     * removes an insertion from this element (if you removed a read that had an insertion)
-     */
-    public void removeInsertionToTheRight() {
-        this.insertionsToTheRight--;
-        if (insertionsToTheRight < 0)
-            throw new ReviewedStingException("Removed too many insertions, header is now negative at position " + location);
-    }
-
-    public boolean hasInsertionToTheRight() {
-        return insertionsToTheRight > 0;
-    }
-
-    public int numInsertionsToTheRight() {
-        return insertionsToTheRight;
-    }
-
-    /**
-     * Whether or not the HeaderElement is variant due to excess insertions
-     *
-     * @return whether or not the HeaderElement is variant due to excess insertions
-     */
-    private boolean isVariantFromInsertions(double minIndelProportion) {
-        final int numberOfBases = totalCountForBothStrands();
-        if (numberOfBases == 0)
-            return (insertionsToTheRight > 0); // do we only have insertions?
-
-        // if we have bases and insertions, check the ratio
-        return ((double) insertionsToTheRight / numberOfBases) > minIndelProportion;
-    }
-
-    private int totalCountForBothStrands() {
-        return positiveConsensusBaseCounts.totalCount() + negativeConsensusBaseCounts.totalCount();
-    }
-
-    /**
-     * Whether or not the HeaderElement is variant due to excess deletions
-     *
-     * @return whether or not the HeaderElement is variant due to excess deletions
-     */
-    private boolean isVariantFromDeletions(double minIndelProportion) {
-        return positiveConsensusBaseCounts.baseIndexWithMostCounts() == BaseIndex.D || positiveConsensusBaseCounts.baseCountProportion(BaseIndex.D) > minIndelProportion
-                || negativeConsensusBaseCounts.baseIndexWithMostCounts() == BaseIndex.D || negativeConsensusBaseCounts.baseCountProportion(BaseIndex.D) > minIndelProportion;
-    }
-
-    /**
-     * Whether or not the HeaderElement is variant due to excess mismatches
-     *
-     * @param minVariantPvalue     the minimum pvalue to call a site variant (used with low coverage).
-     * @param minVariantProportion the minimum proportion to call a site variant (used with high coverage).
-     * @return whether or not the HeaderElement is variant due to excess mismatches
-     */
-    protected boolean isVariantFromMismatches(final double minVariantPvalue, final double minVariantProportion) {
-        return isVariantFromMismatches(minVariantPvalue, minVariantProportion, SlidingWindow.ConsensusType.POSITIVE_CONSENSUS) ||
-                isVariantFromMismatches(minVariantPvalue, minVariantProportion, SlidingWindow.ConsensusType.NEGATIVE_CONSENSUS);
-    }
-
-    /**
-     * Whether or not the HeaderElement is variant due to excess mismatches
-     *
-     * @param minVariantPvalue     the minimum pvalue to call a site variant (used with low coverage).
-     * @param minVariantProportion the minimum proportion to call a site variant (used with high coverage).
-     * @param consensusType        the consensus type to use
-     * @return whether or not the HeaderElement is variant due to excess mismatches
-     */
-    private boolean isVariantFromMismatches(final double minVariantPvalue, final double minVariantProportion, final SlidingWindow.ConsensusType consensusType) {
-        final BaseAndQualsCounts baseAndQualsCounts = getBaseCounts(consensusType);
-        final int totalCount = baseAndQualsCounts.totalCountWithoutIndels();
-        final BaseIndex mostCommon = baseAndQualsCounts.baseIndexWithMostProbabilityWithoutIndels();
-        final int countOfOtherBases = totalCount - baseAndQualsCounts.countOfBase(mostCommon);
-        return hasSignificantCount(countOfOtherBases, totalCount, minVariantPvalue, minVariantProportion);
-    }
-
-    /**
-     * This handles the special case where we have more bases that came from soft clips than bases that came from
-     * normal bases by forcing it to become a variant region. We don't want a consensus based on too little information.
-     *
-     * @return true if we had more soft clipped bases contributing to this site than matches/mismatches.
-     */
-    protected boolean isVariantFromSoftClips() {
-        return isVariantFromSoftClips(SlidingWindow.ConsensusType.POSITIVE_CONSENSUS) || isVariantFromSoftClips(SlidingWindow.ConsensusType.NEGATIVE_CONSENSUS);
-    }
-
-    /**
-     * This handles the special case where we have more bases that came from soft clips than bases that came from
-     * normal bases by forcing it to become a variant region. We don't want a consensus based on too little information.
-     *
-     * @param consensusType        the consensus type to use
-     * @return true if we had more soft clipped bases contributing to this site than matches/mismatches.
-     */
-    private boolean isVariantFromSoftClips(final SlidingWindow.ConsensusType consensusType) {
-        final BaseAndQualsCounts baseAndQualsCounts = getBaseCounts(consensusType);
-        final int nSoftClippedBases = baseAndQualsCounts.nSoftclips();
-        return nSoftClippedBases > 0 && nSoftClippedBases >= (baseAndQualsCounts.totalCount() - nSoftClippedBases);
-    }
-
-    /**
-     * Calculates the number of alleles necessary to represent this site.
-     *
-     * @param minVariantPvalue     the minimum pvalue to call a site variant.
-     * @param minVariantProportion the minimum proportion to call a site variant.
-     * @return the number of alleles necessary to represent this site or -1 if there are too many indels
-     */
-    public int getNumberOfBaseAlleles(final double minVariantPvalue, final double minVariantProportion) {
-        final ObjectArrayList<BaseIndex> alleles = getAlleles(minVariantPvalue, minVariantProportion);
-        return alleles == null ? -1 : alleles.size();
-    }
-
-    /**
-     * Calculates the alleles necessary to represent this site.
-     *
-     * @param minVariantPvalue     the minimum pvalue to call a site variant.
-     * @param minVariantProportion the minimum proportion to call a site variant.
-     * @return the list of alleles necessary to represent this site or null if there are too many indels
-     */
-    public ObjectArrayList<BaseIndex> getAlleles(final double minVariantPvalue, final double minVariantProportion) {
-        // make sure we have bases at all
-        final int totalBaseCount = totalCountForBothStrands();
-        if ( totalBaseCount == 0 )
-            return new ObjectArrayList<>(0);
-
-        // next, check for insertions; technically, the insertion count can be greater than totalBaseCount
-        // (because of the way insertions are counted), so we need to account for that
-        if ( hasSignificantCount(Math.min(totalBaseCount, insertionsToTheRight), totalBaseCount, minVariantPvalue, minVariantProportion) )
-            return null;
-
-        // finally, check for the bases themselves (including deletions)
-        final ObjectArrayList<BaseIndex> alleles = new ObjectArrayList<>(4);
-        for ( final BaseIndex base : BaseIndex.values() ) {
-            final int baseCount = positiveConsensusBaseCounts.countOfBase(base) + negativeConsensusBaseCounts.countOfBase(base);
-            if ( baseCount == 0 )
-                continue;
-
-            if ( hasSignificantCount(baseCount, totalBaseCount, minVariantPvalue, minVariantProportion) ) {
-                if ( base == BaseIndex.D )
-                    return null;
-                alleles.add(base);
-            }
-        }
-        return alleles;
-    }
-
-    /*
-     * Checks whether there are a significant number of softclips.
-     *
-     * @param minVariantPvalue     the minimum pvalue to call a site variant.
-     * @param minVariantProportion the minimum proportion to call a site variant.
-     * @return true if there are significant softclips, false otherwise
-     */
-    public boolean hasSignificantSoftclips(final double minVariantPvalue, final double minVariantProportion) {
-        return hasSignificantCount(positiveConsensusBaseCounts.nSoftclips() + negativeConsensusBaseCounts.nSoftclips(), totalCountForBothStrands(), minVariantPvalue, minVariantProportion);
-    }
-
-    /*
-     * Checks whether there are a significant number of count.
-     *
-     * @param count                the count (k) to test against
-     * @param total                the total (n) to test against
-     * @param minVariantPvalue     the minimum pvalue to call a site variant.
-     * @param minVariantProportion the minimum proportion to call a site variant.
-     * @return true if there is a significant count given the provided pvalue, false otherwise
-     */
-    private boolean hasSignificantCount(final int count, final int total, final double minVariantPvalue, final double minVariantProportion) {
-        if ( count == 0 || total == 0 )
-            return false;
-
-        // use p-values for low counts of k
-        if ( count <= MIN_COUNT_FOR_USING_PVALUE ) {
-            final double pvalue = MathUtils.binomialCumulativeProbability(total, 0, count);
-            return pvalue > minVariantPvalue;
-        }
-
-        // otherwise, use straight proportions
-        final int minBaseCountForSignificance = (int)(minVariantProportion * total);
-        return count >= minBaseCountForSignificance;
-    }
-}
\ No newline at end of file
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/MultiSampleCompressor.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/MultiSampleCompressor.java
deleted file mode 100644
index bdd407fba..000000000
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/MultiSampleCompressor.java
+++ /dev/null
@@ -1,163 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.compression.reducereads;
-
-import com.google.java.contract.Ensures;
-import it.unimi.dsi.fastutil.objects.*;
-import net.sf.samtools.SAMFileHeader;
-import org.apache.log4j.Logger;
-import org.broadinstitute.sting.utils.GenomeLoc;
-import org.broadinstitute.sting.utils.SampleUtils;
-import org.broadinstitute.sting.utils.collections.Pair;
-import org.broadinstitute.sting.utils.exceptions.ReviewedStingException;
-import org.broadinstitute.sting.utils.sam.AlignmentStartWithNoTiesComparator;
-import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
-
-
-/*
- * Copyright (c) 2009 The Broad Institute
- *
- * 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.
- */
-
-/**
- *
- * @author depristo
- */
-public class MultiSampleCompressor {
-    protected static final Logger logger = Logger.getLogger(MultiSampleCompressor.class);
-
-    protected Object2ObjectMap<String, SingleSampleCompressor> compressorsPerSample = new Object2ObjectOpenHashMap<String, SingleSampleCompressor>();
-
-    public MultiSampleCompressor(SAMFileHeader header,
-                                 final int contextSize,
-                                 final int downsampleCoverage,
-                                 final int minMappingQuality,
-                                 final double minAltPValueToTriggerVariant,
-                                 final double minAltProportionToTriggerVariant,
-                                 final double minIndelProportionToTriggerVariant,
-                                 final int minBaseQual,
-                                 final ReduceReads.DownsampleStrategy downsampleStrategy) {
-        for ( String name : SampleUtils.getSAMFileSamples(header) ) {
-            compressorsPerSample.put(name,
-                    new SingleSampleCompressor(contextSize, downsampleCoverage,
-                                    minMappingQuality, minAltPValueToTriggerVariant, minAltProportionToTriggerVariant, minIndelProportionToTriggerVariant, minBaseQual, downsampleStrategy));
-        }
-    }
-
-    /**
-     * Add an alignment to the compressor
-     *
-     * @param read                  the read to be added
-     * @param knownSnpPositions     the set of known SNP positions
-     * @return any compressed reads that may have resulted from adding this read to the machinery (due to the sliding window)
-     */
-    public ObjectSet<GATKSAMRecord> addAlignment(final GATKSAMRecord read, final ObjectSortedSet<GenomeLoc> knownSnpPositions) {
-        String sampleName = read.getReadGroup().getSample();
-        SingleSampleCompressor compressor = compressorsPerSample.get(sampleName);
-        if ( compressor == null )
-            throw new ReviewedStingException("No compressor for sample " + sampleName);
-        Pair<ObjectSet<GATKSAMRecord>, CompressionStash> readsAndStash = compressor.addAlignment(read, knownSnpPositions);
-        ObjectSet<GATKSAMRecord> reads = readsAndStash.getFirst();
-        CompressionStash regions = readsAndStash.getSecond();
-
-        reads.addAll(closeVariantRegionsInAllSamples(regions, knownSnpPositions));
-
-        return reads;
-    }
-
-    /**
-     * Properly closes the compressor.
-     *
-     * @param knownSnpPositions  the set of known SNP positions
-     * @return A non-null set/list of all reads generated
-     */
-    @Ensures("result != null")
-    public ObjectSet<GATKSAMRecord> close(final ObjectSortedSet<GenomeLoc> knownSnpPositions) {
-        ObjectSet<GATKSAMRecord> reads = new ObjectAVLTreeSet<GATKSAMRecord>(new AlignmentStartWithNoTiesComparator());
-        for ( SingleSampleCompressor sample : compressorsPerSample.values() ) {
-            Pair<ObjectSet<GATKSAMRecord>, CompressionStash> readsAndStash = sample.close(knownSnpPositions);
-            reads.addAll(readsAndStash.getFirst());
-        }
-        return reads;
-    }
-
-    /**
-     * Finalizes current variant regions.
-     *
-     * @param knownSnpPositions  the set of known SNP positions
-     * @return A non-null set/list of all reads generated
-     */
-    private ObjectSet<GATKSAMRecord> closeVariantRegionsInAllSamples(final CompressionStash regions, final ObjectSortedSet<GenomeLoc> knownSnpPositions) {
-        ObjectSet<GATKSAMRecord> reads = new ObjectAVLTreeSet<GATKSAMRecord>(new AlignmentStartWithNoTiesComparator());
-        if (!regions.isEmpty()) {
-            for (SingleSampleCompressor sample : compressorsPerSample.values()) {
-                reads.addAll(sample.closeVariantRegions(regions, knownSnpPositions));
-            }
-        }
-        return reads;
-    }
-}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/ReduceReads.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/ReduceReads.java
deleted file mode 100644
index 383ba5ee9..000000000
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/ReduceReads.java
+++ /dev/null
@@ -1,782 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.compression.reducereads;
-
-import it.unimi.dsi.fastutil.objects.Object2LongOpenHashMap;
-import it.unimi.dsi.fastutil.objects.ObjectAVLTreeSet;
-import it.unimi.dsi.fastutil.objects.ObjectArrayList;
-import it.unimi.dsi.fastutil.objects.ObjectSortedSet;
-import net.sf.samtools.SAMFileHeader;
-import net.sf.samtools.SAMFileWriter;
-import net.sf.samtools.SAMProgramRecord;
-import net.sf.samtools.util.SequenceUtil;
-import org.broadinstitute.sting.commandline.*;
-import org.broadinstitute.sting.gatk.CommandLineGATK;
-import org.broadinstitute.sting.gatk.GenomeAnalysisEngine;
-import org.broadinstitute.sting.gatk.contexts.ReferenceContext;
-import org.broadinstitute.sting.gatk.downsampling.DownsampleType;
-import org.broadinstitute.sting.gatk.filters.*;
-import org.broadinstitute.sting.gatk.io.StingSAMFileWriter;
-import org.broadinstitute.sting.gatk.refdata.RefMetaDataTracker;
-import org.broadinstitute.sting.gatk.walkers.*;
-import org.broadinstitute.sting.utils.GenomeLoc;
-import org.broadinstitute.sting.utils.SampleUtils;
-import org.broadinstitute.sting.utils.Utils;
-import org.broadinstitute.sting.utils.clipping.ReadClipper;
-import org.broadinstitute.sting.utils.exceptions.ReviewedStingException;
-import org.broadinstitute.sting.utils.exceptions.UserException;
-import org.broadinstitute.sting.utils.help.DocumentedGATKFeature;
-import org.broadinstitute.sting.utils.help.HelpConstants;
-import org.broadinstitute.sting.utils.sam.BySampleSAMFileWriter;
-import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
-import org.broadinstitute.sting.utils.sam.ReadUtils;
-import org.broadinstitute.variant.variantcontext.VariantContext;
-
-import java.util.Collections;
-import java.util.List;
-
-
-/**
- * Reduces the BAM file using read based compression that keeps only essential information for variant calling
- *
- * <p>
- * This tool will generate reduced versions of the BAM files that still follow the BAM specification
- * and contain all the information necessary to call variants according to the GATK Best Practices recommendations.
- * Some options allow you to tune how much compression you want to achieve. The default values have been
- * shown to reduce a typical whole exome BAM file by 100x. The higher the coverage, the bigger the
- * savings in file size and performance of the downstream tools.
- *
- * <h3>Input</h3>
- * <p>
- * The BAM file to be compressed
- * </p>
- *
- * <h3>Output</h3>
- * <p>
- * The compressed (reduced) BAM file.
- *
- * <p/>
- * <h3>Examples</h3>
- * <pre>
- * java -Xmx4g -jar GenomeAnalysisTK.jar \
- *   -R ref.fasta \
- *   -T ReduceReads \
- *   -I myData.bam \
- *   -o myData.reduced.bam
- * </pre>
- */
-
-@DocumentedGATKFeature( groupName = HelpConstants.DOCS_CAT_DATA, extraDocs = {CommandLineGATK.class} )
-@PartitionBy(PartitionType.CONTIG)
-@ReadFilters({UnmappedReadFilter.class, NotPrimaryAlignmentFilter.class, DuplicateReadFilter.class, FailsVendorQualityCheckFilter.class, BadCigarFilter.class})
-@Downsample(by=DownsampleType.BY_SAMPLE, toCoverage=40)
-public class ReduceReads extends ReadWalker<ObjectArrayList<GATKSAMRecord>, ReduceReadsStash> {
-
-    @Output(required = false, defaultToStdout = false)
-    private StingSAMFileWriter out = null;
-    private SAMFileWriter writerToUse = null;
-
-    /**
-     *
-     */
-    @Argument(fullName = "context_size", shortName = "cs", doc = "The number of bases to keep around mismatches (potential variation)", required = false)
-    public int contextSize = 10;
-
-    /**
-     * Reads that have
-     * mapping quality below this threshold will not be counted towards consensus, but are still counted
-     * towards variable regions.
-     */
-    @Argument(fullName = "minimum_mapping_quality", shortName = "minmap", doc = "The minimum mapping quality to be considered for the consensus synthetic read", required = false)
-    public int minMappingQuality = 20;
-
-    /**
-     * Reads that have
-     * base quality below this threshold will not be counted towards consensus, but are still counted
-     * towards variable regions.
-     */
-    @Argument(fullName = "minimum_base_quality_to_consider", shortName = "minqual", doc = "The minimum base quality to be considered for the consensus synthetic read", required = false)
-    public byte minBaseQual = 15;
-
-    /**
-     * Reads have notoriously low quality bases on the tails (left and right).  Consecutive bases at the tails with
-     * quality at or lower than this threshold will be hard clipped off before entering the reduce reads algorithm.
-     */
-    @Argument(fullName = "minimum_tail_qualities", shortName = "mintail", doc = "", required = false)
-    public byte minTailQuality = 2;
-
-    /**
-     * Any number of VCF files representing known SNPs to be used for the polyploid-based reduction.
-     * Could be e.g. dbSNP and/or official 1000 Genomes SNP calls.  Non-SNP variants in these files will be ignored.
-     * If provided, the polyploid ("het") compression will work only when a single SNP from the known set is present
-     * in a consensus window (otherwise there will be no reduction); if not provided then polyploid compression will
-     * be triggered anywhere there is a single SNP present in a consensus window.
-     */
-    @Input(fullName="known_sites_for_polyploid_reduction", shortName = "known", doc="Input VCF file(s) with known SNPs", required=false)
-    public List<RodBinding<VariantContext>> known = Collections.emptyList();
-
-    /**
-     * This strips away all extra information of the read -- anything other than bases, quals
-     * and read group.
-     */
-    @Argument(fullName = "dont_simplify_reads", shortName = "nosimplify", doc = "Do not simplify read", required = false)
-    public boolean DONT_SIMPLIFY_READS = false;
-
-    /**
-     * Note that it is not necessary to turn this on for reads that are not mate paired.
-     * The program will behave correctly by default in those cases.
-     */
-    @Argument(fullName = "dont_hardclip_adaptor_sequences", shortName = "noclip_ad", doc = "Do not hard clip adaptor sequences", required = false)
-    public boolean DONT_CLIP_ADAPTOR_SEQUENCES = false;
-
-    /**
-     * This option overrides the argument of minimum tail
-     * quality.
-     */
-    @Argument(fullName = "dont_hardclip_low_qual_tails", shortName = "noclip_tail", doc = "Do not hard clip the low quality tails of the reads", required = false)
-    public boolean DONT_CLIP_LOW_QUAL_TAILS = false;
-
-    /**
-     * By default, ReduceReads will hard clip away any low quality soft clipped
-     * base left by the aligner and use the high quality soft clipped bases in it's traversal algorithm to identify variant
-     * regions. The minimum quality for soft clipped bases is the same as the minimum base quality to consider (minqual)
-     */
-    @Argument(fullName = "dont_use_softclipped_bases", shortName = "no_soft", doc = "Do not use high quality soft-clipped bases", required = false)
-    public boolean DONT_USE_SOFTCLIPPED_BASES = false;
-
-    /**
-     * By default, ReduceReads will compress read names to numbers and guarantee
-     * uniqueness and reads with similar name will still have similar compressed names. Note: If you scatter/gather
-     * there is no guarantee that read name uniqueness will be maintained -- in this case we recommend not compressing. 
-     */
-    @Argument(fullName = "dont_compress_read_names", shortName = "nocmp_names", doc = "Do not compress read names", required = false)
-    public boolean DONT_COMPRESS_READ_NAMES = false;
-
-    /**
-     * The hard clips will happen exactly at the interval border.
-     */
-    @Argument(fullName = "hard_clip_to_interval", shortName = "clip_int", doc = "Hard clip all incoming reads to the desired intervals", required = false)
-    public boolean HARD_CLIP_TO_INTERVAL = false;
-
-    /**
-     * Anything below this will be
-     * considered consensus and reduced (otherwise we will try to trigger polyploid compression).  Note that
-     * this value is used only regions with high coverage.
-     */
-    @Advanced
-    @Argument(fullName = "minimum_alt_proportion_to_trigger_variant", shortName = "minvar", doc = "Minimum proportion of mismatches in a site to trigger a variant region", required = false)
-    public double minAltProportionToTriggerVariant = 0.05;
-
-    /**
-     * Any site with a value falling below this will be considered consensus and reduced (otherwise we will try to
-     * trigger polyploid compression).  Note that this value is used only regions with low coverage.
-     */
-    @Advanced
-    @Argument(fullName = "minimum_alt_pvalue_to_trigger_variant", shortName = "min_pvalue", doc = "Minimum p-value from binomial distribution of mismatches in a site to trigger a variant region", required = false)
-    public double minAltPValueToTriggerVariant = 0.01;
-
-    /**
-     * Anything below this will be considered consensus.
-     */
-    @Argument(fullName = "minimum_del_proportion_to_trigger_variant", shortName = "mindel", doc = "Minimum proportion of indels in a site to trigger a variant region", required = false)
-    public double minIndelProportionToTriggerVariant = 0.05;
-
-    /**
-     * This level of downsampling only happens after the region has been evaluated, therefore it can
-     * be combined with the engine level downsampling.
-     * A value of 0 turns downsampling off.
-     */
-    @Argument(fullName = "downsample_coverage", shortName = "ds", doc = "Downsample the number of reads emitted per sample in a variant region for better compression", required = false)
-    public int downsampleCoverage = 250;
-
-    /**
-     * Generally, this tool is not meant to be run for more than 1 sample at a time.  The one valid exception
-     * brought to our attention by colleagues is the specific case of tumor/normal pairs in cancer analysis.
-     * To prevent users from unintentionally running the tool in a less than ideal manner, we require them
-     * to explicitly enable multi-sample analysis with this argument.
-     */
-    @Argument(fullName = "cancer_mode", shortName = "cancer_mode", doc = "Enable multi-sample reduction for cancer analysis", required = false)
-    public boolean ALLOW_MULTIPLE_SAMPLES = false;
-
-    @Hidden
-    @Argument(fullName = "nwayout", shortName = "nw", doc = "Generate separate output files per input file", required = false)
-    public boolean nwayout = false;
-
-    @Hidden
-    @Argument(fullName = "", shortName = "dl", doc = "Debug level", required = false)
-    public int debugLevel = 0;
-
-    @Hidden
-    @Argument(fullName = "", shortName = "dr", doc = "Debug read", required = false)
-    public String debugRead = "";
-
-    @Hidden
-    @Argument(fullName = "downsample_strategy", shortName = "dm", doc = "Downsampling strategy", required = false)
-    public DownsampleStrategy downsampleStrategy = DownsampleStrategy.Normal;
-    
-    @Hidden 
-    @Argument(fullName = "no_pg_tag", shortName = "npt", doc ="Discard program tags", required = false)
-    public boolean NO_PG_TAG = false;
-
-    public enum DownsampleStrategy {
-        Normal,
-        Adaptive
-    }
-    
-    int nCompressedReads = 0;
-
-    private static int READ_NAME_HASH_DEFAULT_SIZE = 1000;
-    Long nextReadNumber = 1L;                                               // The next number to use for the compressed read name.
-    Object2LongOpenHashMap<String> readNameHash;                         // This hash will keep the name of the original read the new compressed name (a number).
-
-    ObjectSortedSet<GenomeLoc> intervalList;
-
-    ObjectSortedSet<GenomeLoc> knownSnpPositions;
-
-    // IMPORTANT: DO NOT CHANGE THE VALUE OF THIS CONSTANT VARIABLE; IT IS NOW PERMANENTLY THE @PG NAME THAT EXTERNAL TOOLS LOOK FOR IN THE BAM HEADER
-    public static final String PROGRAM_RECORD_NAME = "GATK ReduceReads";   // The name that will go in the @PG tag
-    private static final String PROGRAM_FILENAME_EXTENSION = ".reduced.bam";
-
-    /**
-     * Basic generic initialization of the readNameHash and the intervalList. Output initialization
-     * is done at the reduceInit method
-     */
-    @Override
-    public void initialize() {
-        super.initialize();
-
-        if ( !nwayout && out == null )
-            throw new UserException.MissingArgument("out", "the output must be provided and is optional only for certain debugging modes");
-
-        if ( nwayout && out != null )
-            throw new UserException.CommandLineException("--out and --nwayout cannot be used simultaneously; please use one or the other");
-
-        if ( minAltPValueToTriggerVariant < 0.0 || minAltPValueToTriggerVariant > 1.0 )
-            throw new UserException.BadArgumentValue("--minimum_alt_pvalue_to_trigger_variant", "must be a value between 0 and 1 (inclusive)");
-
-        if ( minAltProportionToTriggerVariant < 0.0 || minAltProportionToTriggerVariant > 1.0 )
-            throw new UserException.BadArgumentValue("--minimum_alt_proportion_to_trigger_variant", "must be a value between 0 and 1 (inclusive)");
-
-        if ( SampleUtils.getSAMFileSamples(getToolkit().getSAMFileHeader()).size() > 1 && !ALLOW_MULTIPLE_SAMPLES )
-            throw new UserException.BadInput("Reduce Reads is not meant to be run for more than 1 sample at a time except for the specific case of tumor/normal pairs in cancer analysis. If that is what you want to do, use the -cancer_mode flag.");
-
-        if ( known.isEmpty() )
-            knownSnpPositions = null;
-        else
-            knownSnpPositions = new ObjectAVLTreeSet<GenomeLoc>();
-
-        GenomeAnalysisEngine toolkit = getToolkit();
-        this.resetReadNameHash();     // prepare the read name hash to keep track of what reads have had their read names compressed
-        intervalList = new ObjectAVLTreeSet<GenomeLoc>();                          // get the interval list from the engine. If no interval list was provided, the walker will work in WGS mode
-
-        if (toolkit.getIntervals() != null)
-            intervalList.addAll(toolkit.getIntervals());
-
-        final boolean indexOnTheFly = true;
-        final SAMFileHeader.SortOrder sortOrder = SAMFileHeader.SortOrder.coordinate;
-        if (nwayout) {
-            SAMProgramRecord programRecord = NO_PG_TAG ? null : Utils.createProgramRecord(toolkit, this, PROGRAM_RECORD_NAME);
-            writerToUse = new BySampleSAMFileWriter(toolkit, PROGRAM_FILENAME_EXTENSION, sortOrder, false, indexOnTheFly, NO_PG_TAG, programRecord, true);
-        }
-        else {
-            writerToUse = out;
-            out.setPresorted(false);
-            if (!NO_PG_TAG) {
-                Utils.setupWriter(out, toolkit, toolkit.getSAMFileHeader(), false, this, PROGRAM_RECORD_NAME);
-            }
-        }
-    }
-
-    /** Initializer for {@link #readNameHash}. */
-    private void resetReadNameHash() {
-        // If the hash grows large, subsequent clear operations can be very expensive, so trim the hash down if it grows beyond its default.
-        if (readNameHash == null || readNameHash.size() > READ_NAME_HASH_DEFAULT_SIZE) {
-            readNameHash = new Object2LongOpenHashMap<String>(READ_NAME_HASH_DEFAULT_SIZE);
-        } else {
-            readNameHash.clear();
-        }
-    }
-    
-    /**
-     * Takes in a read and prepares it for the SlidingWindow machinery by performing the
-     * following optional clipping operations:
-     * 1. Hard clip adaptor sequences
-     * 2. Hard clip low quality tails
-     * 3. Hard clip all remaining soft clipped bases
-     * 4. Hard clip read to the intervals in the interval list (this step may produce multiple reads)
-     *
-     * @param ref             default map parameter
-     * @param read            default map parameter
-     * @param metaDataTracker default map parameter
-     * @return a linked list with all the reads produced by the clipping operations
-     */
-    @Override
-    public ObjectArrayList<GATKSAMRecord> map(ReferenceContext ref, GATKSAMRecord read, RefMetaDataTracker metaDataTracker) {
-        ObjectArrayList<GATKSAMRecord> mappedReads;
-        if (!debugRead.isEmpty() && read.getReadName().contains(debugRead))
-                System.out.println("Found debug read!");
-
-        if (debugLevel == 1)
-            System.out.printf("\nOriginal: %s %s %d %d\n", read, read.getCigar(), read.getAlignmentStart(), read.getAlignmentEnd());
-
-        // we write the actual alignment starts to their respective alignment shift tags in the temporary
-        // attribute hash so we can determine later if we need to write down the alignment shift to the reduced BAM file
-        read.setTemporaryAttribute(GATKSAMRecord.REDUCED_READ_ORIGINAL_ALIGNMENT_START_SHIFT, read.getAlignmentStart());
-        read.setTemporaryAttribute(GATKSAMRecord.REDUCED_READ_ORIGINAL_ALIGNMENT_END_SHIFT, read.getAlignmentEnd());
-
-        // Check if the read goes beyond the boundaries of the chromosome, and hard clip those boundaries.
-        int chromosomeLength = ref.getGenomeLocParser().getContigInfo(read.getReferenceName()).getSequenceLength();
-        if (read.getSoftStart() < 0)
-            read = ReadClipper.hardClipByReadCoordinates(read, 0, -read.getSoftStart());
-        if (read.getSoftEnd() > chromosomeLength)
-            read = ReadClipper.hardClipByReadCoordinates(read, chromosomeLength - read.getSoftStart() + 1, read.getReadLength() - 1);
-
-        if (!DONT_SIMPLIFY_READS)
-            read.simplify();                                                                                            // Clear all unnecessary attributes
-        if (!DONT_CLIP_ADAPTOR_SEQUENCES)
-            read = ReadClipper.hardClipAdaptorSequence(read);                                                           // Strip away adaptor sequences, if any.
-        if (!DONT_CLIP_LOW_QUAL_TAILS)
-            read = ReadClipper.hardClipLowQualEnds(read, minTailQuality);                                               // Clip low quality tails
-        if (!isWholeGenome()) {
-            if (HARD_CLIP_TO_INTERVAL)
-                mappedReads = hardClipReadToInterval(read);                                                             // Hard clip the remainder of the read to the desired interval
-            else {
-                mappedReads = new ObjectArrayList<GATKSAMRecord>();
-                mappedReads.add(read);
-            }
-        }
-        else {
-            mappedReads = new ObjectArrayList<GATKSAMRecord>();
-            if (!read.isEmpty())
-                mappedReads.add(read);
-        }
-
-        if (!mappedReads.isEmpty() && !DONT_USE_SOFTCLIPPED_BASES) {
-            ObjectArrayList<GATKSAMRecord> tempList = new ObjectArrayList<GATKSAMRecord>();
-            for (GATKSAMRecord mRead : mappedReads) {
-                GATKSAMRecord clippedRead = ReadClipper.hardClipLowQualitySoftClips(mRead, minBaseQual);
-                if (!clippedRead.isEmpty())
-                    tempList.add(clippedRead);
-            }
-            mappedReads = tempList;
-        }
-
-        if (debugLevel == 1)
-            for (GATKSAMRecord mappedRead : mappedReads)
-                System.out.printf("MAPPED: %s %d %d\n", mappedRead.getCigar(), mappedRead.getAlignmentStart(), mappedRead.getAlignmentEnd());
-
-        // add the SNPs to the list of known positions
-        populateKnownSNPs(metaDataTracker);
-
-        return mappedReads;
-    }
-
-    /*
-     * Add the positions of known SNPs to the set so that we can keep track of it
-     *
-     * @param metaDataTracker   the ref meta data tracker
-     */
-    protected void populateKnownSNPs(final RefMetaDataTracker metaDataTracker) {
-        for ( final VariantContext vc : metaDataTracker.getValues(known) ) {
-            if ( vc.isSNP() )
-                knownSnpPositions.add(getToolkit().getGenomeLocParser().createGenomeLoc(vc));
-        }
-    }
-
-    /**
-     * Initializes the ReduceReadsStash that keeps track of all reads that are waiting to
-     * enter the SlidingWindow machinery. The stash makes sure reads are served in order
-     * even though map() may generate reads that are only supposed to enter the machinery
-     * in the future.
-     *
-     * @return the empty stash
-     */
-    @Override
-    public ReduceReadsStash reduceInit() {
-        return new ReduceReadsStash(new MultiSampleCompressor(getToolkit().getSAMFileHeader(), contextSize, downsampleCoverage, minMappingQuality, minAltPValueToTriggerVariant, minAltProportionToTriggerVariant, minIndelProportionToTriggerVariant, minBaseQual, downsampleStrategy));
-    }
-
-    /**
-     * Takes the list of reads produced by map(), adds them to the stash (which keeps them sorted) and process
-     * all reads that come before the original read (the read that was passed to map) including the original
-     * read. This is where we send reads, in order, to the SlidingWindow machinery.
-     *
-     * @param mappedReads the list of reads sent by map
-     * @param stash       the stash that keeps the reads in order for processing
-     * @return the stash with all reads that have not been processed yet
-     */
-    public ReduceReadsStash reduce(ObjectArrayList<GATKSAMRecord> mappedReads, ReduceReadsStash stash) {
-        if (debugLevel == 1)
-            stash.print();
-
-        boolean firstRead = true;
-        for (GATKSAMRecord read : mappedReads) {
-            boolean originalRead = firstRead && isOriginalRead(mappedReads, read);
-
-            if (read.getReadLength() == 0)
-                throw new ReviewedStingException("Empty read sent to reduce, this should never happen! " + read.getReadName() + " -- " + read.getCigar() + " -- " + read.getReferenceName() + ":" + read.getAlignmentStart() + "-" + read.getAlignmentEnd());
-
-            if (originalRead) {
-                ObjectArrayList<GATKSAMRecord> readsReady = new ObjectArrayList<GATKSAMRecord>();
-                readsReady.addAll(stash.getAllReadsBefore(read));
-                readsReady.add(read);
-
-                for (GATKSAMRecord readReady : readsReady) {
-                    if (debugLevel == 1)
-                        System.out.println("REDUCE: " + readReady.getCigar() + " " + readReady.getAlignmentStart() + " " + readReady.getAlignmentEnd());
-
-                    for (GATKSAMRecord compressedRead : stash.compress(readReady, knownSnpPositions))
-                        outputRead(compressedRead);
-
-                    // We only care about maintaining the link between read pairs if they are in the same variant
-                    // region.  Since an entire variant region's worth of reads is returned in a single call to
-                    // stash.compress(), the readNameHash can be cleared after the for() loop above.
-                    // The advantage of clearing the hash is that otherwise it holds all reads that have been encountered,
-                    // which can use a lot of memory and cause RR to slow to a crawl and/or run out of memory.
-                    this.resetReadNameHash();
-
-                }
-            } else
-                stash.add(read);
-
-            firstRead = false;
-        }
-
-        // reduce memory requirements by removing old positions
-        if ( !mappedReads.isEmpty() )
-            clearStaleKnownPositions(mappedReads.get(0));
-
-        return stash;
-    }
-
-    /**
-     * Now that now more reads will come, we process all the remaining reads in the stash, in order.
-     *
-     * @param stash the ReduceReadsStash with all unprocessed reads (from reduce)
-     */
-    @Override
-    public void onTraversalDone(ReduceReadsStash stash) {
-
-        // output any remaining reads in the compressor
-        for (GATKSAMRecord read : stash.close(knownSnpPositions))
-            outputRead(read);
-
-        if (nwayout)
-            writerToUse.close();
-    }
-
-    /**
-     * Removes known positions that are no longer relevant for use with het compression.
-     *
-     * @param read    the current read, used for checking whether there are stale positions we can remove
-     */
-    protected void clearStaleKnownPositions(final GATKSAMRecord read) {
-        // nothing to clear if not used or empty
-        if ( knownSnpPositions == null || knownSnpPositions.isEmpty() )
-            return;
-
-        // not ready to be cleared until we encounter a read from a different contig
-        final int contigIndexOfRead = read.getReferenceIndex();
-        if ( knownSnpPositions.first().getContigIndex() == contigIndexOfRead )
-            return;
-
-        // because we expect most elements to be stale, it's not going to be efficient to remove them one at a time
-        final ObjectAVLTreeSet<GenomeLoc> goodLocs = new ObjectAVLTreeSet<GenomeLoc>();
-        for ( final GenomeLoc loc : knownSnpPositions ) {
-            if ( loc.getContigIndex() == contigIndexOfRead )
-                goodLocs.add(loc);
-        }
-        knownSnpPositions.clear();
-        knownSnpPositions.addAll(goodLocs);
-    }
-
-    /**
-     * Hard clips away all parts of the read that doesn't agree with the intervals selected.
-     *
-     * Note: If read overlaps more than one interval, it will be hard clipped to all
-     * the intervals it overlaps with
-     *
-     * @param read the read to be hard clipped to the interval.
-     * @return a shallow copy of the read hard clipped to the interval
-     */
-    private ObjectArrayList<GATKSAMRecord> hardClipReadToInterval(GATKSAMRecord read) {
-        ObjectArrayList<GATKSAMRecord> clippedReads = new ObjectArrayList<GATKSAMRecord>();
-
-        GenomeLoc intervalOverlapped = null;       // marks the interval to which the original read overlapped (so we can cut all previous intervals from the list)
-
-        boolean originalRead = true;               // false if this is the right tail of the original read
-        boolean overlap;                           // keeps track of the interval that overlapped the original read
-        boolean doneClipping;                      // triggers an early exit if we are done clipping this read
-
-        if (isWholeGenome())
-            clippedReads.add(read);                // if we don't have intervals (wgs) the read goes in unchanged
-
-        for (GenomeLoc interval : intervalList) {
-
-            if (read.isEmpty())                    // nothing to do with an empty read (could have been fully clipped before)
-                break;
-
-            GATKSAMRecord clippedRead = null;      // this will hold the read clipped to the interval to be added in the end of the switch
-
-            switch (ReadUtils.getReadAndIntervalOverlapType(read, interval)) {
-                case NO_OVERLAP_RIGHT:             // no reads on this interval, check the next interval if this is the original read
-                    if (!originalRead)             // something went wrong if this is the tail of the read
-                        throw new ReviewedStingException("tail of the read should never NO_OVERLAP_RIGHT the following interval. " + read.getReadName() + " -- " + read.getReferenceName() + ":" + read.getAlignmentStart() + "-" + read.getAlignmentEnd() + " x " + interval.getLocation().toString());
-                    overlap = false;
-                    doneClipping = false;
-                    break;
-
-
-                case NO_OVERLAP_HARDCLIPPED_RIGHT: // read used to overlap but got hard clipped and doesn't overlap anymore
-                    if (originalRead) {
-                        overlap = true;            // effectively, we have found the read's location and now we are going to try and match it's tail (which happens to be the entire read).
-                        clippedRead = GATKSAMRecord.emptyRead(read);
-                    } else
-                        overlap = false;
-
-                    doneClipping = false;
-                    break;
-
-                case NO_OVERLAP_CONTIG:            // read is in a different contig
-                    if (originalRead) {                                                                                 // the original read can be in a bigger contig, but not on a smaller one.
-                        if (read.getReferenceIndex() < interval.getContigIndex())
-                            throw new ReviewedStingException("read is behind interval list. (contig) " + read.getReadName() + " -- " + read.getReferenceName() + ":" + read.getAlignmentStart() + "-" + read.getAlignmentEnd() + " x " + interval.getLocation().toString());
-                        else {
-                            overlap = false;
-                            doneClipping = false;
-                        }
-                    }                                                                                                   // tail read CANNOT be in a different contig.
-                    else {
-                        if (read.getReferenceIndex() < interval.getContigIndex()) {
-                            overlap = false;
-                            doneClipping = true;
-                        } else
-                            throw new ReviewedStingException("Tail read is in bigger contig than interval traversal. " + read.getReadName() + " -- " + read.getReferenceName() + ":" + read.getAlignmentStart() + "-" + read.getAlignmentEnd() + " x " + interval.getLocation().toString());
-
-                    }
-                    break;
-
-                case NO_OVERLAP_LEFT:
-                    if (originalRead)                                                                                   // if this is the first read this should never happen.
-                        throw new ReviewedStingException("original read cannot be behind the first interval. (position) " + read.getReadName() + " -- " + read.getReferenceName() + ":" + read.getAlignmentStart() + "-" + read.getAlignmentEnd() + " x " + interval.getLocation().toString());
-
-                    overlap = false;
-                    doneClipping = true;
-                    break;
-
-                case NO_OVERLAP_HARDCLIPPED_LEFT:                                                                       // read used to overlap but got hard clipped and doesn't overlap anymore
-                    overlap = originalRead;                                                                             // if this is the original read, we should not advance the interval list, the original overlap was here.
-                    doneClipping = true;
-                    break;
-
-                case OVERLAP_LEFT:                                                                                      // clip the left tail of the read
-                    clippedRead = ReadClipper.hardClipByReferenceCoordinatesLeftTail(read, interval.getStart() - 1);
-
-                    overlap = true;
-                    doneClipping = true;
-                    break;
-
-                case OVERLAP_RIGHT:                                                                                     // clip the right tail of the read and try to match it to the next interval
-                    clippedRead = ReadClipper.hardClipByReferenceCoordinatesRightTail(read, interval.getStop() + 1);
-                    read = ReadClipper.hardClipByReferenceCoordinatesLeftTail(read, interval.getStop());
-
-                    overlap = true;
-                    doneClipping = false;
-                    break;
-
-                case OVERLAP_LEFT_AND_RIGHT:                                                                            // clip both left and right ends of the read
-                    clippedRead = ReadClipper.hardClipBothEndsByReferenceCoordinates(read, interval.getStart() - 1, interval.getStop() + 1);
-                    read = ReadClipper.hardClipByReferenceCoordinatesLeftTail(read, interval.getStop());
-
-                    overlap = true;
-                    doneClipping = false;
-                    break;
-
-                case OVERLAP_CONTAINED:                                                                                 // don't do anything to the read
-                    clippedRead = read;
-
-                    overlap = true;
-                    doneClipping = true;
-                    break;
-
-                default:
-                    throw new ReviewedStingException("interval overlap returned an unknown / unhandled state. If new state was added to intervalOverlap, it should be handled by hardClipReadToInterval.");
-            }
-
-            if (overlap && originalRead)
-                intervalOverlapped = interval;
-
-            if (clippedRead != null) {
-                originalRead = false;
-
-                if (!clippedRead.isEmpty())
-                    clippedReads.add(clippedRead); // if the read overlaps the interval entirely within a deletion, it will be entirely clipped off
-            }
-
-            if (doneClipping)
-                break;
-        }
-
-        if (intervalOverlapped != null)
-            intervalList = intervalList.tailSet(intervalOverlapped);
-
-        return clippedReads;
-    }
-
-    /**
-     * Compresses the read name and adds it to output BAM file (reduced BAM)
-     * after performing some quality control
-     *
-     * @param read any read
-     */
-    private void outputRead(GATKSAMRecord read) {
-        if (debugLevel == 2) {
-            checkForHighMismatch(read);
-            checkCigar(read);
-        }
-
-        if (read.isReducedRead())
-            nCompressedReads++;
-        else {
-            int originalAlignmentStart =  (Integer) read.getTemporaryAttribute(GATKSAMRecord.REDUCED_READ_ORIGINAL_ALIGNMENT_START_SHIFT);
-            int originalAlignmentEnd   =  (Integer) read.getTemporaryAttribute(GATKSAMRecord.REDUCED_READ_ORIGINAL_ALIGNMENT_END_SHIFT);
-
-            int startShift = originalAlignmentStart - read.getUnclippedStart();                                         // we annotate the shifts for better compression
-            int endShift = read.getUnclippedEnd() - originalAlignmentEnd;                                               // we annotate the shifts for better compression
-
-            if (startShift > 0)
-                read.setAttribute(GATKSAMRecord.REDUCED_READ_ORIGINAL_ALIGNMENT_START_SHIFT, startShift);               // If the read had any soft clips before getting chopped (variant region) annotate it's original alignment (start)
-            if (endShift > 0)
-                read.setAttribute(GATKSAMRecord.REDUCED_READ_ORIGINAL_ALIGNMENT_END_SHIFT, endShift);                   // If the read had any soft clips before getting chopped (variant region) annotate it's original alignment (end)
-        }
-
-        if (debugLevel == 1)
-            System.out.println("BAM: " + read.getCigar() + " " + read.getAlignmentStart() + " " + read.getAlignmentEnd());
-
-        if (!DONT_COMPRESS_READ_NAMES)
-            nextReadNumber = compressReadName(readNameHash, read, nextReadNumber);
-
-        writerToUse.addAlignment(read);
-    }
-
-    /**
-     * Quality control procedure that checks if the consensus reads contains too many
-     * mismatches with the reference. This should never happen and is a good trigger for
-     * errors with the algorithm.
-     *
-     * @param read any read
-     */
-    private void checkForHighMismatch(GATKSAMRecord read) {
-        final int start = read.getAlignmentStart();
-        final int stop = read.getAlignmentEnd();
-        final byte[] ref = getToolkit().getReferenceDataSource().getReference().getSubsequenceAt(read.getReferenceName(), start, stop).getBases();
-        final int nm = SequenceUtil.countMismatches(read, ref, start - 1);
-        final int readLen = read.getReadLength();
-        final double nmFraction = nm / (1.0 * readLen);
-        if (nmFraction > 0.4 && readLen > 20 && read.getAttribute(GATKSAMRecord.REDUCED_READ_CONSENSUS_TAG) != null && read.getReadName().startsWith("Consensus"))
-            throw new ReviewedStingException("BUG: High mismatch fraction found in read " + read.getReadName() + " position: " + read.getReferenceName() + ":" + read.getAlignmentStart() + "-" + read.getAlignmentEnd());
-    }
-
-    private void checkCigar (GATKSAMRecord read) {
-        if (read.getCigar().isValid(null, -1) != null) {
-            throw new ReviewedStingException("BUG: cigar string is not valid: " + read.getCigarString());
-        }
-
-    }
-
-
-    /**
-     * Compresses the read name using the readNameHash if we have already compressed
-     * this read name before.
-     *
-     * @param hash           the hash table containing the read name to compressed read name map
-     * @param read           any read
-     * @param nextReadNumber the number to use in the compressed read name in case this is a new read name
-     * @return the next number to use in the compressed read name
-     */
-    protected static long compressReadName(final Object2LongOpenHashMap<String> hash, final GATKSAMRecord read, final long nextReadNumber) {
-        final String name = read.getReadName();
-        final StringBuilder compressedName = new StringBuilder();
-        long result = nextReadNumber;
-        if (read.isReducedRead()) {
-            compressedName.append("C");
-        }
-        final Long readNumber = hash.get(name);
-        if (readNumber != null) {
-            compressedName.append(readNumber);
-        } else {
-            hash.put(name, nextReadNumber);
-            compressedName.append(nextReadNumber);
-            result++;
-        }
-        read.setReadName(compressedName.toString());
-        return result;
-    }
-
-    /**
-     * Returns true if the read is the original read that went through map().
-     *
-     * This is important to know so we can decide what reads to pull from the stash. Only reads that came before the original read should be pulled.
-     *
-     * @param list the list
-     * @param read the read
-     * @return Returns true if the read is the original read that went through map().
-     */
-    private boolean isOriginalRead(ObjectArrayList<GATKSAMRecord> list, GATKSAMRecord read) {
-        return isWholeGenome() || list.get(0).equals(read);
-    }
-
-    /**
-     * Checks whether or not the intervalList is empty, meaning we're running in WGS mode.
-     *
-     * @return whether or not we're running in WGS mode.
-     */
-    private boolean isWholeGenome() {
-        return intervalList.isEmpty();
-    }
-
-}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/ReduceReadsStash.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/ReduceReadsStash.java
deleted file mode 100644
index 52c5f0903..000000000
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/ReduceReadsStash.java
+++ /dev/null
@@ -1,160 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.compression.reducereads;
-
-import it.unimi.dsi.fastutil.objects.ObjectSortedSet;
-import org.broadinstitute.sting.utils.GenomeLoc;
-import org.broadinstitute.sting.utils.sam.AlignmentStartWithNoTiesComparator;
-import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
-import org.broadinstitute.sting.utils.sam.ReadUtils;
-
-import java.util.LinkedList;
-import java.util.List;
-import java.util.SortedSet;
-import java.util.TreeSet;
-
-/**
- * This class implements a "read stash" that keeps reads always sorted in alignment order. Useful
- * for read walkers that alter the alignment information of the incoming reads, but need to
- * maintain the reads sorted for the reduce step. (e.g. ReduceReads)
- */
-
-public class ReduceReadsStash {
-    protected MultiSampleCompressor compressor;
-    SortedSet<GATKSAMRecord> outOfOrderReads;
-
-    /**
-     * Creates a stash with the default sorting order (read alignment)
-     * @param compressor the MultiSampleCompressor object to be used with this stash (for stash.close())
-     */
-    public ReduceReadsStash(MultiSampleCompressor compressor) {
-        this.compressor = compressor;
-        this.outOfOrderReads = new TreeSet<GATKSAMRecord>(new AlignmentStartWithNoTiesComparator());
-    }
-
-    /**
-     * Get all reads before a given read (for processing)
-     *
-     * @param read the original read
-     * @return all reads that have alignment start before the original read.
-     */
-    public List<GATKSAMRecord> getAllReadsBefore(GATKSAMRecord read) {
-        List<GATKSAMRecord> result = new LinkedList<GATKSAMRecord>();
-        GATKSAMRecord newHead = null;
-
-        for (GATKSAMRecord stashedRead : outOfOrderReads) {
-            if (ReadUtils.compareSAMRecords(stashedRead, read) <= 0)
-                result.add(stashedRead);
-            else {
-                newHead = stashedRead;
-                break;
-            }
-        }
-
-        if (result.size()  > 0) {
-            if (result.size() == outOfOrderReads.size())
-                outOfOrderReads.clear();
-            else
-                outOfOrderReads = new TreeSet<GATKSAMRecord>(outOfOrderReads.tailSet(newHead));
-        }
-
-        return result;
-    }
-
-    /**
-     * sends the read to the MultiSampleCompressor
-     *
-     * @param read                  the read to be compressed
-     * @param knownSnpPositions     the set of known SNP positions
-     * @return any compressed reads that may have resulted from adding this read to the machinery (due to the sliding window)
-     */
-    public Iterable<GATKSAMRecord> compress(final GATKSAMRecord read, final ObjectSortedSet<GenomeLoc> knownSnpPositions) {
-        return compressor.addAlignment(read, knownSnpPositions);
-    }
-
-    /**
-     * Add a read to the stash
-     *
-     * @param read any read
-     */
-    public void add(GATKSAMRecord read) {
-        outOfOrderReads.add(read);
-    }
-
-    /**
-     * Close the stash, processing all remaining reads in order
-     *
-     * @param knownSnpPositions  the set of known SNP positions
-     * @return a list of all the reads produced by the SlidingWindow machinery)
-     */
-    public Iterable<GATKSAMRecord> close(final ObjectSortedSet<GenomeLoc> knownSnpPositions) {
-        LinkedList<GATKSAMRecord> result = new LinkedList<GATKSAMRecord>();
-
-        // compress all the stashed reads (in order)
-        for (GATKSAMRecord read : outOfOrderReads)
-            for (GATKSAMRecord compressedRead : compressor.addAlignment(read, knownSnpPositions))
-                result.add(compressedRead);
-
-        // output any remaining reads from the compressor
-        for (GATKSAMRecord read : compressor.close(knownSnpPositions))
-            result.add(read);
-
-        return result;
-    }
-
-    /**
-     * Useful debug functionality, outputs all elements in the stash
-     */
-    public void print() {
-        int i = 1;
-        System.out.println("Stash Contents:");
-        for (GATKSAMRecord read : outOfOrderReads) 
-            System.out.println(String.format("%3d: %s %d %d", i++, read.getCigarString(), read.getAlignmentStart(), read.getAlignmentEnd()));
-        System.out.println();
-    }
-
-}
\ No newline at end of file
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/SingleSampleCompressor.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/SingleSampleCompressor.java
deleted file mode 100644
index 61c34b6a0..000000000
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/SingleSampleCompressor.java
+++ /dev/null
@@ -1,153 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.compression.reducereads;
-
-import com.google.java.contract.Ensures;
-import it.unimi.dsi.fastutil.objects.*;
-import org.broadinstitute.sting.utils.GenomeLoc;
-import org.broadinstitute.sting.utils.collections.Pair;
-import org.broadinstitute.sting.utils.sam.AlignmentStartWithNoTiesComparator;
-import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
-
-/**
- *
- * @author carneiro, depristo
- * @version 3.0
- */
-public class SingleSampleCompressor {
-    final private int contextSize;
-    final private int downsampleCoverage;
-    final private int minMappingQuality;
-    final private double minAltPValueToTriggerVariant;
-    final private double minAltProportionToTriggerVariant;
-    final private double minIndelProportionToTriggerVariant;
-    final private int minBaseQual;
-    final private ReduceReads.DownsampleStrategy downsampleStrategy;
-
-    private SlidingWindow slidingWindow;
-    private int slidingWindowCounter;
-
-    public static Pair<ObjectSet<GATKSAMRecord>, CompressionStash> emptyPair = new Pair<ObjectSet<GATKSAMRecord>,CompressionStash>(new ObjectAVLTreeSet<GATKSAMRecord>(), new CompressionStash());
-
-    public SingleSampleCompressor(final int contextSize,
-                                  final int downsampleCoverage,
-                                  final int minMappingQuality,
-                                  final double minAltPValueToTriggerVariant,
-                                  final double minAltProportionToTriggerVariant,
-                                  final double minIndelProportionToTriggerVariant,
-                                  final int minBaseQual,
-                                  final ReduceReads.DownsampleStrategy downsampleStrategy) {
-        this.contextSize = contextSize;
-        this.downsampleCoverage = downsampleCoverage;
-        this.minMappingQuality = minMappingQuality;
-        this.slidingWindowCounter = 0;
-        this.minAltPValueToTriggerVariant = minAltPValueToTriggerVariant;
-        this.minAltProportionToTriggerVariant = minAltProportionToTriggerVariant;
-        this.minIndelProportionToTriggerVariant = minIndelProportionToTriggerVariant;
-        this.minBaseQual = minBaseQual;
-        this.downsampleStrategy = downsampleStrategy;
-    }
-
-    /**
-     * Add an alignment to the compressor
-     *
-     * @param read                  the read to be added
-     * @param knownSnpPositions     the set of known SNP positions
-     * @return any compressed reads that may have resulted from adding this read to the machinery (due to the sliding window)
-     */
-    public Pair<ObjectSet<GATKSAMRecord>, CompressionStash> addAlignment( final GATKSAMRecord read, final ObjectSortedSet<GenomeLoc> knownSnpPositions ) {
-        ObjectSet<GATKSAMRecord> reads = new ObjectAVLTreeSet<GATKSAMRecord>(new AlignmentStartWithNoTiesComparator());
-        CompressionStash stash = new CompressionStash();
-        int readOriginalStart = read.getUnclippedStart();
-
-        // create a new window if:
-        if ((slidingWindow != null) &&
-            ( ( read.getReferenceIndex() != slidingWindow.getContigIndex() ) ||        // this is a brand new contig
-              (readOriginalStart - contextSize > slidingWindow.getStopLocation()))) {  // this read is too far away from the end of the current sliding window
-
-            // close the current sliding window
-            Pair<ObjectSet<GATKSAMRecord>, CompressionStash> readsAndStash = slidingWindow.close(knownSnpPositions);
-            reads = readsAndStash.getFirst();
-            stash = readsAndStash.getSecond();
-            slidingWindow = null;                                                      // so we create a new one on the next if
-        }
-
-        if ( slidingWindow == null) {                                                  // this is the first read
-            slidingWindow = new SlidingWindow(read.getReferenceName(), read.getReferenceIndex(), contextSize, read.getHeader(), read.getReadGroup(),
-                    slidingWindowCounter, minAltPValueToTriggerVariant, minAltProportionToTriggerVariant, minIndelProportionToTriggerVariant,
-                    minBaseQual, minMappingQuality, downsampleCoverage, downsampleStrategy, read.hasBaseIndelQualities());
-            slidingWindowCounter++;
-        }
-
-        stash.addAll(slidingWindow.addRead(read));
-        return new Pair<ObjectSet<GATKSAMRecord>, CompressionStash>(reads, stash);
-    }
-
-    /**
-     * Properly closes the compressor.
-     *
-     * @param knownSnpPositions  the set of known SNP positions
-     * @return A non-null set/list of all reads generated
-     */
-    @Ensures("result != null")
-    public Pair<ObjectSet<GATKSAMRecord>, CompressionStash> close(final ObjectSortedSet<GenomeLoc> knownSnpPositions) {
-        return (slidingWindow != null) ? slidingWindow.close(knownSnpPositions) : emptyPair;
-    }
-
-    /**
-     * Finalizes current variant regions.
-     *
-     * @param knownSnpPositions  the set of known SNP positions
-     * @return A non-null set/list of all reads generated
-     */
-    @Ensures("result != null")
-    public ObjectSet<GATKSAMRecord> closeVariantRegions(final CompressionStash regions, final ObjectSortedSet<GenomeLoc> knownSnpPositions) {
-        return slidingWindow == null ? ObjectSets.EMPTY_SET : slidingWindow.closeVariantRegions(regions, knownSnpPositions);
-    }
-
-}
-
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/SlidingWindow.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/SlidingWindow.java
deleted file mode 100644
index d5aa8f944..000000000
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/SlidingWindow.java
+++ /dev/null
@@ -1,1110 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.compression.reducereads;
-
-import com.google.java.contract.Ensures;
-import com.google.java.contract.Requires;
-import it.unimi.dsi.fastutil.bytes.Byte2IntArrayMap;
-import it.unimi.dsi.fastutil.bytes.Byte2IntMap;
-import it.unimi.dsi.fastutil.objects.*;
-import net.sf.samtools.CigarElement;
-import net.sf.samtools.CigarOperator;
-import net.sf.samtools.SAMFileHeader;
-import org.broadinstitute.sting.gatk.downsampling.ReservoirDownsampler;
-import org.broadinstitute.sting.utils.BaseUtils;
-import org.broadinstitute.sting.utils.GenomeLoc;
-import org.broadinstitute.sting.utils.UnvalidatingGenomeLoc;
-import org.broadinstitute.sting.utils.collections.Pair;
-import org.broadinstitute.sting.utils.sam.AlignmentStartWithNoTiesComparator;
-import org.broadinstitute.sting.utils.sam.GATKSAMReadGroupRecord;
-import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
-import org.broadinstitute.sting.utils.sam.ReadUtils;
-
-import java.util.*;
-
-
-/**
- * Created by IntelliJ IDEA.
- * User: roger
- * Date: 8/3/11
- * Time: 2:24 PM
- */
-public class SlidingWindow {
-
-    // Sliding Window data
-    final protected PriorityQueue<GATKSAMRecord> readsInWindow;
-    final protected LinkedList<HeaderElement> windowHeader;
-    protected int contextSize;                                                                                          // the largest context size (between mismatches and indels)
-    protected String contig;
-    protected int contigIndex;
-    protected SAMFileHeader samHeader;
-    protected GATKSAMReadGroupRecord readGroupAttribute;
-    protected int downsampleCoverage;
-
-    // Running consensus data
-    protected int consensusCounter;
-    protected String consensusReadName;
-
-    // Filtered Data Consensus data
-    protected int filteredDataConsensusCounter;
-    protected String filteredDataReadName;
-
-    // Additional parameters
-    protected double MIN_ALT_PVALUE_TO_TRIGGER_VARIANT;                                                                 // pvalue has to be greater than this value to trigger variant region due to mismatches
-    protected double MIN_ALT_PROPORTION_TO_TRIGGER_VARIANT;                                                             // proportion has to be greater than this value to trigger variant region due to mismatches
-    protected double MIN_INDEL_BASE_PROPORTION_TO_TRIGGER_VARIANT;                                                      // proportion has to be greater than this value to trigger variant region due to deletions
-    protected int MIN_BASE_QUAL_TO_COUNT;                                                                               // qual has to be greater than or equal to this value
-    protected int MIN_MAPPING_QUALITY;
-
-    protected ReduceReads.DownsampleStrategy downsampleStrategy;
-    private boolean hasIndelQualities;
-
-    private static CompressionStash emptyRegions = new CompressionStash();
-
-    /**
-     * The types of synthetic reads
-     */
-    protected enum ConsensusType {
-        POSITIVE_CONSENSUS,
-        NEGATIVE_CONSENSUS,
-        FILTERED
-    }
-
-    public int getStopLocation() {
-        return getStopLocation(windowHeader);
-    }
-
-    private int getStopLocation(final LinkedList<HeaderElement> header) {
-        return header.isEmpty() ? -1 : header.peekLast().getLocation();
-    }
-
-    public String getContig() {
-        return contig;
-    }
-
-    public int getContigIndex() {
-        return contigIndex;
-    }
-
-    public int getStartLocation(final LinkedList<HeaderElement> header) {
-        return header.isEmpty() ? -1 : header.peek().getLocation();
-    }
-
-    // for testing only
-    protected SlidingWindow(final String contig, final int contigIndex, final int startLocation) {
-        this.contig = contig;
-        this.contigIndex = contigIndex;
-
-        contextSize = 10;
-
-        this.windowHeader = new LinkedList<>();
-        windowHeader.addFirst(new HeaderElement(startLocation));
-        this.readsInWindow = new PriorityQueue<>(100, new Comparator<GATKSAMRecord>() {
-            @Override
-            public int compare(GATKSAMRecord read1, GATKSAMRecord read2) {
-                return read1.getSoftEnd() - read2.getSoftEnd();
-            }
-        });
-    }
-
-    public SlidingWindow(final String contig, final int contigIndex, final int contextSize, final SAMFileHeader samHeader,
-                         final GATKSAMReadGroupRecord readGroupAttribute, final int windowNumber,
-                         final double minAltPValueToTriggerVariant, final double minAltProportionToTriggerVariant, final double minIndelProportionToTriggerVariant,
-                         final int minBaseQual, final int minMappingQuality, final int downsampleCoverage,
-                         final ReduceReads.DownsampleStrategy downsampleStrategy, final boolean hasIndelQualities) {
-        this.contextSize = contextSize;
-        this.downsampleCoverage = downsampleCoverage;
-
-        this.MIN_ALT_PVALUE_TO_TRIGGER_VARIANT = minAltPValueToTriggerVariant;
-        this.MIN_ALT_PROPORTION_TO_TRIGGER_VARIANT = minAltProportionToTriggerVariant;
-        this.MIN_INDEL_BASE_PROPORTION_TO_TRIGGER_VARIANT = minIndelProportionToTriggerVariant;
-        this.MIN_BASE_QUAL_TO_COUNT = minBaseQual;
-        this.MIN_MAPPING_QUALITY = minMappingQuality;
-
-        this.windowHeader = new LinkedList<>();
-        this.readsInWindow = new PriorityQueue<>(1000, new Comparator<GATKSAMRecord>() {
-            @Override
-            public int compare(GATKSAMRecord read1, GATKSAMRecord read2) {
-                return read1.getSoftEnd() - read2.getSoftEnd();
-            }
-        });
-
-        this.contig = contig;
-        this.contigIndex = contigIndex;
-        this.samHeader = samHeader;
-        this.readGroupAttribute = readGroupAttribute;
-
-        this.consensusCounter = 0;
-        this.consensusReadName = "Consensus-" + windowNumber + "-";
-
-        this.filteredDataConsensusCounter = 0;
-        this.filteredDataReadName = "Filtered-" + windowNumber + "-";
-
-        this.downsampleStrategy = downsampleStrategy;
-        this.hasIndelQualities = hasIndelQualities;
-    }
-
-    /**
-     * Add a read to the sliding window and slides the window accordingly.
-     * 
-     * Reads are assumed to be in order, therefore, when a read is added the sliding window can
-     * assume that no more reads will affect read.getUnclippedStart() - contextSizeMismatches. The window
-     * slides forward to that position and returns all reads that may have been finalized in the
-     * sliding process.
-     *
-     * @param read the read
-     * @return a non-null list of reads (in the CompressionStash) that have been finished by sliding the window.
-     */
-    @Requires({"read != null"})
-    @Ensures("result != null")
-    public CompressionStash addRead(GATKSAMRecord read) {
-        addToHeader(windowHeader, read);                                                                                // update the window header counts
-        // no need to track low mapping quality reads
-        if ( read.getMappingQuality() >= MIN_MAPPING_QUALITY )
-            readsInWindow.add(read);                                                                                    // add read to sliding reads
-        return slideWindow(read.getUnclippedStart());
-    }
-
-    /**
-     * Returns the next complete (or incomplete if closeLastRegion is true) variant region between 'from' (inclusive) and 'to' (exclusive)
-     * but converted to global coordinates.
-     *
-     * @param from         beginning window header index of the search window (inclusive) in local (to the windowHeader) coordinates
-     * @param to           end window header index of the search window (exclusive) in local (to the windowHeader) coordinates
-     * @param variantSite  boolean array with true marking variant regions
-     * @param closeLastRegion  if the last index is variant (so it's an incomplete region), should we close (and return as an interval) the location or ignore it?
-     * @return null if nothing is variant, start/stop if there is a complete variant region, start/-1 if there is an incomplete variant region.  All coordinates returned are global.
-     */
-    @Requires({"from >= 0", "from <= to", "to <= variantSite.length"})
-    private FinishedGenomeLoc findNextVariantRegion(int from, int to, boolean[] variantSite, boolean closeLastRegion) {
-        boolean foundStart = false;
-        final int windowHeaderStart = getStartLocation(windowHeader);
-        int variantRegionStartIndex = 0;
-        for (int i=from; i<to; i++) {
-            if (variantSite[i] && !foundStart) {
-                variantRegionStartIndex = i;
-                foundStart = true;
-            }
-            else if(!variantSite[i] && foundStart) {
-                return(new FinishedGenomeLoc(contig, contigIndex, windowHeaderStart + variantRegionStartIndex, windowHeaderStart + i - 1, true));
-            }
-        }
-        final int refStart = windowHeaderStart + variantRegionStartIndex;
-        final int refStop  = windowHeaderStart + to - 1;
-        return (foundStart && closeLastRegion) ? new FinishedGenomeLoc(contig, contigIndex, refStart, refStop, true) : null;
-    }
-
-    /**
-     * Creates a list with all the complete and incomplete variant regions within 'from' (inclusive) and 'to' (exclusive)
-     *
-     * @param from         beginning window header index of the search window (inclusive) in local (to the windowHeader) coordinates
-     * @param to           end window header index of the search window (exclusive) in local (to the windowHeader) coordinates
-     * @param variantSite  boolean array with true marking variant regions
-     * @return a list with start/stops of variant regions following findNextVariantRegion description in global coordinates
-     */
-    @Requires({"from >= 0", "from <= to", "to <= variantSite.length"})
-    @Ensures("result != null")
-    protected CompressionStash findVariantRegions(int from, int to, boolean[] variantSite, boolean closeLastRegion) {
-        final int windowHeaderStart = getStartLocation(windowHeader);
-
-        CompressionStash regions = new CompressionStash();
-        int index = from;
-        while(index < to) {
-            // returns results in global coordinates
-            FinishedGenomeLoc result = findNextVariantRegion(index, to, variantSite, closeLastRegion);
-            if (result == null)
-                break;
-
-            regions.add(result);
-            if (!result.isFinished())
-                break;
-
-            index = result.getStop() - windowHeaderStart + 1; // go back to local coordinates
-        }
-        return regions;
-    }
-
-    /**
-     * Determines if the window can be slid given the new incoming read.
-     *
-     * We check from the start of the window to the (unclipped) start of the new incoming read if there
-     * is any variant.
-     * If there are variant sites, we check if it's time to close the variant region.
-     *
-     * @param incomingReadUnclippedStart the incoming read's start position. Must be the unclipped start!
-     * @return all reads that have fallen to the left of the sliding window after the slide
-     */
-    protected CompressionStash slideWindow(final int incomingReadUnclippedStart) {
-        final int windowHeaderStartLocation = getStartLocation(windowHeader);
-        CompressionStash regions = emptyRegions;
-        boolean forceClose = true;
-
-        if (incomingReadUnclippedStart - contextSize > windowHeaderStartLocation) {
-            markSites(incomingReadUnclippedStart);
-            int readStartHeaderIndex = incomingReadUnclippedStart - windowHeaderStartLocation;
-            int breakpoint = Math.max(readStartHeaderIndex - contextSize - 1, 0);                                       // this is the limit of what we can close/send to consensus (non-inclusive)
-
-            regions = findVariantRegions(0, breakpoint, markedSites.getVariantSiteBitSet(), !forceClose);
-        }
-
-        while (!readsInWindow.isEmpty() && readsInWindow.peek().getSoftEnd() < windowHeaderStartLocation) {
-            readsInWindow.poll();
-        }
-
-        return regions;
-    }
-
-
-    protected final class MarkedSites {
-
-        private boolean[] siteIsVariant = new boolean[0];
-        private int startLocation = 0;
-
-        public MarkedSites() {}
-
-        public boolean[] getVariantSiteBitSet() { return siteIsVariant; }
-
-        protected int getStartLocation() { return startLocation; }
-
-        /**
-         * Updates the variant site bitset given the new startlocation and size of the region to mark.
-         *
-         * @param newStartLocation   the new start location of the bitset
-         * @param sizeOfRegion       the new size of the region to be represented
-         *
-         * @return the end position (newStartLocation + index) of the region marked by this method; the calling method is responsible for the remainder.
-         */
-        public int updateRegion(final int newStartLocation, final int sizeOfRegion) {
-            int lastPositionMarked = sizeOfRegion;
-
-            // if this is the first time we set the array and we can't reuse anything, just create a new array from scratch
-            if ( newStartLocation >= this.startLocation + siteIsVariant.length || newStartLocation < this.startLocation ) {
-                siteIsVariant = new boolean[sizeOfRegion];
-                lastPositionMarked = 0;
-            }
-            // if the dimensions change, copy what we can and continue
-            else if ( newStartLocation != this.startLocation || sizeOfRegion != siteIsVariant.length ) {
-                final boolean[] tempArray = new boolean[sizeOfRegion];
-                final int differenceInStartPositions = newStartLocation - this.startLocation;
-                lastPositionMarked = Math.min(siteIsVariant.length - differenceInStartPositions, sizeOfRegion);
-                System.arraycopy(siteIsVariant, differenceInStartPositions, tempArray, 0, lastPositionMarked);
-                siteIsVariant = null;   // explicitly allow garbage collection
-                siteIsVariant = tempArray;
-            }
-
-            this.startLocation = newStartLocation;
-
-            return lastPositionMarked + newStartLocation;
-        }
-    }
-
-    private final MarkedSites markedSites = new MarkedSites();
-
-    /**
-     * returns the MarkedSites object so that it can be tested after adding data to the Sliding Window
-     *
-     * @return the Marked Sites object used by this Sliding Window
-     */
-    protected MarkedSites getMarkedSitesForTesting() { return markedSites; }
-
-    /**
-     * returns an array marked with variant and non-variant regions (it uses markVariantRegion to make the marks)
-     *
-     * @param stop check the window from start to stop (not-inclusive); given in global coordinates
-     */
-    protected void markSites(final int stop) {
-
-        final int windowHeaderStartLocation = getStartLocation(windowHeader);
-        final int sizeOfMarkedRegion = stop - windowHeaderStartLocation + contextSize + 1;
-
-        // copy over as many bits as we can from the previous calculation.  Note that we can't trust the
-        // last (contextSize - 1) worth of bits because we may not have actually looked at variant regions there.
-        final int lastPositionMarked = markedSites.updateRegion(windowHeaderStartLocation, sizeOfMarkedRegion) - contextSize - 1;
-        final int locationToProcess = Math.max(windowHeaderStartLocation, Math.min(lastPositionMarked, stop - contextSize));
-
-        final ListIterator<HeaderElement> headerElementIterator = windowHeader.listIterator(locationToProcess - windowHeaderStartLocation);
-
-        // process a contextSize worth of region from scratch in case there's a variant there
-        for (int i = locationToProcess; i < stop; i++) {
-            if (headerElementIterator.hasNext()) {
-                HeaderElement headerElement = headerElementIterator.next();
-
-                if (headerElement.isVariant(MIN_ALT_PVALUE_TO_TRIGGER_VARIANT, MIN_ALT_PROPORTION_TO_TRIGGER_VARIANT, MIN_INDEL_BASE_PROPORTION_TO_TRIGGER_VARIANT))
-                    markVariantRegion(i - windowHeaderStartLocation);
-
-            } else
-                break;
-        }
-    }
-
-    /**
-     * Marks the sites around the variant site (as true)
-     *
-     * @param variantSiteLocation the location where a variant site was found
-     */
-    protected void markVariantRegion(final int variantSiteLocation) {
-        int from = (variantSiteLocation < contextSize) ? 0 : variantSiteLocation - contextSize;
-        int to = (variantSiteLocation + contextSize + 1 > markedSites.getVariantSiteBitSet().length) ? markedSites.getVariantSiteBitSet().length - 1 : variantSiteLocation + contextSize;
-        markRegionAs(from, to, true);
-    }
-
-    /**
-     * Marks the sites around the variant site (as true)
-     *
-     * @param from              the start index (inclusive) to mark
-     * @param to                the end index (inclusive) to mark
-     * @param isVariant         mark the region with this boolean value
-     */
-    private void markRegionAs(final int from, final int to, final boolean isVariant) {
-        for (int i = from; i <= to; i++)
-            markedSites.getVariantSiteBitSet()[i] = isVariant;
-    }
-
-    /**
-     * Adds bases to the running consensus
-     * 
-     * If adding a sequence with gaps, it will finalize multiple consensus reads and keep the last running consensus
-     *
-     * @param header  the header to use
-     * @param start   the first header index to add to consensus
-     * @param end     the first header index NOT TO add to consensus
-     * @param consensusType the consensus type to use
-     * @return a non-null list of consensus reads generated by this call. Empty list if no consensus was generated.
-     */
-    @Requires({"start >= 0 && (end >= start || end == 0)"})
-    @Ensures("result != null")
-    protected ObjectArrayList<GATKSAMRecord> addToSyntheticReads(final LinkedList<HeaderElement> header, final int start, final int end, final ConsensusType consensusType) {
-        final ObjectArrayList<GATKSAMRecord> reads = new ObjectArrayList<>();
-
-        SyntheticRead consensus = null;
-        final ListIterator<HeaderElement> headerElementIterator = header.listIterator(start);
-        boolean wasInConsensus = false;
-
-        for ( int currentPosition = start; currentPosition < end; currentPosition++ ) {
-
-            if ( ! headerElementIterator.hasNext() )
-                throw new IllegalStateException(String.format("Requested to add to synthetic reads a region that contains no header element at index: %d  - %d / %d", start, windowHeader.size(), end));
-            final HeaderElement headerElement = headerElementIterator.next();
-
-            if ( headerElement.hasConsensusData(consensusType) ) {
-                wasInConsensus = true;
-
-                // add to running consensus
-                if ( consensus == null )
-                    consensus = createNewConsensus(consensusType, headerElement.getLocation());
-
-                genericAddBaseToConsensus(consensus, headerElement.getBaseCounts(consensusType));
-
-            } else {
-
-                // add any outstanding consensus data
-                if ( wasInConsensus ) {
-                    reads.addAll(finalizeAndAdd(consensus, consensusType));
-                    consensus = null;
-                }
-
-                wasInConsensus = false;
-            }
-        }
-
-        // add any outstanding consensus data
-        reads.addAll(finalizeAndAdd(consensus, consensusType));
-
-        return reads;
-    }
-
-    private SyntheticRead createNewConsensus(final ConsensusType consensusType, final int start) {
-        if ( consensusType == ConsensusType.FILTERED )
-            return new SyntheticRead(samHeader, readGroupAttribute, contig, contigIndex, filteredDataReadName + filteredDataConsensusCounter++, start, hasIndelQualities, SyntheticRead.StrandType.STRANDLESS);
-        return new SyntheticRead(samHeader, readGroupAttribute, contig, contigIndex, consensusReadName + consensusCounter++, start, hasIndelQualities, consensusType == ConsensusType.POSITIVE_CONSENSUS ? SyntheticRead.StrandType.POSITIVE : SyntheticRead.StrandType.NEGATIVE);
-    }
-
-    /**
-     * Finalizes a synthetic read.
-     *
-     * @param consensus the consensus to finalize
-     * @param type the synthetic reads you want to close
-     * @return a possibly empty list of GATKSAMRecords generated by finalizing the synthetic reads
-     */
-    private ObjectArrayList<GATKSAMRecord> finalizeAndAdd(final SyntheticRead consensus, final ConsensusType type) {
-
-        final ObjectArrayList<GATKSAMRecord> list = new ObjectArrayList<>();
-
-        final GATKSAMRecord read;
-        if ( type == ConsensusType.FILTERED )
-            read = finalizeFilteredDataConsensus(consensus);
-        else
-            read = finalizeRunningConsensus(consensus);
-
-        if ( read != null )
-            list.add(read);
-
-        return list;
-    }
-
-    /**
-     * Generic accessor to add base and qualities to a synthetic read
-     *
-     * @param syntheticRead the synthetic read to add to
-     * @param baseCounts    the base counts object in the header element
-     */
-    private void genericAddBaseToConsensus(final SyntheticRead syntheticRead, final BaseAndQualsCounts baseCounts) {
-        final BaseIndex base = baseCounts.baseIndexWithMostProbability();
-        final int count = baseCounts.countOfBase(base);
-        final byte qual = baseCounts.averageQualsOfBase(base);
-        final byte insQual = baseCounts.averageInsertionQualsOfBase(base);
-        final byte delQual = baseCounts.averageDeletionQualsOfBase(base);
-        syntheticRead.add(base, count, qual, insQual, delQual, baseCounts.getRMS());
-    }
-
-    /**
-     * Method to compress a variant region and return the associated reduced reads
-     *
-     * @param start   the first window header index in the variant region (inclusive)
-     * @param stop    the last window header index of the variant region (inclusive)
-     * @param knownSnpPositions  the set of known SNPs used to determine whether to allow polyploid consensus creation here; can be null (to allow polyploid consensus anywhere)
-     * @return a non-null object representing all reads contained in the variant region
-     */
-    @Requires({"start >= 0 && (stop >= start || stop == 0)"})
-    @Ensures("result != null")
-    protected CloseVariantRegionResult compressVariantRegion(final int start, final int stop, final ObjectSortedSet<GenomeLoc> knownSnpPositions) {
-        final CloseVariantRegionResult allReads = new CloseVariantRegionResult(stop);
-
-        // Try to compress into a polyploid consensus
-        // Optimization: don't bother if there are no known SNPs here
-        final int hetRefPosition = (knownSnpPositions != null && knownSnpPositions.isEmpty()) ? -1 : findSinglePolyploidCompressiblePosition(start, stop);
-
-        // Note that using the hetRefPosition protects us from trying to compress variant regions that are created by
-        //   insertions (which we don't want because we can't confirm that they represent the same allele).
-        // Also, we only allow polyploid consensus creation at known sites if provided.
-        if ( hetRefPosition != -1 && matchesKnownPosition(windowHeader.get(hetRefPosition).getLocation(), knownSnpPositions) ) {
-            // try to create the polyploid consensus
-            allReads.reads.addAll(createPolyploidConsensus(hetRefPosition));
-            allReads.stopPerformed = hetRefPosition;  // we stopped at the het position
-        }
-        // if we can't create a polyploid consensus here, return all reads that overlap the variant region and remove them
-        // from the window header entirely; also remove all reads preceding the variant region (since they will be output
-        // as consensus right after compression)
-        else {
-            final int refStart = windowHeader.get(start).getLocation();
-            final int refStop = windowHeader.get(stop).getLocation();
-
-            final ObjectList<GATKSAMRecord> toRemoveFromWindow = new ObjectArrayList<>();
-            final ObjectList<GATKSAMRecord> toEmit = new ObjectArrayList<>();
-            for ( final GATKSAMRecord read : readsInWindow ) {
-                if ( read.getSoftStart() <= refStop ) {
-                    if ( read.getAlignmentEnd() >= refStart ) {
-                        toEmit.add(read);
-                        removeFromHeader(windowHeader, read);
-                    }
-                    toRemoveFromWindow.add(read);
-                }
-            }
-
-            // remove all used reads
-            for ( final GATKSAMRecord read : toRemoveFromWindow )
-                readsInWindow.remove(read);
-
-            // down-sample the unreduced reads if needed
-            allReads.reads.addAll(downsampleCoverage > 0 ? downsampleVariantRegion(toEmit) : toEmit);
-        }
-
-        return allReads;
-    }
-
-    /**
-     * Determines whether the given position match one of the known sites
-     *
-     * @param targetPosition     the position of the het site
-     * @param knownSnpPositions  the set of known SNPs used to determine whether to allow polyploid consensus creation here; can be null (to allow polyploid consensus anywhere)
-     * @return true if the targetPosition matches a known SNP position, false otherwise
-     */
-    @Requires({"targetPosition >= 1 && knownSnpPositions != null"})
-    protected boolean matchesKnownPosition(final int targetPosition, final ObjectSortedSet<GenomeLoc> knownSnpPositions) {
-        final GenomeLoc targetLoc = new UnvalidatingGenomeLoc(contig, contigIndex, targetPosition, targetPosition);
-        return knownSnpPositions == null || knownSnpPositions.contains(targetLoc);
-    }
-
-    /*
-     * Finds the het variant position located within start and stop (inclusive) if one exists.
-     *
-     * @param start   the first header index in the region to check (inclusive)
-     * @param stop    the last header index of the region to check (inclusive)
-     * @return the window header index of the single het position or -1 if either none or more than one exists
-     */
-    @Requires("start >= 0 && (stop >= start || stop == 0)")
-    protected int findSinglePolyploidCompressiblePosition(final int start, final int stop) {
-        int hetRefPosition = -1;
-
-        for ( int i = start; i <= stop; i++ ) {
-
-            final int nAlleles = windowHeader.get(i).getNumberOfBaseAlleles(MIN_ALT_PVALUE_TO_TRIGGER_VARIANT, MIN_ALT_PROPORTION_TO_TRIGGER_VARIANT);
-
-            // we will only work on diploid non-indel cases because we just don't want to handle/test other scenarios
-            if ( nAlleles > 2 || nAlleles == -1 )
-                return -1;
-
-            if ( nAlleles == 2 ) {
-
-                // make sure that there is only 1 site in the region that contains more than one allele
-                if ( hetRefPosition != -1 )
-                    return -1;
-
-                hetRefPosition = i;
-            }
-        }
-
-        return hetRefPosition;
-    }
-
-    /*
-     * Checks whether there's a position in the header with a significant number of softclips or a variant.
-     *
-     * @param header          the window header to examine
-     * @param positionToSkip  the global position to skip in the examination (use negative number if you don't want to make use of this argument)
-     * @return true if there exists a position with significant softclips, false otherwise
-     */
-    @Requires("header != null")
-    protected boolean hasPositionWithSignificantSoftclipsOrVariant(final List<HeaderElement> header, final int positionToSkip) {
-
-        for ( final HeaderElement headerElement : header ) {
-
-            if ( headerElement.getLocation() == positionToSkip )
-                continue;
-
-            if ( headerElement.hasSignificantSoftclips(MIN_ALT_PVALUE_TO_TRIGGER_VARIANT, MIN_ALT_PROPORTION_TO_TRIGGER_VARIANT) ||
-                 headerElement.getNumberOfBaseAlleles(MIN_ALT_PVALUE_TO_TRIGGER_VARIANT, MIN_ALT_PROPORTION_TO_TRIGGER_VARIANT) != 1 )
-                return true;
-        }
-
-        return false;
-    }
-
-    /**
-     * Finalizes a variant region, any adjacent synthetic reads.
-     *
-     * @param start   the first window header index in the variant region (inclusive)
-     * @param stop    the last window header index of the variant region (inclusive)
-     * @param knownSnpPositions  the set of known SNPs used to determine whether to allow polyploid consensus creation here; can be null (to allow polyploid consensus anywhere)
-     * @return a non-null object representing all reads contained in the variant region plus any adjacent synthetic reads
-     */
-    @Requires({"start >= 0 && (stop >= start || stop == 0)"})
-    @Ensures("result != null")
-    protected CloseVariantRegionResult closeVariantRegion(final int start, final int stop, final ObjectSortedSet<GenomeLoc> knownSnpPositions) {
-        final CloseVariantRegionResult allReads = compressVariantRegion(start, stop, knownSnpPositions);
-        allReads.reads.addAll(addAllSyntheticReadTypes(0, allReads.stopPerformed + 1));
-        return allReads;
-    }
-
-    /**
-     * Adds reads for all possible strands (positive, negative, filtered) from the global windowHeader object
-     *
-     * @param start   the start position (inclusive)
-     * @param end     the end position (exclusive)
-     * @return non-null but possibly empty array list with reduced reads
-     */
-    private ObjectArrayList<GATKSAMRecord> addAllSyntheticReadTypes(final int start, final int end) {
-        final ObjectArrayList<GATKSAMRecord> reads = new ObjectArrayList<>();
-        reads.addAll(addToSyntheticReads(windowHeader, start, end, ConsensusType.POSITIVE_CONSENSUS));
-        reads.addAll(addToSyntheticReads(windowHeader, start, end, ConsensusType.NEGATIVE_CONSENSUS));
-        reads.addAll(addToSyntheticReads(windowHeader, start, end, ConsensusType.FILTERED));
-        return reads;
-    }
-
-    /*
-     * @see #closeVariantRegions(CompressionStash, ObjectSortedSet<GenomeLoc>, boolean) with forceCloseFullRegions set to false
-     */
-    public ObjectSet<GATKSAMRecord> closeVariantRegions(final CompressionStash regions, final ObjectSortedSet<GenomeLoc> knownSnpPositions) {
-        return closeVariantRegions(regions, knownSnpPositions, false);
-    }
-
-    private static final class CloseVariantRegionResult {
-        final private ObjectList<GATKSAMRecord> reads = new ObjectArrayList<>();
-        private int stopPerformed;
-
-        public CloseVariantRegionResult(final int stopPerformed) { this.stopPerformed = stopPerformed; }
-    }
-
-    /*
-     * Finalizes the list of regions requested (and any regions preceding them)
-     *
-     * @param regions            the list of regions to finalize
-     * @param knownSnpPositions  the set of known SNP positions; can be null (to allow polyploid consensus anywhere)
-     * @param forceCloseFullRegions if true, requires this method to make sure all regions are fully closed; otherwise, we may decide not to close up to the very end (e.g. during het compression)
-     * @return a non-null set of reduced reads representing the finalized regions
-     */
-    public ObjectSet<GATKSAMRecord> closeVariantRegions(final CompressionStash regions, final ObjectSortedSet<GenomeLoc> knownSnpPositions, final boolean forceCloseFullRegions) {
-        final ObjectAVLTreeSet<GATKSAMRecord> allReads = new ObjectAVLTreeSet<>(new AlignmentStartWithNoTiesComparator());
-        if ( !regions.isEmpty() ) {
-
-            int windowHeaderStart = getStartLocation(windowHeader);
-            HeaderElement lastCleanedElement = null;
-
-            for ( final GenomeLoc region : regions ) {
-                if (((FinishedGenomeLoc)region).isFinished() && region.getContig().equals(contig) && region.getStart() >= windowHeaderStart && region.getStop() < windowHeaderStart + windowHeader.size()) {
-                    final int start = region.getStart() - windowHeaderStart;
-                    int stop = region.getStop() - windowHeaderStart;
-
-                    // make sure the bitset is complete given the region (it might not be in multi-sample mode)
-                    if ( region.getStop() > markedSites.getStartLocation() + markedSites.getVariantSiteBitSet().length - 1 )
-                        markSites(region.getStop());
-
-                    CloseVariantRegionResult closeVariantRegionResult = closeVariantRegion(start, stop, knownSnpPositions);
-                    allReads.addAll(closeVariantRegionResult.reads);
-
-                    // check whether we didn't close the whole region that was requested
-                    if ( stop > 0 && closeVariantRegionResult.stopPerformed < stop ) {
-                        // we should update the variant sites bitset because the context size's worth of bases after the variant position are no longer "variant"
-                        markRegionAs(closeVariantRegionResult.stopPerformed + 1, stop, false);
-
-                        // if the calling method said that it didn't care then we are okay so update the stop
-                        if ( !forceCloseFullRegions ) {
-                            stop = closeVariantRegionResult.stopPerformed;
-                        }
-                        // otherwise, we need to forcibly push the stop that we originally requested
-                        else {
-                            while ( closeVariantRegionResult.stopPerformed < stop ) {
-                                // first clean up used header elements so they don't get reused
-                                for ( int i = 0; i <= closeVariantRegionResult.stopPerformed; i++ )
-                                    windowHeader.remove();
-                                stop -= (closeVariantRegionResult.stopPerformed + 1);
-
-                                closeVariantRegionResult = closeVariantRegion(0, stop, knownSnpPositions);
-                                allReads.addAll(closeVariantRegionResult.reads);
-                            }
-                        }
-                    }
-
-                    // We need to clean up the window header elements up until the end of the requested region so that they don't get used for future regions.
-                    // Note that this cleanup used to happen outside the above for-loop, but that was causing an occasional doubling of the reduced reads
-                    //  (in the case where there are multiple regions to close we'd reuse the reads for each region).
-                    if ( stop >= 0 ) {
-                        for ( int i = 0; i < stop; i++ )
-                            windowHeader.remove();
-                        lastCleanedElement = windowHeader.remove();
-                        windowHeaderStart = getStartLocation(windowHeader);
-                    }
-                }
-            }
-
-            // we need to keep the last element of the last cleaned region in the event that the following element has a read that starts with an insertion.
-            if ( lastCleanedElement != null && lastCleanedElement.hasInsertionToTheRight() )
-                windowHeader.addFirst(new HeaderElement(lastCleanedElement.getLocation(), lastCleanedElement.numInsertionsToTheRight()));
-        }
-
-        return allReads;
-    }
-
-    /**
-     * Downsamples a variant region to the downsample coverage of the sliding window.
-     *
-     * It will use the downsampling strategy defined by the SlidingWindow
-     *
-     * @param allReads  a non-null list of reads to select from (all reads that cover the window)
-     * @return a non-null list of reads selected by the downsampler to cover the window to at least the desired coverage
-     */
-    @Requires({"allReads != null"})
-    @Ensures("result != null")
-    protected ObjectList<GATKSAMRecord> downsampleVariantRegion(final ObjectList<GATKSAMRecord> allReads) {
-        int nReads = allReads.size();
-        if (nReads == 0)
-            return allReads;
-
-        if (downsampleCoverage >= nReads)
-            return allReads;
-
-        ReservoirDownsampler <GATKSAMRecord> downsampler = new ReservoirDownsampler<>(downsampleCoverage);
-        downsampler.submit(allReads);
-        return new ObjectArrayList<>(downsampler.consumeFinalizedItems());
-    }
-
-
-    /**
-     * Properly closes a Sliding Window, finalizing all consensus and variant
-     * regions that still exist regardless of being able to fulfill the
-     * context size requirement in the end.
-     *
-     * @param knownSnpPositions  the set of known SNP positions; can be null (to allow polyploid consensus anywhere)
-     * @return A non-null set/list of all reads generated
-     */
-    @Ensures("result != null")
-    public Pair<ObjectSet<GATKSAMRecord>, CompressionStash> close(final ObjectSortedSet<GenomeLoc> knownSnpPositions) {
-        // mark variant regions
-        ObjectSet<GATKSAMRecord> finalizedReads = new ObjectAVLTreeSet<>(new AlignmentStartWithNoTiesComparator());
-        CompressionStash regions = new CompressionStash();
-
-        if (!windowHeader.isEmpty()) {
-            markSites(getStopLocation(windowHeader) + 1);
-            regions = findVariantRegions(0, windowHeader.size(), markedSites.getVariantSiteBitSet(), true);
-            finalizedReads = closeVariantRegions(regions, knownSnpPositions, true);
-
-            if (!windowHeader.isEmpty())
-                finalizedReads.addAll(addAllSyntheticReadTypes(0, windowHeader.size()));
-        }
-
-        return new Pair<>(finalizedReads, regions);
-    }
-
-    /**
-     * generates the SAM record for the running consensus read and resets it (to null)
-     *
-     * @param runningConsensus the consensus to finalize
-     * @return the read contained in the running consensus or null
-     */
-    protected GATKSAMRecord finalizeRunningConsensus(final SyntheticRead runningConsensus) {
-        GATKSAMRecord finalizedRead = null;
-
-        if ( runningConsensus != null ) {
-            if ( runningConsensus.size() > 0 )
-                finalizedRead = runningConsensus.close();
-            else
-                consensusCounter--;
-        }
-
-        return finalizedRead;
-    }
-
-    /**
-     * generates the SAM record for the filtered data consensus and resets it (to null)
-     *
-     * @param filteredDataConsensus the consensus to finalize
-     * @return the read contained in the running consensus or null
-     */
-    protected GATKSAMRecord finalizeFilteredDataConsensus(final SyntheticRead filteredDataConsensus) {
-        GATKSAMRecord finalizedRead = null;
-        if (filteredDataConsensus != null) {
-            if (filteredDataConsensus.size() > 0)
-                finalizedRead = filteredDataConsensus.close();
-            else
-                filteredDataConsensusCounter--;
-        }
-        return finalizedRead;
-    }
-
-    // define this so that we can use Java generics below
-    private final static class HeaderElementList extends LinkedList<HeaderElement> {}
-
-    private final static class SingleStrandConsensusData {
-        final HeaderElementList consensus = new HeaderElementList();
-        final ObjectList<GATKSAMRecord> reads = new ObjectArrayList<>();
-    }
-
-    /**
-     * Finalizes a variant region - and any adjacent synthetic reads - for point mutations (indel sites are not
-     * supported) with polyploid compression.
-     *
-     * @param hetRefPosition    window header index of the het site; MUST NOT BE AN INDEL SITE!
-     * @return a non-null list of all reads contained in the variant region as a polyploid consensus
-     */
-    @Requires({"start >= 0 && (stop >= start || stop == 0)"})
-    @Ensures({"result != null"})
-    protected ObjectList<GATKSAMRecord> createPolyploidConsensus(final int hetRefPosition) {
-        // we will create two (positive strand, negative strand) headers for each haplotype
-        final SingleStrandConsensusData[] headersPosStrand = new SingleStrandConsensusData[2];
-        final SingleStrandConsensusData[] headersNegStrand = new SingleStrandConsensusData[2];
-
-        final int globalHetRefPosition = windowHeader.get(hetRefPosition).getLocation();
-
-        // initialize the mapping from base (allele) to header
-        final Byte2IntMap alleleHeaderMap = new Byte2IntArrayMap(2);
-        alleleHeaderMap.defaultReturnValue(-1);
-        for ( final BaseIndex allele : windowHeader.get(hetRefPosition).getAlleles(MIN_ALT_PVALUE_TO_TRIGGER_VARIANT, MIN_ALT_PROPORTION_TO_TRIGGER_VARIANT) ) {
-            final int currentIndex = alleleHeaderMap.size();
-            if ( currentIndex > 1 )
-                throw new IllegalStateException("There are more than 2 alleles present when creating a diploid consensus");
-
-            alleleHeaderMap.put(allele.b, currentIndex);
-            headersPosStrand[currentIndex] = new SingleStrandConsensusData();
-            headersNegStrand[currentIndex] = new SingleStrandConsensusData();
-        }
-
-        // sanity check that we saw 2 alleles
-        if ( alleleHeaderMap.size() != 2 )
-            throw new IllegalStateException("We expected to see 2 alleles when creating a diploid consensus but saw " + alleleHeaderMap.size());
-
-        final ObjectList<GATKSAMRecord> readsToRemove = new ObjectArrayList<>();
-
-        for ( final GATKSAMRecord read : readsInWindow ) {
-
-            // if the read falls after the het position, just skip it for now (we'll get to it later)
-            if ( read.getSoftStart() > globalHetRefPosition )
-                continue;
-
-            // remove all other reads from the read cache since we're going to use them here
-            readsToRemove.add(read);
-
-            // if the read falls before the het position or has low MQ, we don't need to look at it
-            if ( read.getSoftEnd() < globalHetRefPosition || read.getMappingQuality() < MIN_MAPPING_QUALITY)
-                continue;
-
-            // remove all spanning reads from the consensus header since we're going to incorporate them into a consensus here instead
-            removeFromHeader(windowHeader, read);
-
-            // where on the read is the het position?
-            final int readPosOfHet = ReadUtils.getReadCoordinateForReferenceCoordinate(read, globalHetRefPosition, ReadUtils.ClippingTail.LEFT_TAIL);
-
-            // this is safe because indels are not supported
-            final byte base = read.getReadBases()[readPosOfHet];
-
-            // check which allele this read represents
-            final int allele = alleleHeaderMap.get(base);
-
-            // ignore the read if it represents a base that's not part of the consensus
-            if ( allele != -1 ) {
-                // add to the appropriate polyploid header
-                final SingleStrandConsensusData header = read.getReadNegativeStrandFlag() ? headersNegStrand[allele] : headersPosStrand[allele];
-                header.reads.add(read);
-                addToHeader(header.consensus, read);
-            }
-        }
-
-        for ( final GATKSAMRecord read : readsToRemove )
-            readsInWindow.remove(read);
-
-        // create the polyploid synthetic reads if we can
-        final ObjectList<GATKSAMRecord> hetReads = new ObjectArrayList<>();
-
-        // sanity check that no new "variant region" exists on just a single consensus strand due to softclips
-        // or multi-allelic sites now that we've broken everything out into their component parts.  if one does
-        // exist then we need to back out the consensus for that strand only.
-        for ( final SingleStrandConsensusData header : headersPosStrand ) {
-            if ( hasPositionWithSignificantSoftclipsOrVariant(header.consensus, globalHetRefPosition) )
-                hetReads.addAll(header.reads);
-            else
-                finalizeHetConsensus(header.consensus, false, hetReads);
-        }
-        for ( final SingleStrandConsensusData header : headersNegStrand ) {
-            if ( hasPositionWithSignificantSoftclipsOrVariant(header.consensus, globalHetRefPosition) )
-                hetReads.addAll(header.reads);
-            else
-                finalizeHetConsensus(header.consensus, true, hetReads);
-        }
-
-        return hetReads;
-    }
-
-    /*
-     * Finalizes a particular het consensus for the given header representation
-     *
-     * @param header            the list of header elements representing the header for the consensus
-     * @param isNegativeStrand  does this header represent reads on the negative strand?
-     * @param result            list in which to store results
-     */
-    protected void finalizeHetConsensus(final LinkedList<HeaderElement> header, final boolean isNegativeStrand, final ObjectList<GATKSAMRecord> result) {
-        if ( header.size() > 0 ) {
-            if ( isNegativeStrand )
-                result.addAll(addToSyntheticReads(header, 0, header.size(), ConsensusType.NEGATIVE_CONSENSUS));
-            else
-                result.addAll(addToSyntheticReads(header, 0, header.size(), ConsensusType.POSITIVE_CONSENSUS));
-        }
-    }
-
-    private void addToHeader(LinkedList<HeaderElement> header, GATKSAMRecord read) {
-        updateHeaderCounts(header, read, false);
-    }
-
-    private void removeFromHeader(LinkedList<HeaderElement> header, GATKSAMRecord read) {
-        updateHeaderCounts(header, read, true);
-    }
-
-    /**
-     * Updates the sliding window's header counts with the incoming read bases, insertions
-     * and deletions.
-     *
-     * @param header      the sliding window header to use
-     * @param read        the incoming read to be added to the sliding window
-     * @param removeRead  if we are removing the read from the header or adding
-     */
-    protected void updateHeaderCounts(final LinkedList<HeaderElement> header, final GATKSAMRecord read, final boolean removeRead) {
-        final int readStart = read.getSoftStart();
-        final int headerStart = getStartLocation(header);
-        int locationIndex = headerStart < 0 ? 0 : readStart - headerStart;
-
-        if ( removeRead && locationIndex < 0 )
-            throw new IllegalStateException("Provided read is behind the Sliding Window! Read = " + read + ", readStart = " + readStart + ", cigar = " + read.getCigarString() + ", window = " + headerStart + "-" + getStopLocation(header));
-
-        // we only need to create new header elements if we are adding the read, not when we're removing it
-        if ( !removeRead )
-            locationIndex = createNewHeaderElements(header, read, locationIndex);
-
-        actuallyUpdateHeaderForRead(header, read, removeRead, locationIndex);
-    }
-
-    /*
-     * Creates new header elements if needed for the given read.
-     *
-     * @param header        the sliding window header to use
-     * @param read          the incoming read to be added to the sliding window
-     * @param startIndex    the start location index into the header for this read
-     *
-     * @return an updated index into the modified header
-     */
-    @Requires("header != null && read != null")
-    protected int createNewHeaderElements(final LinkedList<HeaderElement> header, final GATKSAMRecord read, final int startIndex) {
-
-        int headerStart = getStartLocation(header);
-        int locationIndex = startIndex;
-
-        // Do we need to add extra elements before the start of the header?  This could happen if the previous read was
-        // clipped and this alignment starts before the beginning of the window
-        final int readStart = read.getSoftStart();
-        if ( startIndex < 0 ) {
-            for ( int i = 1; i <= -startIndex; i++ )
-                header.addFirst(new HeaderElement(headerStart - i));
-
-            // update the start location accordingly
-            headerStart = readStart;
-            locationIndex = 0;
-        }
-
-        // Do we need to add extra elements to the end of the header?
-        final int headerStop = getStopLocation(header);
-        final int readEnd = read.getSoftEnd();
-        if ( headerStop < readEnd ) {
-            final int elementsToAdd = (headerStop < 0) ? readEnd - readStart + 1 : readEnd - headerStop;
-            for ( int i = elementsToAdd - 1; i >= 0; i-- )
-                header.addLast(new HeaderElement(readEnd - i));
-        }
-
-        // Special case for leading insertions before the beginning of the sliding read
-        if ( (readStart == headerStart || headerStart < 0) && ReadUtils.readStartsWithInsertion(read.getCigar(), false) != null ) {
-            // create a new first element to the window header with no bases added
-            header.addFirst(new HeaderElement(readStart - 1));
-            // this allows the first element (I) to look at locationIndex - 1 when we update the header and do the right thing
-            locationIndex = 1;
-        }
-
-        return locationIndex;
-    }
-
-    /*
-     * Actually updates the sliding window's header counts with the incoming read bases and quals (including insertion and deletion quals).
-     *
-     * @param header        the sliding window header to use
-     * @param read          the incoming read to be added to the sliding window
-     * @param removeRead    if we are removing the read from the header or adding
-     * @param startIndex    the start location index into the header for this read
-     */
-    @Requires("header != null && read != null && startIndex >= 0")
-    protected void actuallyUpdateHeaderForRead(final LinkedList<HeaderElement> header, final GATKSAMRecord read, final boolean removeRead, final int startIndex) {
-
-        final Iterator<HeaderElement> headerElementIterator = header.listIterator(startIndex);
-        final int mappingQuality = read.getMappingQuality();
-        final boolean isNegativeStrand = read.getReadNegativeStrandFlag();
-
-        // iterator variables
-        int locationIndex = startIndex;
-        int readBaseIndex = 0;
-        HeaderElement headerElement;
-
-        for ( final CigarElement cigarElement : read.getCigar().getCigarElements() ) {
-            switch ( cigarElement.getOperator() ) {
-                case H:
-                    break;
-                case I:
-                    readBaseIndex += cigarElement.getLength();
-
-                    // special case, if we don't have the previous header element anymore, don't worry about it.
-                    if ( locationIndex == 0 )
-                        break;
-
-                    // insertions are added to the base to the left (previous element)
-                    headerElement = header.get(locationIndex - 1);
-
-                    if ( removeRead )
-                        headerElement.removeInsertionToTheRight();
-                    else
-                        headerElement.addInsertionToTheRight();
-
-                    break;
-                case D:
-                    // deletions are added to the baseCounts with the read mapping quality as its quality score
-                    final int nDeletionBases = cigarElement.getLength();
-                    final byte MQbyte = mappingQuality > Byte.MAX_VALUE ? Byte.MAX_VALUE : (byte)mappingQuality;
-                    for ( int i = 0; i < nDeletionBases; i++ ) {
-                        headerElement = headerElementIterator.next();
-                        if (removeRead)
-                            headerElement.removeBase(BaseUtils.Base.D.base, MQbyte, MQbyte, MQbyte, mappingQuality, MIN_BASE_QUAL_TO_COUNT, MIN_MAPPING_QUALITY, false, isNegativeStrand);
-                        else
-                            headerElement.addBase(BaseUtils.Base.D.base, MQbyte, MQbyte, MQbyte, mappingQuality, MIN_BASE_QUAL_TO_COUNT, MIN_MAPPING_QUALITY, false, isNegativeStrand);
-                    }
-                    locationIndex += nDeletionBases;
-                    break;
-                case S:
-                case M:
-                case P:
-                case EQ:
-                case X:
-                    final int nBasesToAdd = cigarElement.getLength();
-                    final boolean isSoftClip = cigarElement.getOperator() == CigarOperator.S;
-                    final byte[] readBases = read.getReadBases();
-                    final byte[] readQuals = read.getBaseQualities();
-                    final boolean readHasIndelQuals = read.hasBaseIndelQualities();
-                    final byte[] insertionQuals = readHasIndelQuals ? read.getBaseInsertionQualities() : null;
-                    final byte[] deletionQuals = readHasIndelQuals ? read.getBaseDeletionQualities() : null;
-
-                    for ( int i = 0; i < nBasesToAdd; i++ ) {
-                        headerElement = headerElementIterator.next();
-                        final byte insertionQuality = readHasIndelQuals ? insertionQuals[readBaseIndex] : -1;
-                        final byte deletionQuality = readHasIndelQuals ? deletionQuals[readBaseIndex] : -1;
-
-                        if ( removeRead )
-                            headerElement.removeBase(readBases[readBaseIndex], readQuals[readBaseIndex], insertionQuality, deletionQuality, mappingQuality, MIN_BASE_QUAL_TO_COUNT, MIN_MAPPING_QUALITY, isSoftClip, isNegativeStrand);
-                        else
-                            headerElement.addBase(readBases[readBaseIndex], readQuals[readBaseIndex], insertionQuality, deletionQuality, mappingQuality, MIN_BASE_QUAL_TO_COUNT, MIN_MAPPING_QUALITY, isSoftClip, isNegativeStrand);
-
-                        readBaseIndex++;
-                    }
-                    locationIndex += nBasesToAdd;
-                    break;
-                default:
-                    break;
-            }
-        }
-    }
-}
-
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/SyntheticRead.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/SyntheticRead.java
deleted file mode 100644
index 9d16ea06f..000000000
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/SyntheticRead.java
+++ /dev/null
@@ -1,369 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.compression.reducereads;
-
-import com.google.java.contract.Requires;
-import it.unimi.dsi.fastutil.objects.ObjectArrayList;
-import net.sf.samtools.Cigar;
-import net.sf.samtools.CigarElement;
-import net.sf.samtools.CigarOperator;
-import net.sf.samtools.SAMFileHeader;
-import org.broadinstitute.sting.utils.exceptions.ReviewedStingException;
-import org.broadinstitute.sting.utils.recalibration.EventType;
-import org.broadinstitute.sting.utils.sam.GATKSAMReadGroupRecord;
-import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
-
-import java.util.Iterator;
-
-
-/**
- * Running Consensus is a read that is compressed as a sliding window travels over the reads
- * and keeps track of all the bases that are outside of variant regions.
- *
- * Consensus reads have qual fields that correspond to the number of reads that had the base
- * and passed the minimum quality threshold.
- *
- * The mapping quality of a consensus read is the average RMS of the mapping qualities of all reads
- * that compose the consensus
- *
- * @author Mauricio Carneiro
- * @since 8/26/11
- */
-public class SyntheticRead {
-
-    /**
-     * The types of strandedness for synthetic reads
-     */
-    public enum StrandType {
-        POSITIVE,
-        NEGATIVE,
-        STRANDLESS
-    }
-
-    // Rather than storing a separate list for each attribute in SingleBaseInfo, store one list to reduce memory footprint.
-    private static class SingleBaseInfo {
-        byte baseIndexOrdinal; // enum BaseIndex.ordinal
-        int count;
-        byte qual;
-        byte insertionQual;
-        byte deletionQual;
-
-        SingleBaseInfo(byte baseIndexOrdinal, int count, byte qual, byte insertionQual, byte deletionQual) {
-            this.baseIndexOrdinal = baseIndexOrdinal;
-            this.count = count;
-            this.qual = qual;
-            this.insertionQual = insertionQual;
-            this.deletionQual = deletionQual;
-        }
-    }
-
-    // This class is merely sharing of code for convertVariableGivenBases().
-    private abstract class SingleBaseInfoIterator implements Iterator<Byte> {
-        final Iterator<SingleBaseInfo> it;
-
-        SingleBaseInfoIterator() {
-            this.it = basesCountsQuals.iterator();
-        }
-
-        public boolean hasNext() {
-            return it.hasNext();
-        }
-
-        public void remove() {
-            throw new UnsupportedOperationException();
-        }
-    }
-    
-        
-    // Map from ordinal to enum value.
-    private static final BaseIndex[] BaseIndexByOrdinal = new BaseIndex[BaseIndex.values().length];
-    static 
-    {
-        for (final BaseIndex baseIndex : BaseIndex.values()) {
-            BaseIndexByOrdinal[baseIndex.ordinal()] = baseIndex;
-        }
-    }
-    
-    
-    private final ObjectArrayList<SingleBaseInfo> basesCountsQuals;
-    private double mappingQuality;
-
-    // Information to produce a GATKSAMRecord
-    private SAMFileHeader header;
-    private GATKSAMReadGroupRecord readGroupRecord;
-    private String contig;
-    private int contigIndex;
-    private String readName;
-    private int refStart;
-    private boolean hasIndelQualities = false;
-    private StrandType strandType = StrandType.STRANDLESS;
-
-    /**
-     * Full initialization of the running consensus if you have all the information and are ready to
-     * start adding to the running consensus.
-     *
-     * @param header          GATKSAMRecord file header
-     * @param readGroupRecord Read Group for the GATKSAMRecord
-     * @param contig          the read's contig name
-     * @param contigIndex     the read's contig index
-     * @param readName        the read's name
-     * @param refStart        the alignment start (reference based)
-     */
-    public SyntheticRead(SAMFileHeader header, GATKSAMReadGroupRecord readGroupRecord, String contig, int contigIndex, String readName, int refStart, boolean hasIndelQualities, StrandType strandType) {
-        final int initialCapacity = 10000;
-        basesCountsQuals = new ObjectArrayList<SingleBaseInfo>(initialCapacity);
-        mappingQuality = 0.0;
-
-        this.header = header;
-        this.readGroupRecord = readGroupRecord;
-        this.contig = contig;
-        this.contigIndex = contigIndex;
-        this.readName = readName;
-        this.refStart = refStart;
-        this.hasIndelQualities = hasIndelQualities;
-        this.strandType = strandType;
-    }
-
-    /**
-     * Easy access to keep adding to a running consensus that has already been
-     * initialized with the correct read name and refStart
-     *
-     * @param base   the base to add
-     * @param count  number of reads with this base
-     */
-    @Requires("count <= Byte.MAX_VALUE")
-    public void add(BaseIndex base, int count, byte qual, byte insQual, byte delQual, double mappingQuality) {
-        basesCountsQuals.add(new SingleBaseInfo(base.getOrdinalByte(), count, qual, insQual, delQual));
-        this.mappingQuality += mappingQuality;
-    }
-
-    public BaseIndex getBase(final int readCoordinate) {
-        return BaseIndexByOrdinal[basesCountsQuals.get(readCoordinate).baseIndexOrdinal];
-    }
-
-    public int getRefStart() {
-        return refStart;
-    }
-
-    /**
-     * Creates a GATKSAMRecord of the synthetic read. Will return null if the read is invalid.
-     *
-     * Invalid reads are :
-     *   - exclusively composed of deletions
-     *
-     * @return a GATKSAMRecord or null
-     */
-    public GATKSAMRecord close () {
-        if (isAllDeletions())
-            return null;
-
-        GATKSAMRecord read = new GATKSAMRecord(header);
-        read.setReferenceName(contig);
-        read.setReferenceIndex(contigIndex);
-        read.setReadPairedFlag(false);
-        read.setReadUnmappedFlag(false);
-        if ( strandType != StrandType.STRANDLESS ) {
-            read.setAttribute(GATKSAMRecord.REDUCED_READ_STRANDED_TAG, '1');  // must come before next line
-            read.setReadNegativeStrandFlag(strandType == StrandType.NEGATIVE);
-        }
-        read.setCigar(buildCigar());           // the alignment start may change while building the cigar (leading deletions)
-        read.setAlignmentStart(refStart);
-        read.setReadName(readName);
-        read.setBaseQualities(convertBaseQualities(), EventType.BASE_SUBSTITUTION);
-        read.setReadBases(convertReadBases());
-        read.setMappingQuality((int) Math.ceil(mappingQuality / basesCountsQuals.size()));
-        read.setReadGroup(readGroupRecord);
-        read.setReducedReadCountsTag(convertBaseCounts());
-
-        if (hasIndelQualities) {
-            read.setBaseQualities(convertInsertionQualities(), EventType.BASE_INSERTION);
-            read.setBaseQualities(convertDeletionQualities(), EventType.BASE_DELETION);
-        }
-
-        return read;
-    }
-
-    /**
-     * Checks if the synthetic read is composed exclusively of deletions
-     *
-     * @return true if it is, false if it isn't.
-     */
-    private boolean isAllDeletions() {
-        for (SingleBaseInfo b : basesCountsQuals)
-            if (b.baseIndexOrdinal != BaseIndex.D.getOrdinalByte())
-                return false;
-        return true;
-    }
-
-    public int size () {
-        return basesCountsQuals.size();
-    }
-
-    private byte [] convertBaseQualities() {
-        return convertVariableGivenBases(new SingleBaseInfoIterator() {
-                public Byte next() {
-                    return it.next().qual;
-                }
-            });
-    }
-
-    private byte [] convertInsertionQualities() {
-        return convertVariableGivenBases(new SingleBaseInfoIterator() {
-                public Byte next() {
-                    return it.next().insertionQual;
-                }
-            });
-    }
-
-    private byte [] convertDeletionQualities() {
-        return convertVariableGivenBases(new SingleBaseInfoIterator() {
-                public Byte next() {
-                    return it.next().deletionQual;
-                }
-            });
-    }
-
-    protected int[] convertBaseCounts() {
-        int[] variableArray = new int[getReadLengthWithNoDeletions()];
-        int i = 0;
-        for (final SingleBaseInfo singleBaseInfo : basesCountsQuals) {
-            if (singleBaseInfo.baseIndexOrdinal != BaseIndex.D.getOrdinalByte())
-                variableArray[i++] = singleBaseInfo.count;
-        }
-        return variableArray;
-    }
-
-    private byte [] convertReadBases() {
-        byte [] readArray = new byte[getReadLengthWithNoDeletions()];
-        int i = 0;
-        for (final SingleBaseInfo singleBaseInfo : basesCountsQuals) {
-            final BaseIndex baseIndex = BaseIndexByOrdinal[singleBaseInfo.baseIndexOrdinal];
-            if (baseIndex != BaseIndex.D)
-                readArray[i++] = baseIndex.getByte();
-        }
-        
-        return readArray;
-    }
-
-    /**
-     * Builds the cigar string for the synthetic read
-     *
-     * Warning: if the synthetic read has leading deletions, it will shift the refStart (alignment start) of the read.
-     *
-     * @return the cigar string for the synthetic read
-     */
-    private Cigar buildCigar() {
-        ObjectArrayList<CigarElement> cigarElements = new ObjectArrayList<CigarElement>();
-        CigarOperator cigarOperator = null;
-        int length = 0;
-        for (final SingleBaseInfo singleBaseInfo : basesCountsQuals) {
-            final BaseIndex b = BaseIndexByOrdinal[singleBaseInfo.baseIndexOrdinal];
-            CigarOperator op;
-            switch (b) {
-                case D:
-                    op = CigarOperator.DELETION;
-                    break;
-                case I:
-                    throw new ReviewedStingException("Trying to create an insertion in a synthetic read. This operation is currently unsupported.");
-                default:
-                    op = CigarOperator.MATCH_OR_MISMATCH;
-                    break;
-            }
-            if (cigarOperator == null) {
-                if (op == CigarOperator.D)                                  // read cannot start with a deletion
-                    refStart++;                                             // if it does, we need to move the reference start forward
-                else
-                    cigarOperator = op;
-            }
-            else if (cigarOperator != op) {                                 // if this is a new operator, we need to close the previous one
-                cigarElements.add(new CigarElement(length, cigarOperator)); // close previous operator
-                cigarOperator = op;
-                length = 0;
-            }
-
-            if (cigarOperator != null)                                      // only increment the length of the cigar element if we really added it to the read (no leading deletions)
-                length++;
-        }
-        if (length > 0 && cigarOperator != CigarOperator.D)                 // read cannot end with a deletion
-            cigarElements.add(new CigarElement(length, cigarOperator));     // add the last cigar element
-
-        return new Cigar(cigarElements);
-    }
-
-    /**
-     * Shared functionality for all conversion utilities
-     *
-     * @param variableIterator the list to convert
-     * @return a converted variable given the bases and skipping deletions
-     */
-
-    private byte [] convertVariableGivenBases (Iterator<Byte> variableIterator) {
-        byte [] variableArray = new byte[getReadLengthWithNoDeletions()];
-        int i = 0;
-        for (final SingleBaseInfo singleBaseInfo : basesCountsQuals) {
-            byte count = variableIterator.next();
-            if (singleBaseInfo.baseIndexOrdinal != BaseIndex.D.getOrdinalByte())
-                variableArray[i++] = count;
-        }
-        return variableArray;
-    }
-
-    /**
-     * Shared functionality for all conversion utilities
-     *
-     * @return the length of the read with no deletions
-     */
-    private int getReadLengthWithNoDeletions() {
-        int readLength = basesCountsQuals.size();
-        for (final SingleBaseInfo singleBaseInfo : basesCountsQuals)
-            if (singleBaseInfo.baseIndexOrdinal == BaseIndex.D.getOrdinalByte())
-                readLength--;
-        return readLength;
-    }
-
-
-}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/DiploidSNPGenotypeLikelihoods.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/DiploidSNPGenotypeLikelihoods.java
index f3b26f295..77c51f88b 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/DiploidSNPGenotypeLikelihoods.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/DiploidSNPGenotypeLikelihoods.java
@@ -187,18 +187,6 @@ public class DiploidSNPGenotypeLikelihoods implements Cloneable {
         if ( qual == 0 )
             return 0;
 
-        if ( elt.getRead().isReducedRead() ) {
-            // reduced read representation
-            if ( BaseUtils.isRegularBase( obsBase )) {
-                int representativeCount = elt.getRepresentativeCount();
-                add(obsBase, qual, (byte)0, (byte)0, representativeCount); // fast calculation of n identical likelihoods
-                return representativeCount; // we added nObs bases here
-            }
-
-            // odd bases or deletions => don't use them
-            return 0;
-        }
-
         return add(obsBase, qual, (byte)0, (byte)0, 1);
     }
 
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/ErrorModel.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/ErrorModel.java
index 7ce736b0c..a57502bc0 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/ErrorModel.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/ErrorModel.java
@@ -140,11 +140,10 @@ public class ErrorModel  {
             Allele refAllele = refSampleVC.getReference();
 
             if ( refSampleVC.isIndel()) {
-                final int readCounts[] = new int[refSamplePileup.getNumberOfElements()];
                 //perReadLikelihoods = new double[readCounts.length][refSampleVC.getAlleles().size()];
                 final int eventLength = IndelGenotypeLikelihoodsCalculationModel.getEventLength(refSampleVC.getAlleles());
                 if (!haplotypeMap.isEmpty())
-                    perReadLikelihoods = pairModel.computeGeneralReadHaplotypeLikelihoods(refSamplePileup,haplotypeMap,refContext, eventLength, perReadAlleleLikelihoodMap, readCounts);
+                    perReadLikelihoods = pairModel.computeGeneralReadHaplotypeLikelihoods(refSamplePileup,haplotypeMap,refContext, eventLength, perReadAlleleLikelihoodMap);
             }
             int idx = 0;
             for (PileupElement refPileupElement : refSamplePileup) {
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/GeneralPloidyIndelGenotypeLikelihoods.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/GeneralPloidyIndelGenotypeLikelihoods.java
index 2f2a93fa4..530ba3ef8 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/GeneralPloidyIndelGenotypeLikelihoods.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/GeneralPloidyIndelGenotypeLikelihoods.java
@@ -193,8 +193,7 @@ public class GeneralPloidyIndelGenotypeLikelihoods extends GeneralPloidyGenotype
 
         if (!hasReferenceSampleData) {
  
-            final int readCounts[] = new int[pileup.getNumberOfElements()];
-            readHaplotypeLikelihoods = pairModel.computeGeneralReadHaplotypeLikelihoods(pileup, haplotypeMap, refContext, eventLength, perReadAlleleLikelihoodMap, readCounts);
+            readHaplotypeLikelihoods = pairModel.computeGeneralReadHaplotypeLikelihoods(pileup, haplotypeMap, refContext, eventLength, perReadAlleleLikelihoodMap);
             n = readHaplotypeLikelihoods.length;
         } else {
             Allele refAllele = null;
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/GenotypeLikelihoodsCalculationModel.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/GenotypeLikelihoodsCalculationModel.java
index f48ae81cf..95d3fb78b 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/GenotypeLikelihoodsCalculationModel.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/GenotypeLikelihoodsCalculationModel.java
@@ -132,7 +132,7 @@ public abstract class GenotypeLikelihoodsCalculationModel implements Cloneable {
         int count = 0;
         for ( PileupElement p : pileup ) {
             if ( BaseUtils.isRegularBase( p.getBase() ) )
-                count += p.getRepresentativeCount();
+                count++;
         }
 
         return count;
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/IndelGenotypeLikelihoodsCalculationModel.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/IndelGenotypeLikelihoodsCalculationModel.java
index 4a3231b3e..ae2ea427b 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/IndelGenotypeLikelihoodsCalculationModel.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/IndelGenotypeLikelihoodsCalculationModel.java
@@ -253,7 +253,7 @@ public class IndelGenotypeLikelihoodsCalculationModel extends GenotypeLikelihood
         int count = 0;
         for (PileupElement p : pileup) {
             if (p.isDeletion() || BaseUtils.isRegularBase(p.getBase()))
-                count += p.getRepresentativeCount();
+                count++;
         }
 
         return count;
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/UnifiedGenotyperEngine.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/UnifiedGenotyperEngine.java
index aa334f680..c5070a76f 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/UnifiedGenotyperEngine.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/genotyper/UnifiedGenotyperEngine.java
@@ -608,7 +608,7 @@ public class UnifiedGenotyperEngine {
                 int numDeletions = 0;
                 for ( final PileupElement p : rawContext.getBasePileup() ) {
                     if ( p.isDeletion() )
-                        numDeletions += p.getRepresentativeCount();
+                        numDeletions++;
                 }
                 if ( ((double) numDeletions) / ((double) rawContext.getBasePileup().depthOfCoverage()) > UAC.MAX_DELETION_FRACTION ) {
                     return null;
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/PairHMMLikelihoodCalculationEngine.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/PairHMMLikelihoodCalculationEngine.java
index b1db23d74..55a1c5dba 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/PairHMMLikelihoodCalculationEngine.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/PairHMMLikelihoodCalculationEngine.java
@@ -59,7 +59,6 @@ import org.broadinstitute.sting.utils.pairhmm.*;
 import org.broadinstitute.sting.utils.recalibration.covariates.RepeatCovariate;
 import org.broadinstitute.sting.utils.recalibration.covariates.RepeatLengthCovariate;
 import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
-import org.broadinstitute.sting.utils.sam.ReadUtils;
 import org.broadinstitute.variant.variantcontext.*;
 
 import java.io.File;
@@ -419,8 +418,7 @@ public class PairHMMLikelihoodCalculationEngine implements LikelihoodCalculation
                     for( final Map.Entry<GATKSAMRecord, Map<Allele,Double>> entry : stratifiedReadMap.get(sample).getLikelihoodReadMap().entrySet() ) {
                         // Compute log10(10^x1/2 + 10^x2/2) = log10(10^x1+10^x2)-log10(2)
                         // First term is approximated by Jacobian log with table lookup.
-                        haplotypeLikelihood += ReadUtils.getMeanRepresentativeReadCount( entry.getKey() ) *
-                                ( MathUtils.approximateLog10SumLog10(entry.getValue().get(iii_allele), entry.getValue().get(jjj_allele)) + MathUtils.LOG_ONE_HALF );
+                        haplotypeLikelihood += ( MathUtils.approximateLog10SumLog10(entry.getValue().get(iii_allele), entry.getValue().get(jjj_allele)) + MathUtils.LOG_ONE_HALF );
                     }
                 }
                 haplotypeLikelihoodMatrix[iii][jjj] = haplotypeLikelihood;
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/ReadErrorCorrector.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/ReadErrorCorrector.java
index e1471ab33..a48ac9ee0 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/ReadErrorCorrector.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/ReadErrorCorrector.java
@@ -233,10 +233,6 @@ public class ReadErrorCorrector {
      */
     @Requires("inputRead != null")
     private GATKSAMRecord correctRead(final GATKSAMRecord inputRead) {
-        // no support for reduced reads (which shouldn't need to be error-corrected anyway!)
-        if (inputRead.isReducedRead())
-            return inputRead;
-
         // do actual correction
         boolean corrected = false;
         final byte[] correctedBases = inputRead.getReadBases();
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/ReferenceConfidenceModel.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/ReferenceConfidenceModel.java
index 7f7e65817..5ef310498 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/ReferenceConfidenceModel.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/ReferenceConfidenceModel.java
@@ -297,13 +297,13 @@ public class ReferenceConfidenceModel {
                     if( hqSoftClips != null && p.isNextToSoftClip() ) {
                         hqSoftClips.add(AlignmentUtils.calcNumHighQualitySoftClips(p.getRead(), (byte) 28));
                     }
-                    result.AD_Ref_Any[1] += p.getRepresentativeCount();
+                    result.AD_Ref_Any[1]++;
                 } else {
-                    result.AD_Ref_Any[0] += p.getRepresentativeCount();
+                    result.AD_Ref_Any[0]++;
                 }
-                result.genotypeLikelihoods[AA] += p.getRepresentativeCount() * QualityUtils.qualToProbLog10(qual);
-                result.genotypeLikelihoods[AB] += p.getRepresentativeCount() * MathUtils.approximateLog10SumLog10( QualityUtils.qualToProbLog10(qual) + MathUtils.LOG_ONE_HALF, QualityUtils.qualToErrorProbLog10(qual) + MathUtils.LOG_ONE_THIRD + MathUtils.LOG_ONE_HALF );
-                result.genotypeLikelihoods[BB] += p.getRepresentativeCount() * QualityUtils.qualToErrorProbLog10(qual) + MathUtils.LOG_ONE_THIRD;
+                result.genotypeLikelihoods[AA] += QualityUtils.qualToProbLog10(qual);
+                result.genotypeLikelihoods[AB] += MathUtils.approximateLog10SumLog10( QualityUtils.qualToProbLog10(qual) + MathUtils.LOG_ONE_HALF, QualityUtils.qualToErrorProbLog10(qual) + MathUtils.LOG_ONE_THIRD + MathUtils.LOG_ONE_HALF );
+                result.genotypeLikelihoods[BB] += QualityUtils.qualToErrorProbLog10(qual) + MathUtils.LOG_ONE_THIRD;
             }
         }
 
@@ -484,7 +484,7 @@ public class ReferenceConfidenceModel {
 
             // todo -- this code really should handle CIGARs directly instead of relying on the above tests
             if ( isReadInformativeAboutIndelsOfSize(read.getReadBases(), read.getBaseQualities(), offset, ref, pileupOffsetIntoRef, maxIndelSize) ) {
-                nInformative += p.getRepresentativeCount();
+                nInformative++;
                 if( nInformative > MAX_N_INDEL_INFORMATIVE_READS ) {
                     return MAX_N_INDEL_INFORMATIVE_READS;
                 }
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/HaplotypeGraph.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/HaplotypeGraph.java
index 55ff2f978..6574e8295 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/HaplotypeGraph.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/HaplotypeGraph.java
@@ -239,14 +239,14 @@ public class HaplotypeGraph extends ReadThreadingGraph {
         super(kmerSize);
         referenceHaplotype = findReferenceHaplotypeOrFail(haplotypes);
         this.haplotypes = new LinkedHashSet<>(haplotypes);
-        addSequence("anonymous", referenceHaplotype.getBases(), null, true);
+        addSequence("anonymous", referenceHaplotype.getBases(), true);
         for (final Haplotype h : haplotypes) {
             if (h.isReference())
                 continue;
             if (h.length() < kmerSize) {
                 Utils.warnUser(logger, "haplotype shorter than kmerSize " + h.length() + " < " + kmerSize + " will be dropped");
             } else
-                addSequence("anonymous", h.getBases(), null, false);
+                addSequence("anonymous", h.getBases(), false);
 
         }
         buildGraphIfNecessary();
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssembler.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssembler.java
index f33a4883f..e158ef613 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssembler.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssembler.java
@@ -151,14 +151,12 @@ public class ReadThreadingAssembler extends LocalAssemblyEngine {
         final ReadThreadingGraph rtgraph = new ReadThreadingGraph(kmerSize, debugGraphTransformations, minBaseQualityToUseInAssembly, numPruningSamples);
 
         // add the reference sequence to the graph
-        rtgraph.addSequence("ref", refHaplotype.getBases(), null, true);
+        rtgraph.addSequence("ref", refHaplotype.getBases(), true);
 
         // add the artificial GGA haplotypes to the graph
         int hapCount = 0;
         for ( final Haplotype h : activeAlleleHaplotypes ) {
-            final int[] counts = new int[h.length()];
-            Arrays.fill(counts, GGA_MODE_ARTIFICIAL_COUNTS);
-            rtgraph.addSequence("activeAllele" + hapCount++, h.getBases(), counts, false);
+            rtgraph.addSequence("activeAllele" + hapCount++, h.getBases(), GGA_MODE_ARTIFICIAL_COUNTS, false);
         }
 
         // Next pull kmers out of every read and throw them on the graph
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraph.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraph.java
index dc057294e..7fdfa4301 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraph.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraph.java
@@ -199,16 +199,25 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
      * @param isRef is this the reference sequence?
      */
     protected void addSequence(final byte[] sequence, final boolean isRef) {
-        addSequence("anonymous", sequence, null, isRef);
+        addSequence("anonymous", sequence, isRef);
     }
 
     /**
      * Add all bases in sequence to this graph
      *
-     * @see #addSequence(String, String, byte[], int, int, int[], boolean) for full information
+     * @see #addSequence(String, String, byte[], int, int, int, boolean) for full information
      */
-    public void addSequence(final String seqName, final byte[] sequence, final int[] counts, final boolean isRef) {
-        addSequence(seqName, ANONYMOUS_SAMPLE, sequence, 0, sequence.length, counts, isRef);
+    public void addSequence(final String seqName, final byte[] sequence, final boolean isRef) {
+        addSequence(seqName, sequence, 1, isRef);
+    }
+
+    /**
+     * Add all bases in sequence to this graph
+     *
+     * @see #addSequence(String, String, byte[], int, int, int, boolean) for full information
+     */
+    public void addSequence(final String seqName, final byte[] sequence, final int count, final boolean isRef) {
+        addSequence(seqName, ANONYMOUS_SAMPLE, sequence, 0, sequence.length, count, isRef);
     }
 
     /**
@@ -216,14 +225,12 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
      *
      * @param seqName a useful seqName for this read, for debugging purposes
      * @param sequence non-null sequence of bases
-     * @param counts a vector of counts for each bases, indicating how many times that base was observed in the sequence.
-     *               This allows us to support reduced reads in the ReadThreadingAssembler.  Can be null, meaning that
-     *               each base is only observed once.  If not null, must have length == sequence.length.
      * @param start the first base offset in sequence that we should use for constructing the graph using this sequence, inclusive
      * @param stop the last base offset in sequence that we should use for constructing the graph using this sequence, exclusive
+     * @param count the representative count of this sequence (to use as the weight)
      * @param isRef is this the reference sequence.
      */
-    public void addSequence(final String seqName, final String sampleName, final byte[] sequence, final int start, final int stop, final int[] counts, final boolean isRef) {
+    public void addSequence(final String seqName, final String sampleName, final byte[] sequence, final int start, final int stop, final int count, final boolean isRef) {
         // note that argument testing is taken care of in SequenceForKmers
         if ( alreadyBuilt ) throw new IllegalStateException("Graph already built");
 
@@ -235,18 +242,7 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
         }
 
         // add the new sequence to the list of sequences for sample
-        sampleSequences.add(new SequenceForKmers(seqName, sequence, start, stop, counts, isRef));
-    }
-
-    /**
-     * Return a count appropriate for a kmer starting at kmerStart in sequence for kmers
-     *
-     * @param seqForKmers a non-null sequence for kmers object
-     * @param kmerStart the position where the kmer starts in sequence
-     * @return a count for a kmer from start -> start + kmerSize in seqForKmers
-     */
-    private int getCountGivenKmerStart(final SequenceForKmers seqForKmers, final int kmerStart) {
-        return seqForKmers.getCount(kmerStart + kmerSize - 1);
+        sampleSequences.add(new SequenceForKmers(seqName, sequence, start, stop, count, isRef));
     }
 
     /**
@@ -276,9 +272,7 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
         // loop over all of the bases in sequence, extending the graph by one base at each point, as appropriate
         MultiDeBruijnVertex vertex = startingVertex;
         for ( int i = uniqueStartPos + 1; i <= seqForKmers.stop - kmerSize; i++ ) {
-            final int count = getCountGivenKmerStart(seqForKmers, i);
-
-            vertex = extendChainByOne(vertex, seqForKmers.sequence, i, count, seqForKmers.isRef);
+            vertex = extendChainByOne(vertex, seqForKmers.sequence, i, seqForKmers.count, seqForKmers.isRef);
             if ( debugGraphTransformations ) vertex.addRead(seqForKmers.name);
         }
     }
@@ -683,7 +677,7 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
 //            logger.warn(String.format("Increasing counts for %s -> %s via %s at %d with suffix %s vs. %s",
 //                    prev, vertex, edge, offset, (char)suffix, (char)seqBase));
             if ( suffix == seqBase && (increaseCountsThroughBranches || inDegreeOf(vertex) == 1) ) {
-                edge.incMultiplicity(seqForKmers.getCount(offset));
+                edge.incMultiplicity(seqForKmers.count);
                 increaseCountsInMatchedKmers(seqForKmers, prev, originalKmer, offset-1);
             }
         }
@@ -780,7 +774,7 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
      * @param prevVertex a non-null vertex where sequence was last anchored in the graph
      * @param sequence the sequence we're threading through the graph
      * @param kmerStart the start of the current kmer in graph we'd like to add
-     * @param count the number of observations of this kmer in graph (can be > 1 for reduced reads)
+     * @param count the number of observations of this kmer in graph (can be > 1 for GGA)
      * @param isRef is this the reference sequence?
      * @return a non-null vertex connecting prevVertex to in the graph based on sequence
      */
@@ -819,7 +813,6 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
     protected void addRead(final GATKSAMRecord read) {
         final byte[] sequence = read.getReadBases();
         final byte[] qualities = read.getBaseQualities();
-        final int[] reducedReadCounts = read.getReducedReadCounts();  // will be null if read is not reduced
 
         int lastGood = -1; // the index of the last good base we've seen
         for( int end = 0; end <= sequence.length; end++ ) {
@@ -832,7 +825,7 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
                 if ( start != -1 && len >= kmerSize ) {
                     // if the sequence is long enough to get some value out of, add it to the graph
                     final String name = read.getReadName() + "_" + start + "_" + end;
-                    addSequence(name, read.getReadGroup().getSample(), read.getReadBases(), start, end, reducedReadCounts, false);
+                    addSequence(name, read.getReadGroup().getSample(), read.getReadBases(), start, end, 1, false);
                 }
 
                 lastGood = -1; // reset the last good base
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/SequenceForKmers.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/SequenceForKmers.java
index a4bc0c1c8..e55772657 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/SequenceForKmers.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/SequenceForKmers.java
@@ -58,36 +58,23 @@ final class SequenceForKmers {
     final String name;
     final byte[] sequence;
     final int start, stop;
-    final private int[] counts;
+    final int count;
     final boolean isRef;
 
     /**
      * Create a new sequence for creating kmers
      */
-    SequenceForKmers(final String name, byte[] sequence, int start, int stop, int[] counts, boolean ref) {
+    SequenceForKmers(final String name, byte[] sequence, int start, int stop, int count, boolean ref) {
         if ( start < 0 ) throw new IllegalArgumentException("Invalid start " + start);
         if ( stop < start ) throw new IllegalArgumentException("Invalid stop " + stop);
         if ( sequence == null ) throw new IllegalArgumentException("Sequence is null ");
-        if ( counts != null && counts.length != sequence.length ) throw new IllegalArgumentException("Sequence and counts don't have the same length " + sequence.length + " vs " + counts.length);
+        if ( count < 1 ) throw new IllegalArgumentException("Invalid count " + count);
 
         this.name = name;
         this.sequence = sequence;
         this.start = start;
         this.stop = stop;
+        this.count = count;
         this.isRef = ref;
-        this.counts = counts;
-    }
-
-    /**
-     * Get the number of observations of the kmer starting at i in this sequence
-     *
-     * Can we > 1 because sequence may be a reduced read and therefore count as N observations
-     *
-     * @param i the offset into sequence for the start of the kmer
-     * @return a count >= 1 that indicates the number of observations of kmer starting at i in this sequence.
-     */
-    public int getCount(final int i) {
-        if ( i < 0 || i > sequence.length ) throw new ArrayIndexOutOfBoundsException("i must be >= 0 and <= " + sequence.length + " but got " + i);
-        return counts == null ? 1 : counts[i];
     }
 }
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/indels/PairHMMIndelErrorModel.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/indels/PairHMMIndelErrorModel.java
index 318779cd2..aa8b46312 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/indels/PairHMMIndelErrorModel.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/indels/PairHMMIndelErrorModel.java
@@ -261,10 +261,9 @@ public class PairHMMIndelErrorModel {
                                                                         final double downsamplingFraction) {
         final int numHaplotypes = haplotypeMap.size();
 
-        final int readCounts[] = new int[pileup.getNumberOfElements()];
-        final double[][] readLikelihoods = computeGeneralReadHaplotypeLikelihoods(pileup, haplotypeMap, ref, eventLength, perReadAlleleLikelihoodMap, readCounts);
+        final double[][] readLikelihoods = computeGeneralReadHaplotypeLikelihoods(pileup, haplotypeMap, ref, eventLength, perReadAlleleLikelihoodMap);
         perReadAlleleLikelihoodMap.performPerAlleleDownsampling(downsamplingFraction);
-        return getDiploidHaplotypeLikelihoods(numHaplotypes, readCounts, readLikelihoods);
+        return getDiploidHaplotypeLikelihoods(numHaplotypes, readLikelihoods);
         
     }
 
@@ -295,16 +294,13 @@ public class PairHMMIndelErrorModel {
                                                                           final LinkedHashMap<Allele, Haplotype> haplotypeMap, 
                                                                           final ReferenceContext ref,
                                                                           final int eventLength, 
-                                                                          final PerReadAlleleLikelihoodMap perReadAlleleLikelihoodMap,
-                                                                          final int[] readCounts) {
+                                                                          final PerReadAlleleLikelihoodMap perReadAlleleLikelihoodMap) {
         final double readLikelihoods[][] = new double[pileup.getNumberOfElements()][haplotypeMap.size()];
 
         final LinkedList<GATKSAMRecord> readList = new LinkedList<>();
         final Map<GATKSAMRecord, byte[]> readGCPArrayMap = new LinkedHashMap<>();
         int readIdx=0;
         for (PileupElement p: pileup) {
-            // > 1 when the read is a consensus read representing multiple independent observations
-            readCounts[readIdx] = p.getRepresentativeCount();
 
             // check if we've already computed likelihoods for this pileup element (i.e. for this read at this location)
             if (perReadAlleleLikelihoodMap.containsPileupElement(p)) {
@@ -499,7 +495,7 @@ public class PairHMMIndelErrorModel {
 //        return b1.length;
 //    }
 
-    private static double[] getDiploidHaplotypeLikelihoods(final int numHaplotypes, final int readCounts[], final double readLikelihoods[][]) {
+    private static double[] getDiploidHaplotypeLikelihoods(final int numHaplotypes, final double readLikelihoods[][]) {
         final double[][] haplotypeLikehoodMatrix = new double[numHaplotypes][numHaplotypes];
 
         // todo: MAD 09/26/11 -- I'm almost certain this calculation can be simplified to just a single loop without the intermediate NxN matrix
@@ -515,8 +511,7 @@ public class PairHMMIndelErrorModel {
                         continue;
                     final double li = readLikelihoods[readIdx][i];
                     final double lj = readLikelihoods[readIdx][j];
-                    final int readCount = readCounts[readIdx];
-                    haplotypeLikehoodMatrix[i][j] += readCount * (MathUtils.approximateLog10SumLog10(li, lj) + MathUtils.LOG_ONE_HALF);
+                    haplotypeLikehoodMatrix[i][j] += MathUtils.approximateLog10SumLog10(li, lj) + MathUtils.LOG_ONE_HALF;
                 }
             }
         }
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/qc/AssessReducedCoverage.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/qc/AssessReducedCoverage.java
deleted file mode 100644
index 2f8295008..000000000
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/qc/AssessReducedCoverage.java
+++ /dev/null
@@ -1,175 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.qc;
-
-import org.broadinstitute.sting.commandline.Argument;
-import org.broadinstitute.sting.commandline.Hidden;
-import org.broadinstitute.sting.commandline.Output;
-import org.broadinstitute.sting.gatk.CommandLineGATK;
-import org.broadinstitute.sting.gatk.contexts.AlignmentContext;
-import org.broadinstitute.sting.gatk.contexts.ReferenceContext;
-import org.broadinstitute.sting.gatk.filters.*;
-import org.broadinstitute.sting.gatk.refdata.RefMetaDataTracker;
-import org.broadinstitute.sting.gatk.walkers.LocusWalker;
-import org.broadinstitute.sting.gatk.walkers.ReadFilters;
-import org.broadinstitute.sting.gatk.walkers.TreeReducible;
-import org.broadinstitute.sting.utils.GenomeLoc;
-import org.broadinstitute.sting.utils.help.DocumentedGATKFeature;
-import org.broadinstitute.sting.utils.pileup.PileupElement;
-import org.broadinstitute.sting.utils.pileup.ReadBackedPileup;
-
-import java.io.PrintStream;
-import java.util.HashSet;
-import java.util.Set;
-
-/**
- * Emits intervals present in either the original or reduced bam but not the other.
- *
- * <h3>Input</h3>
- * <p>
- * The original and reduced BAM files.
- * </p>
- *
- * <h3>Output</h3>
- * <p>
- * A list of intervals present in one bam but not the other.
- * </p>
- *
- * <h3>Examples</h3>
- * <pre>
- * java -Xmx2g -jar GenomeAnalysisTK.jar \
- *   -I:original original.bam \
- *   -I:reduced reduced.bam \
- *   -R ref.fasta \
- *   -T AssessReducedCoverage \
- *   -o output.intervals
- * </pre>
- *
- * @author ebanks
- */
-@DocumentedGATKFeature( groupName = "Quality Control and Simple Analysis Tools", extraDocs = {CommandLineGATK.class} )
-@ReadFilters({UnmappedReadFilter.class, NotPrimaryAlignmentFilter.class, DuplicateReadFilter.class, FailsVendorQualityCheckFilter.class, BadCigarFilter.class})
-@Hidden
-public class AssessReducedCoverage extends LocusWalker<GenomeLoc, GenomeLoc> implements TreeReducible<GenomeLoc> {
-
-    private static final String original = "original";
-    private static final String reduced = "reduced";
-
-    @Output
-    protected PrintStream out;
-
-    @Override
-    public boolean includeReadsWithDeletionAtLoci() { return true; }
-
-    @Argument(fullName = "output_reduced_only_coverage", shortName = "output_reduced_only_coverage", doc = "Output an interval if the reduced bam has coverage where the original does not", required = false)
-    public boolean OUTPUT_REDUCED_ONLY_INTERVALS = false;
-
-    public void initialize() {}
-
-    public GenomeLoc map(RefMetaDataTracker tracker, ReferenceContext ref, AlignmentContext context) {
-
-        if ( tracker == null )
-            return null;
-
-        final Set<String> tags = getAllTags(context.getBasePileup());
-        return (tags.contains(original) && !tags.contains(reduced)) ||
-                (OUTPUT_REDUCED_ONLY_INTERVALS && tags.contains(reduced) && !tags.contains(original)) ? ref.getLocus() : null;
-    }
-
-    private Set<String> getAllTags(final ReadBackedPileup pileup) {
-
-        final Set<String> tags = new HashSet<String>(10);
-
-        for ( final PileupElement p : pileup ) {
-            if ( (int)p.getQual() > 2 && p.getMappingQual() > 0 && !p.isDeletion() )
-                tags.addAll(getToolkit().getReaderIDForRead(p.getRead()).getTags().getPositionalTags());
-        }
-
-        return tags;
-    }
-
-    public void onTraversalDone(GenomeLoc sum) {
-        if ( sum != null )
-            out.println(sum);
-    }
-
-    public GenomeLoc reduceInit() {
-        return null;
-    }
-
-    public GenomeLoc treeReduce(GenomeLoc lhs, GenomeLoc rhs) {
-        if ( lhs == null )
-            return rhs;
-
-        if ( rhs == null )
-            return lhs;
-
-        // if contiguous, just merge them
-        if ( lhs.contiguousP(rhs) )
-            return getToolkit().getGenomeLocParser().createGenomeLoc(lhs.getContig(), lhs.getStart(), rhs.getStop());
-
-        // otherwise, print the lhs and start over with the rhs
-        out.println(lhs);
-        return rhs;
-    }
-
-    public GenomeLoc reduce(GenomeLoc value, GenomeLoc sum) {
-        if ( value == null )
-            return sum;
-
-        if ( sum == null )
-            return value;
-
-        // if contiguous, just merge them
-        if ( sum.contiguousP(value) )
-            return getToolkit().getGenomeLocParser().createGenomeLoc(sum.getContig(), sum.getStart(), value.getStop());
-
-        // otherwise, print the sum and start over with the value
-        out.println(sum);
-        return value;
-    }
-}
\ No newline at end of file
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/qc/AssessReducedQuals.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/qc/AssessReducedQuals.java
deleted file mode 100644
index 25f6f874d..000000000
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/qc/AssessReducedQuals.java
+++ /dev/null
@@ -1,208 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.qc;
-
-import org.broadinstitute.sting.commandline.Argument;
-import org.broadinstitute.sting.commandline.Hidden;
-import org.broadinstitute.sting.commandline.Output;
-import org.broadinstitute.sting.gatk.contexts.AlignmentContext;
-import org.broadinstitute.sting.gatk.contexts.ReferenceContext;
-import org.broadinstitute.sting.gatk.refdata.RefMetaDataTracker;
-import org.broadinstitute.sting.gatk.walkers.LocusWalker;
-import org.broadinstitute.sting.gatk.walkers.TreeReducible;
-import org.broadinstitute.sting.utils.GenomeLoc;
-import org.broadinstitute.sting.utils.MathUtils;
-import org.broadinstitute.sting.utils.exceptions.UserException;
-import org.broadinstitute.sting.utils.pileup.PileupElement;
-import org.broadinstitute.sting.utils.pileup.ReadBackedPileup;
-
-import java.io.PrintStream;
-import java.util.List;
-
-/**
- * Emits intervals in which the differences between the original and reduced bam quals are bigger epsilon (unless the quals of
- * the reduced bam are above sufficient threshold)
- *
- * <h3>Input</h3>
- * <p>
- * The original and reduced BAM files.
- * </p>
- *
- * <h3>Output</h3>
- * <p>
- * A list of intervals in which the differences between the original and reduced bam quals are bigger epsilon.
- * </p>
- *
- * <h3>Examples</h3>
- * <pre>
- * java -Xmx2g -jar GenomeAnalysisTK.jar \
- *   -I:original original.bam \
- *   -I:reduced reduced.bam \
- *   -R ref.fasta \
- *   -T AssessReducedQuals \
- *   -o output.intervals
- * </pre>
- *
- * @author ami
- */
-@Hidden
-public class AssessReducedQuals extends LocusWalker<GenomeLoc, GenomeLoc> implements TreeReducible<GenomeLoc> {
-
-    private static final String reduced = "reduced";
-    private static final int originalQualsIndex = 0;
-    private static final int reducedQualsIndex = 1;
-
-    @Argument(fullName = "sufficientQualSum", shortName = "sufficientQualSum", doc = "When a reduced bam qual sum is above this threshold, it passes even without comparing to the non-reduced bam ", required = false)
-    public int sufficientQualSum = 600;
-
-    @Argument(fullName = "qual_epsilon", shortName = "epsilon", doc = "when |Quals_reduced_bam - Quals_original_bam| > (epsilon * Quals_original_bam) we output this interval", required = false)
-    public double qual_epsilon = 0.10;
-
-    @Argument(fullName = "exclude_low_mq", shortName = "excludeMQ", doc = "ignore reads with mapping quality below this number", required = false)
-    public int excludeMQ = 0;
-
-    @Output
-    protected PrintStream out;
-
-    public void initialize() {
-        if ( qual_epsilon < 0.0 || qual_epsilon > 1.0 )
-            throw new UserException.BadArgumentValue("qual_epsilon", "must be a number between 0 and 1");
-    }
-
-    @Override
-    public boolean includeReadsWithDeletionAtLoci() { return true; }
-
-    @Override
-    public GenomeLoc map(RefMetaDataTracker tracker, ReferenceContext ref, AlignmentContext context) {
-        if ( tracker == null )
-            return null;
-
-        boolean reportLocus;
-        final int[] quals = getPileupQuals(context.getBasePileup());
-        final int epsilon = MathUtils.fastRound(quals[originalQualsIndex] * qual_epsilon);
-        final int calcOriginalQuals = Math.min(quals[originalQualsIndex], sufficientQualSum);
-        final int calcReducedQuals = Math.min(quals[reducedQualsIndex], sufficientQualSum);
-        final int originalReducedQualDiff = calcOriginalQuals - calcReducedQuals;
-        reportLocus = originalReducedQualDiff > epsilon || originalReducedQualDiff < -1 * epsilon;
-
-        return reportLocus ? ref.getLocus() : null;
-    }
-
-    /**
-     * Get the quals separated by version and strand
-     * @param readPileup the pileup
-     * @return 2x2 array with sum of quals separated by version in 1st dimension and strand in the 2nd
-     */
-    private int[] getPileupQuals(final ReadBackedPileup readPileup) {
-
-        final int[] quals = new int[2];
-
-        for ( final PileupElement p : readPileup ) {
-            final List<String> tags = getToolkit().getReaderIDForRead(p.getRead()).getTags().getPositionalTags();
-            if ( isGoodRead(p) ) {
-                final int tempQual = (int)(p.getQual()) * p.getRepresentativeCount();
-                final int tagIndex = getTagIndex(tags);
-                quals[tagIndex] += tempQual;
-            }
-        }
-
-        return quals;
-    }
-
-    private boolean isGoodRead(final PileupElement p) {
-        return !p.isDeletion() && (int)p.getQual() >= 15 && p.getMappingQual() >= excludeMQ;
-    }
-
-    private int getTagIndex(final List<String> tags) {
-        return tags.contains(reduced) ? 1 : 0;
-    }
-
-    @Override
-    public void onTraversalDone(GenomeLoc sum) {
-        if ( sum != null )
-            out.println(sum);
-    }
-
-    @Override
-    public GenomeLoc treeReduce(GenomeLoc lhs, GenomeLoc rhs) {
-        if ( lhs == null )
-            return rhs;
-
-        if ( rhs == null )
-            return lhs;
-
-        // if contiguous, just merge them
-        if ( lhs.contiguousP(rhs) )
-            return getToolkit().getGenomeLocParser().createGenomeLoc(lhs.getContig(), lhs.getStart(), rhs.getStop());
-
-        // otherwise, print the lhs and start over with the rhs
-        out.println(lhs);
-        return rhs;
-    }
-
-    @Override
-    public GenomeLoc reduceInit() {
-        return null;
-    }
-
-    @Override
-    public GenomeLoc reduce(GenomeLoc value, GenomeLoc sum) {
-        if ( value == null )
-            return sum;
-
-        if ( sum == null )
-            return value;
-
-        // if contiguous, just merge them
-        if ( sum.contiguousP(value) )
-            return getToolkit().getGenomeLocParser().createGenomeLoc(sum.getContig(), sum.getStart(), value.getStop());
-
-        // otherwise, print the sum and start over with the value
-        out.println(sum);
-        return value;
-    }
-}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/recalibration/RecalUtils.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/recalibration/RecalUtils.java
index 56f7e8257..325237d05 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/recalibration/RecalUtils.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/recalibration/RecalUtils.java
@@ -48,12 +48,10 @@ package org.broadinstitute.sting.utils.recalibration;
 
 import com.google.java.contract.Ensures;
 import com.google.java.contract.Requires;
-import net.sf.samtools.SAMFileHeader;
 import org.apache.log4j.Logger;
 import org.broadinstitute.sting.gatk.report.GATKReport;
 import org.broadinstitute.sting.gatk.report.GATKReportTable;
 import org.broadinstitute.sting.gatk.walkers.bqsr.RecalibrationArgumentCollection;
-import org.broadinstitute.sting.gatk.walkers.compression.reducereads.ReduceReads;
 import org.broadinstitute.sting.utils.classloader.JVMUtils;
 import org.broadinstitute.sting.utils.recalibration.covariates.*;
 import org.broadinstitute.sting.utils.BaseUtils;
@@ -1063,20 +1061,4 @@ public class RecalUtils {
     private static RecalDatum createDatumObject(final byte reportedQual, final double isError) {
         return new RecalDatum(1, isError, reportedQual);
     }
-
-    /**
-     * Checks for invalid BAMs that are being used with BQSR and fails with a UserException if it finds one
-     *
-     * @param headers                  sam file headers being passed into the GATK engine
-     * @param allowBqsrOnReducedBams   should we allow BQSR on reduced bams?
-     */
-    public static void checkForInvalidRecalBams(final List<SAMFileHeader> headers, final boolean allowBqsrOnReducedBams) {
-        // for now, the only check we make is against reduced bams
-        if ( !allowBqsrOnReducedBams ) {
-            for ( final SAMFileHeader header : headers ) {
-                if ( header.getProgramRecord(ReduceReads.PROGRAM_RECORD_NAME) != null )
-                    throw new UserException.BadInput("base quality score recalibration should absolutely not be run on reduced BAM files!  Please run ReduceReads only after BQSR has been performed");
-            }
-        }
-    }
 }
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/annotator/RankSumUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/annotator/RankSumUnitTest.java
index fec83e1a8..b1c280748 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/annotator/RankSumUnitTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/annotator/RankSumUnitTest.java
@@ -46,8 +46,6 @@
 
 package org.broadinstitute.sting.gatk.walkers.annotator;
 
-import org.broadinstitute.sting.gatk.walkers.compression.reducereads.*;
-import org.broadinstitute.sting.gatk.walkers.compression.reducereads.BaseCounts;
 import org.broadinstitute.sting.utils.MannWhitneyU;
 import org.testng.Assert;
 import org.testng.annotations.BeforeClass;
@@ -122,13 +120,15 @@ public class RankSumUnitTest {
 
         final List<Integer> dist2 = new ArrayList<>(distribution2);
         if ( numToReduceIn2 > 0 ) {
-            final org.broadinstitute.sting.gatk.walkers.compression.reducereads.BaseCounts counts = new BaseCounts();
+            int counts = 0;
+            int quals = 0;
+
             for ( int i = 0; i < numToReduceIn2; i++ ) {
-                final int value = dist2.remove(0);
-                counts.incr(BaseIndex.A, (byte)value, 0, false);
+                counts++;
+                quals += dist2.remove(0);
             }
 
-            final int qual = (int)counts.averageQualsOfBase(BaseIndex.A);
+            final int qual = quals / counts;
             for ( int i = 0; i < numToReduceIn2; i++ )
                 dist2.add(qual);
         }
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/BaseCountsUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/BaseCountsUnitTest.java
deleted file mode 100644
index f988471a0..000000000
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/BaseCountsUnitTest.java
+++ /dev/null
@@ -1,201 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.compression.reducereads;
-
-
-import org.broadinstitute.sting.BaseTest;
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
-import java.util.ArrayList;
-import java.util.Arrays;
-import java.util.List;
-
-/**
- * Basic unit test for BaseCounts in reduced reads
- */
-public class BaseCountsUnitTest extends BaseTest {
-
-    private class BaseCountsTest {
-        public String bases;
-        public byte mostCountBase;
-        public int mostCommonCount;
-
-        private BaseCountsTest(String bases, char mostCountBase, int mostCommonCount) {
-            this.mostCommonCount = mostCommonCount;
-            this.mostCountBase = (byte)mostCountBase;
-            this.bases = bases;
-        }
-    }
-
-    @DataProvider(name = "counting")
-    public Object[][] createCountingData() {
-        List<BaseCountsTest> params = new ArrayList<BaseCountsTest>();
-
-        params.add(new BaseCountsTest("A", 'A', 1 ));
-        params.add(new BaseCountsTest("AA", 'A', 2 ));
-        params.add(new BaseCountsTest("AC", 'A', 1 ));
-        params.add(new BaseCountsTest("AAC", 'A', 2 ));
-        params.add(new BaseCountsTest("AAA", 'A', 3 ));
-        params.add(new BaseCountsTest("AAAN", 'A', 3 ));
-        params.add(new BaseCountsTest("AAANNNN", 'N', 4 ));
-        params.add(new BaseCountsTest("AACTG", 'A', 2 ));
-        params.add(new BaseCountsTest("D", 'D', 1 ));
-        params.add(new BaseCountsTest("DDAAD", 'D', 3));
-        params.add(new BaseCountsTest("", (char)BaseCounts.MAX_BASE_WITH_NO_COUNTS, 0 ));
-        params.add(new BaseCountsTest("AAIIIAI", 'I', 4 ));
-
-        List<Object[]> params2 = new ArrayList<Object[]>();
-        for ( BaseCountsTest x : params ) params2.add(new Object[]{x});
-        return params2.toArray(new Object[][]{});
-    }
-
-    @Test(dataProvider = "counting", enabled = true)
-    public void testCounting(BaseCountsTest params) {
-        BaseCounts counts = new BaseCounts();
-
-        for ( byte base : params.bases.getBytes() )
-            counts.incr(base);
-
-        String name = String.format("Test-%s", params.bases);
-        Assert.assertEquals(counts.totalCount(), params.bases.length(), name);
-        Assert.assertEquals(counts.countOfBase(counts.baseIndexWithMostCounts()), params.mostCommonCount, name);
-        Assert.assertEquals((char)counts.baseWithMostCounts(), (char)params.mostCountBase, name);
-
-        // test the static creation
-        final int[] countsArray = new int[] { counts.countOfBase(BaseIndex.A), counts.countOfBase(BaseIndex.C),
-                counts.countOfBase(BaseIndex.G), counts.countOfBase(BaseIndex.T)};
-        final BaseCounts countsFromArray = BaseCounts.createWithCounts(countsArray);
-        Assert.assertEquals(counts.countOfBase(BaseIndex.A), countsFromArray.countOfBase(BaseIndex.A));
-        Assert.assertEquals(counts.countOfBase(BaseIndex.C), countsFromArray.countOfBase(BaseIndex.C));
-        Assert.assertEquals(counts.countOfBase(BaseIndex.G), countsFromArray.countOfBase(BaseIndex.G));
-        Assert.assertEquals(counts.countOfBase(BaseIndex.T), countsFromArray.countOfBase(BaseIndex.T));
-        Assert.assertEquals(ACGTcounts(counts), countsFromArray.totalCount());
-
-        // test addition
-        counts.add(countsFromArray);
-        Assert.assertEquals(counts.countOfBase(BaseIndex.A), 2 * countsFromArray.countOfBase(BaseIndex.A));
-        Assert.assertEquals(counts.countOfBase(BaseIndex.C), 2 * countsFromArray.countOfBase(BaseIndex.C));
-        Assert.assertEquals(counts.countOfBase(BaseIndex.G), 2 * countsFromArray.countOfBase(BaseIndex.G));
-        Assert.assertEquals(counts.countOfBase(BaseIndex.T), 2 * countsFromArray.countOfBase(BaseIndex.T));
-        Assert.assertEquals(ACGTcounts(counts), 2 * countsFromArray.totalCount());
-
-        // test subtraction
-        counts.sub(countsFromArray);
-        Assert.assertEquals(counts.countOfBase(BaseIndex.A), countsFromArray.countOfBase(BaseIndex.A));
-        Assert.assertEquals(counts.countOfBase(BaseIndex.C), countsFromArray.countOfBase(BaseIndex.C));
-        Assert.assertEquals(counts.countOfBase(BaseIndex.G), countsFromArray.countOfBase(BaseIndex.G));
-        Assert.assertEquals(counts.countOfBase(BaseIndex.T), countsFromArray.countOfBase(BaseIndex.T));
-        Assert.assertEquals(ACGTcounts(counts), countsFromArray.totalCount());
-
-        // test decrementing
-        if ( counts.countOfBase(BaseIndex.A) > 0 ) {
-            counts.decr((byte)'A');
-            Assert.assertEquals(counts.countOfBase(BaseIndex.A), countsFromArray.countOfBase(BaseIndex.A) - 1);
-        }
-    }
-
-    private static int ACGTcounts(final BaseCounts baseCounts) {
-        return baseCounts.totalCountWithoutIndels() - baseCounts.countOfBase(BaseIndex.N);
-    }
-
-
-    //////////////////////////////////
-    // TEST FOR QUALS IN BASECOUNTS //
-    //////////////////////////////////
-
-    private class BaseCountsQualsTest {
-        public final List<Integer> quals;
-
-        private BaseCountsQualsTest(final List<Integer> quals) {
-            this.quals = quals;
-        }
-    }
-
-    @DataProvider(name = "quals")
-    public Object[][] createQualsData() {
-        List<Object[]> tests = new ArrayList<Object[]>();
-
-        final int[] quals = new int[]{ 0, 5, 10, 15, 20, 30, 40, 50 };
-
-        for ( final int qual1 : quals ) {
-            for ( final int qual2 : quals ) {
-                for ( final int qual3 : quals ) {
-                    tests.add(new Object[]{new BaseCountsQualsTest(Arrays.asList(qual1, qual2, qual3))});
-                }
-            }
-        }
-
-        return tests.toArray(new Object[][]{});
-    }
-
-    @Test(dataProvider = "quals", enabled = true)
-    public void testQuals(BaseCountsQualsTest test) {
-        BaseCounts counts = new BaseCounts();
-
-        for ( int qual : test.quals )
-            counts.incr(BaseIndex.A, (byte)qual, 20, false);
-
-        final int actualSum = (int)counts.getSumQuals((byte)'A');
-        final int expectedSum = qualSum(test.quals);
-        Assert.assertEquals(actualSum, expectedSum);
-
-        final int actualAverage = (int)counts.averageQuals((byte)'A');
-        Assert.assertEquals(actualAverage, expectedSum / test.quals.size());
-
-        // test both proportion methods
-        Assert.assertEquals(counts.baseCountProportion(BaseIndex.A), counts.baseCountProportion((byte)'A'));
-    }
-
-    private static int qualSum(final List<Integer> quals) {
-        int sum = 0;
-        for ( final int qual : quals )
-            sum += qual;
-        return sum;
-    }
-}
\ No newline at end of file
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/HeaderElementUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/HeaderElementUnitTest.java
deleted file mode 100644
index 4f5b7477c..000000000
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/HeaderElementUnitTest.java
+++ /dev/null
@@ -1,214 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.compression.reducereads;
-
-
-import org.broadinstitute.sting.BaseTest;
-import org.broadinstitute.sting.utils.MathUtils;
-import org.testng.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
-import java.util.ArrayList;
-import java.util.List;
-
-public class HeaderElementUnitTest extends BaseTest {
-
-    private class HETest {
-        public byte base, baseQual, insQual, delQual;
-        public int MQ;
-        public boolean isClip;
-
-        private HETest(final byte base, final byte baseQual, final byte insQual, final byte delQual, final int MQ, final boolean isClip) {
-            this.base = base;
-            this.baseQual = baseQual;
-            this.insQual = insQual;
-            this.delQual = delQual;
-            this.MQ = MQ;
-            this.isClip = isClip;
-        }
-    }
-
-    private static final byte byteA = (byte)'A';
-    private static final byte byte10 = (byte)10;
-    private static final byte byte20 = (byte)20;
-    private static final int minBaseQual = 20;
-    private static final int minMappingQual = 20;
-
-    @DataProvider(name = "data")
-    public Object[][] createData() {
-        List<Object[]> tests = new ArrayList<Object[]>();
-
-        tests.add(new Object[]{new HETest(byteA, byte20, byte20, byte20, 20, false)});
-        tests.add(new Object[]{new HETest(byteA, byte10, byte20, byte20, 20, false)});
-        tests.add(new Object[]{new HETest(byteA, byte20, byte20, byte20, 10, false)});
-        tests.add(new Object[]{new HETest(byteA, byte20, byte20, byte20, 20, true)});
-
-        return tests.toArray(new Object[][]{});
-    }
-
-    @Test(dataProvider = "data", enabled = true)
-    public void testHE(HETest test) {
-
-        HeaderElement headerElement = new HeaderElement(1000, 0);
-
-        // first test that if we add and then remove it, we have no data
-        headerElement.addBase(test.base, test.baseQual, test.insQual, test.delQual, test.MQ, minBaseQual, minMappingQual, test.isClip, false);
-        headerElement.addInsertionToTheRight();
-        headerElement.removeBase(test.base, test.baseQual, test.insQual, test.delQual, test.MQ, minBaseQual, minMappingQual, test.isClip, false);
-        headerElement.removeInsertionToTheRight();
-        testHeaderIsEmpty(headerElement);
-
-        // now, test that the data was added as expected
-        for ( int i = 0; i < 10; i++ )
-            headerElement.addBase(test.base, test.baseQual, test.insQual, test.delQual, test.MQ, minBaseQual, minMappingQual, test.isClip, false);
-        testHeaderData(headerElement, test);
-
-        // test the insertion adding functionality
-        for ( int i = 0; i < 10; i++ )
-            headerElement.addInsertionToTheRight();
-        Assert.assertEquals(headerElement.numInsertionsToTheRight(), 10);
-    }
-
-    private void testHeaderIsEmpty(final HeaderElement headerElement) {
-        Assert.assertFalse(headerElement.hasConsensusData(SlidingWindow.ConsensusType.POSITIVE_CONSENSUS));
-        Assert.assertFalse(headerElement.hasConsensusData(SlidingWindow.ConsensusType.FILTERED));
-        Assert.assertFalse(headerElement.hasInsertionToTheRight());
-        Assert.assertTrue(headerElement.isEmpty());
-    }
-
-    private void testHeaderData(final HeaderElement headerElement, final HETest test) {
-        Assert.assertEquals(headerElement.isVariantFromSoftClips(), test.isClip);
-        Assert.assertFalse(headerElement.isEmpty());
-        Assert.assertFalse(headerElement.hasInsertionToTheRight());
-        Assert.assertEquals(headerElement.hasConsensusData(SlidingWindow.ConsensusType.POSITIVE_CONSENSUS), test.MQ >= minMappingQual);
-        Assert.assertEquals(headerElement.hasConsensusData(SlidingWindow.ConsensusType.FILTERED), test.MQ < minMappingQual);
-        Assert.assertEquals(headerElement.getBaseCounts(headerElement.hasConsensusData(SlidingWindow.ConsensusType.POSITIVE_CONSENSUS) ? SlidingWindow.ConsensusType.POSITIVE_CONSENSUS : SlidingWindow.ConsensusType.FILTERED).getRMS(), (double)test.MQ);
-        Assert.assertFalse(headerElement.isVariantFromMismatches(0.05, 0.05));
-        Assert.assertEquals(headerElement.isVariant(0.05, 0.05, 0.05), test.isClip);
-    }
-
-
-    private class AllelesTest {
-        public final int[] counts;
-        public final double pvalue;
-
-        private AllelesTest(final int[] counts, final double pvalue) {
-            this.counts = counts;
-            this.pvalue = pvalue;
-        }
-    }
-
-    @DataProvider(name = "alleles")
-    public Object[][] createAllelesData() {
-        List<Object[]> tests = new ArrayList<>();
-
-        final int[] counts = new int[]{ 0, 5, 10, 15, 20 };
-        final double [] pvalues = new double[]{ 0.0, 0.01, 0.05, 0.20, 1.0 };
-
-        for ( final int countA : counts ) {
-            for ( final int countC : counts ) {
-                for ( final int countG : counts ) {
-                    for ( final int countT : counts ) {
-                        for ( final int countD : counts ) {
-                            for ( final double pvalue : pvalues ) {
-                                tests.add(new Object[]{new AllelesTest(new int[]{countA, countC, countG, countT, countD}, pvalue)});
-                            }
-                        }
-                    }
-                }
-            }
-        }
-
-        return tests.toArray(new Object[][]{});
-    }
-
-    @Test(dataProvider = "alleles", enabled = true)
-    public void testAlleles(AllelesTest test) {
-
-        HeaderElement headerElement = new HeaderElement(1000, 0);
-        for ( int i = 0; i < test.counts.length; i++ ) {
-            final BaseIndex base = BaseIndex.values()[i];
-            for ( int j = 0; j < test.counts[i]; j++ )
-                headerElement.addBase(base.b, byte20, byte10, byte10, byte20, minBaseQual, minMappingQual, false, false);
-        }
-
-        final int nAllelesSeen = headerElement.getNumberOfBaseAlleles(test.pvalue, test.pvalue);
-        final int nAllelesExpected = calculateExpectedAlleles(test.counts, test.pvalue);
-
-        Assert.assertEquals(nAllelesSeen, nAllelesExpected);
-    }
-
-    private static int calculateExpectedAlleles(final int[] counts, final double targetPvalue) {
-        int total = 0;
-        for ( final int count : counts ) {
-            total += count;
-        }
-
-        int result = 0;
-        for ( int index = 0; index < counts.length; index++ ) {
-            final int count = counts[index];
-            if ( count == 0 )
-                continue;
-
-            final boolean isSignificant;
-            if ( count <= HeaderElement.MIN_COUNT_FOR_USING_PVALUE ) {
-                isSignificant = MathUtils.binomialCumulativeProbability(total, 0, count) > targetPvalue;
-            } else {
-                isSignificant = (count >= targetPvalue * total);
-            }
-
-            if ( isSignificant ) {
-                if ( index == BaseIndex.D.index )
-                    return -1;
-                result++;
-            }
-        }
-
-        return result;
-    }
-}
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/ReduceReadsIntegrationTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/ReduceReadsIntegrationTest.java
deleted file mode 100644
index 067f36d58..000000000
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/ReduceReadsIntegrationTest.java
+++ /dev/null
@@ -1,347 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.compression.reducereads;
-
-import net.sf.samtools.SAMFileReader;
-import net.sf.samtools.SAMRecord;
-import org.broadinstitute.sting.WalkerTest;
-import org.broadinstitute.sting.utils.collections.Pair;
-import org.broadinstitute.sting.utils.exceptions.UserException;
-import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
-import org.broadinstitute.sting.utils.sam.GATKSamRecordFactory;
-import org.testng.Assert;
-import org.testng.annotations.Test;
-
-import java.io.File;
-import java.util.Arrays;
-import java.util.Collections;
-import java.util.List;
-
-public class ReduceReadsIntegrationTest extends WalkerTest {
-    final static String REF = b37KGReference;
-    final static String DBSNP = b37dbSNP132;
-    final String BAM = validationDataLocation + "NA12878.HiSeq.b37.chr20.10_11mb.bam";
-    final String DELETION_BAM = validationDataLocation + "filtered_deletion_for_reduce_reads.bam";
-    final String STASH_BAM = validationDataLocation + "ReduceReadsStashBug.bam";
-    final String STASH_L = " -L 14:73718184-73718284 -L 14:73718294-73718330 -L 14:73718360-73718556";
-    final String DIVIDEBYZERO_BAM = validationDataLocation + "ReduceReadsDivideByZeroBug.bam";
-    final String DIVIDEBYZERO_L = " -L " + validationDataLocation + "ReduceReadsDivideByZeroBug.intervals";
-    final String L = " -L 20:10,100,000-10,120,000 ";
-    final String COREDUCTION_BAM_A = validationDataLocation + "coreduction.test.A.bam";
-    final String COREDUCTION_BAM_B = validationDataLocation + "coreduction.test.B.bam";
-    final String COREDUCTION_L = " -L 1:1,853,860-1,854,354 -L 1:1,884,131-1,892,057";
-    final String OFFCONTIG_BAM = privateTestDir + "readOffb37contigMT.bam";
-    final String HIGH_COVERAGE_BAM = privateTestDir + "NA20313.highCoverageRegion.bam";
-    final String HIGH_COVERAGE_L = " -L 1:1650830-1650870";
-    final String BOTH_ENDS_OF_PAIR_IN_VARIANT_REGION_BAM = privateTestDir + "bothEndsOfPairInVariantRegion.bam";
-    final String INSERTIONS_AT_EDGE_OF_CONSENSUS_BAM = privateTestDir + "rr-too-many-insertions.bam";
-
-    final static String emptyFileMd5 = "d41d8cd98f00b204e9800998ecf8427e";
-
-    protected Pair<List<File>, List<String>> executeTest(final String name, final WalkerTestSpec spec) {
-        return executeTest(name, spec, emptyFileMd5);
-    }
-
-    protected Pair<List<File>, List<String>> executeTest(final String name, final WalkerTestSpec spec, final String qualsTestMD5) {
-        final Pair<List<File>, List<String>> result = super.executeTest(name, spec);
-
-        // perform some Reduce Reads specific testing now
-        if ( result != null ) {
-
-            // generate a new command-line based on the old one
-            spec.disableImplicitArgs();
-            final String[] originalArgs = spec.getArgsWithImplicitArgs().split(" ");
-
-            final StringBuilder reducedInputs = new StringBuilder();
-            for ( final File file : result.getFirst() ) {
-                reducedInputs.append(" -I:reduced ");
-                reducedInputs.append(file.getAbsolutePath());
-            }
-
-            // the coverage test is a less stricter version of the quals test so we can safely ignore it for now
-            //final String coverageCommand = createCommandLine("AssessReducedCoverage", originalArgs);
-            //super.executeTest(name + " : COVERAGE_TEST", new WalkerTestSpec(coverageCommand + reducedInputs.toString(), Arrays.asList(emptyFileMd5)));
-
-            // run the quals test
-            final String qualsCommand = createCommandLine("AssessReducedQuals", originalArgs);
-            super.executeTest(name + " : QUALS_TEST", new WalkerTestSpec(qualsCommand + reducedInputs.toString(), Arrays.asList(qualsTestMD5)));
-        }
-
-        return result;
-    }
-
-    /*
-     * Generate a new command-line based on the old one
-     *
-     * @param walkerName    the new walker name to use
-     * @param originalArgs  the original arguments used for the test
-     * @return the new command line
-     */
-    private String createCommandLine(final String walkerName, final String[] originalArgs) {
-
-        final StringBuilder newArgs = new StringBuilder();
-
-        for ( int i = 0; i < originalArgs.length; i++ ) {
-            final String arg = originalArgs[i];
-
-            if ( arg.equals("-T") ) {
-                newArgs.append("-T ");
-                newArgs.append(walkerName);
-            } else if ( arg.startsWith("-I") ) {
-                newArgs.append("-I:original ");
-                newArgs.append(originalArgs[++i]);
-            } else if ( arg.equals("-R") || arg.equals("-L") ) {
-                newArgs.append(arg);
-                newArgs.append(" ");
-                newArgs.append(originalArgs[++i]);
-            }
-
-            // always add a trailing space
-            newArgs.append(" ");
-        }
-
-        newArgs.append("-o %s");
-
-        return newArgs.toString();
-    }
-
-    protected Pair<List<File>, List<String>> executeTestWithoutAdditionalRRTests(final String name, final WalkerTestSpec spec) {
-        return super.executeTest(name, spec);
-    }
-
-    private void RRTest(final String testName, final String args, final String md5, final boolean useKnowns) {
-        this.RRTest(testName, args, md5, useKnowns, emptyFileMd5);
-    }
-
-    private void RRTest(final String testName, final String args, final String md5, final boolean useKnowns, final String qualsTestMD5) {
-        String base = String.format("-T ReduceReads -npt -R %s -I %s ", REF, BAM) + " -o %s" + (useKnowns ? " -known " + DBSNP : "") + " ";
-        WalkerTestSpec spec = new WalkerTestSpec(base + args, Arrays.asList("bam"), Arrays.asList(md5));
-        executeTest(testName, spec, qualsTestMD5);
-    }
-
-        @Test(enabled = true)
-    public void testDefaultCompression() {
-        RRTest("testDefaultCompression ", L, "0e503f7b79ace4c89d74f0943a0de1c0", false);
-    }
-
-    @Test(enabled = true)
-    public void testDefaultCompressionWithKnowns() {
-        RRTest("testDefaultCompressionWithKnowns ", L, "6db7ce2733d006f8bd61c42a40d23728", true);
-    }
-
-    private final String intervals = "-L 20:10,100,000-10,100,500 -L 20:10,200,000-10,200,500 -L 20:10,300,000-10,300,500 -L 20:10,400,000-10,500,000 -L 20:10,500,050-10,500,060 -L 20:10,600,000-10,600,015 -L 20:10,700,000-10,700,110";
-
-    @Test(enabled = true)
-    public void testMultipleIntervals() {
-        RRTest("testMultipleIntervals ", intervals, "207f2c6d3db956e19412a45a231ca367", false, "043b2838c27d8f9580379b54c18ff40a");
-    }
-
-    @Test(enabled = true)
-    public void testMultipleIntervalsWithKnowns() {
-        RRTest("testMultipleIntervalsWithKnowns ", intervals, "f3b11a8a7673b301e27137936fafc6b6", true, "043b2838c27d8f9580379b54c18ff40a");
-    }
-
-    @Test(enabled = true)
-    public void testHighCompression() {
-        RRTest("testHighCompression ", " -cs 10 -min_pvalue 0.3 -minvar 0.3 -mindel 0.3 " + L, "dcc3716b3665aa1c2dbe6b22d6534aef", false);
-    }
-
-    @Test(enabled = true)
-    public void testHighCompressionWithKnowns() {
-        RRTest("testHighCompressionWithKnowns ", " -cs 10 -min_pvalue 0.3 -minvar 0.3 -mindel 0.3 " + L, "97ae655bf0e483ea227b1aac67ced024", true);
-    }
-
-    @Test(enabled = true)
-    public void testLowCompression() {
-        RRTest("testLowCompression ", " -cs 30 -min_pvalue 0.001 -minvar 0.01 -mindel 0.01 -minmap 5 -minqual 5 " + L, "a1377eb922e0b09a03a280b691b0b3ff", false);
-    }
-
-    @Test(enabled = true)
-    public void testLowCompressionWithKnowns() {
-        RRTest("testLowCompressionWithKnowns ", " -cs 30 -min_pvalue 0.001 -minvar 0.01 -mindel 0.01 -minmap 5 -minqual 5 " + L, "bd7c5b0b210694f364ca6a41f5b89870", true);
-    }
-
-    @Test(enabled = true)
-    public void testBadPvalueInput() {
-        final String cmd = String.format("-T ReduceReads -npt -R %s -I %s ", REF, BAM) + "-o %s -min_pvalue -0.01";
-        WalkerTestSpec spec = new WalkerTestSpec(cmd, 1, UserException.BadArgumentValue.class);
-        executeTest("testBadPvalueInput", spec);
-    }
-
-    @Test(enabled = true)
-    public void testIndelCompression() {
-        final String md5 = "9c9305eda5e4e7f22246ec8a4b242c97";
-        RRTest("testIndelCompression ", " -cs 50 -L 20:10,100,500-10,100,600 ", md5, false);
-        RRTest("testIndelCompressionWithKnowns ", " -cs 50 -L 20:10,100,500-10,100,600 ", md5, true);
-    }
-
-    @Test(enabled = true)
-    public void testFilteredDeletionCompression() {
-        String base = String.format("-T ReduceReads -npt -R %s -I %s ", REF, DELETION_BAM) + " -o %s ";
-        executeTest("testFilteredDeletionCompression", new WalkerTestSpec(base, Arrays.asList("bam"), Arrays.asList("1bda512143be1016dfaca1f7020b6398")), "4f916da29d91852077f0a2fdbdd2c7f6");
-    }
-
-    @Test(enabled = true)
-    public void testCoReduction() {
-        String base = String.format("-T ReduceReads %s --cancer_mode -npt -R %s -I %s -I %s", COREDUCTION_L, REF, COREDUCTION_BAM_A, COREDUCTION_BAM_B) + " -o %s ";
-        executeTest("testCoReduction", new WalkerTestSpec(base, Arrays.asList("bam"), Arrays.asList("58c2bae5a339af2ea3c22a46ce8faa68")));
-    }
-
-    @Test(enabled = true)
-    public void testCoReductionWithKnowns() {
-        String base = String.format("-T ReduceReads %s --cancer_mode -npt -R %s -I %s -I %s -known %s", COREDUCTION_L, REF, COREDUCTION_BAM_A, COREDUCTION_BAM_B, DBSNP) + " -o %s ";
-        executeTest("testCoReductionWithKnowns", new WalkerTestSpec(base, Arrays.asList("bam"), Arrays.asList("5c251932b49d99a810581e3a6f762878")));
-    }
-
-    @Test(enabled = true)
-    public void testInsertionsAtEdgeOfConsensus() {
-        String base = String.format("-T ReduceReads -npt -R %s -I %s ", REF, INSERTIONS_AT_EDGE_OF_CONSENSUS_BAM) + " -o %s ";
-        executeTest("testInsertionsAtEdgeOfConsensus", new WalkerTestSpec(base, Arrays.asList("bam"), Arrays.asList("c10653a8c21fb32b5cf580d3704b0edd")));
-    }
-
-    /**
-     * Bug reported by Adam where a read that got clipped before actually belongs 2 intervals ahead
-     * and a subsequent tail leaves only this read in the stash. The next read to come in is in fact 
-     * before (alignment start) than this read, so the TreeSet breaks with a Key out of Range error
-     * that was freaking hard to catch. 
-     * 
-     * This bam is simplified to replicate the exact bug with the three provided intervals.
-     */
-    @Test(enabled = true)
-    public void testAddingReadAfterTailingTheStash() {
-        String base = String.format("-T ReduceReads %s -npt -R %s -I %s", STASH_L, REF, STASH_BAM) + " -o %s ";
-        executeTest("testAddingReadAfterTailingTheStash", new WalkerTestSpec(base, Arrays.asList("bam"), Arrays.asList("fddbec29d0945afbbb34b42994614c15")), "3eab32c215ba68e75efd5ab7e9f7a2e7");
-    }
-
-    /**
-     * Divide by zero bug reported by GdA and users in the forum. Happens when the downsampler goes over a region where all reads get
-     * filtered out.
-     */
-    @Test(enabled = true)
-    public void testDivideByZero() {
-        String base = String.format("-T ReduceReads %s -npt -R %s -I %s", DIVIDEBYZERO_L, REF, DIVIDEBYZERO_BAM) + " -o %s ";
-        // we expect to lose coverage due to the downsampling so don't run the systematic tests
-        executeTestWithoutAdditionalRRTests("testDivideByZero", new WalkerTestSpec(base, Arrays.asList("bam"), Arrays.asList("7dfe2647992ce1154db340fc742d523a")));
-    }
-
-    /**
-     * Bug happens when reads are soft-clipped off the contig (usually in the MT). This test guarantees no changes to the upstream code will
-     * break the current hard-clipping routine that protects reduce reads from such reads.
-     */
-    @Test(enabled = true)
-    public void testReadOffContig() {
-        String base = String.format("-T ReduceReads -npt -R %s -I %s ", REF, OFFCONTIG_BAM) + " -o %s ";
-        executeTest("testReadOffContig", new WalkerTestSpec(base, Arrays.asList("bam"), Arrays.asList("595e5812c37189930cae93e45765def4")));
-    }
-
-    /**
-     * Confirm that if both ends of pair are in same variant region, compressed names of both ends of pair are the same.
-     */
-    @Test(enabled = true)
-    public void testPairedReadsInVariantRegion() {
-        String base = String.format("-T ReduceReads -npt -R %s -I %s ", hg19Reference, BOTH_ENDS_OF_PAIR_IN_VARIANT_REGION_BAM) +
-                " -o %s  --downsample_coverage 250 -dcov 50  ";
-        executeTest("testPairedReadsInVariantRegion", new WalkerTestSpec(base, Arrays.asList("bam"), Arrays.asList("b005727119eee27995705959a637085e")), "2af063d1bd3c322b03405dbb3ecf59a9");
-    }
-
-    /**
-     * Confirm that this bam does not fail when multi-sample mode is enabled.  The provided example is tricky and used to cause
-     * us to exception out in the code.
-     */
-    @Test(enabled = true)
-    public void testMultiSampleDoesNotFailWithFlag() {
-        String cmd = "-T ReduceReads --cancer_mode -npt -R " + b37KGReference + " -I " + privateTestDir + "rr_multisample.bam -o /dev/null";
-        executeTestWithoutAdditionalRRTests("testMultiSampleDoesNotFailWithFlag", new WalkerTestSpec(cmd, 0, Collections.<String>emptyList()));
-    }
-
-    /**
-     * Confirm that this bam fails when multi-sample mode is not enabled
-     */
-    @Test(enabled = true)
-    public void testMultiSampleFailsWithoutFlag() {
-        String cmd = "-T ReduceReads -npt -R " + b37KGReference + " -I " + privateTestDir + "rr_multisample.bam -o /dev/null";
-        executeTestWithoutAdditionalRRTests("testMultiSampleDoesNotFailWithFlag", new WalkerTestSpec(cmd, 0, UserException.BadInput.class));
-    }
-
-    /**
-     * Confirm that compression is not capping coverage counts to max byte
-     */
-    @Test(enabled = true)
-    public void testCompressionWorksForHighDepth() {
-        final String base = String.format("-T ReduceReads -npt -R %s -I %s %s", b37KGReference, HIGH_COVERAGE_BAM, HIGH_COVERAGE_L) + " -o %s";
-        final File outputBam = executeTestWithoutAdditionalRRTests("testCompressionWorksForHighDepth",
-                new WalkerTestSpec(base, 1, Arrays.asList(""))).first.get(0);   // No MD5s; we only want to check the coverage
-
-        boolean sawHighCoveragePosition = false;
-        final SAMFileReader reader = new SAMFileReader(outputBam);
-        reader.setSAMRecordFactory(new GATKSamRecordFactory());
-
-        for ( final SAMRecord rawRead : reader ) {
-            final GATKSAMRecord read = (GATKSAMRecord)rawRead;
-            read.setAttribute(GATKSAMRecord.REDUCED_READ_CONSENSUS_TAG, rawRead.getByteArrayAttribute(GATKSAMRecord.REDUCED_READ_CONSENSUS_TAG));
-
-            if ( ! read.isReducedRead() )
-                continue;
-
-            final int[] decodedCounts = read.getReducedReadCounts();
-            for ( final int count : decodedCounts ) {
-                if ( count > Byte.MAX_VALUE ) {
-                    sawHighCoveragePosition = true;
-                    break;
-                }
-            }
-
-            if ( sawHighCoveragePosition )
-                break;
-        }
-
-        reader.close();
-
-        Assert.assertTrue(sawHighCoveragePosition, "No positions were found with coverage over max byte (127); the coverage is incorrectly being capped somewhere!");
-    }
-}
-
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/ReduceReadsUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/ReduceReadsUnitTest.java
deleted file mode 100644
index 6032affa7..000000000
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/ReduceReadsUnitTest.java
+++ /dev/null
@@ -1,214 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.compression.reducereads;
-
-import it.unimi.dsi.fastutil.objects.*;
-import net.sf.samtools.SAMFileHeader;
-import org.broad.tribble.Feature;
-import org.broadinstitute.sting.BaseTest;
-import org.broadinstitute.sting.commandline.RodBinding;
-import org.broadinstitute.sting.gatk.GenomeAnalysisEngine;
-import org.broadinstitute.sting.gatk.refdata.RODRecordListImpl;
-import org.broadinstitute.sting.gatk.refdata.RefMetaDataTracker;
-import org.broadinstitute.sting.gatk.refdata.utils.GATKFeature;
-import org.broadinstitute.sting.gatk.refdata.utils.RODRecordList;
-import org.broadinstitute.sting.utils.GenomeLoc;
-import org.broadinstitute.sting.utils.GenomeLocParser;
-import org.broadinstitute.sting.utils.sam.ArtificialSAMUtils;
-import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
-import org.broadinstitute.variant.variantcontext.Allele;
-import org.broadinstitute.variant.variantcontext.VariantContext;
-import org.broadinstitute.variant.variantcontext.VariantContextBuilder;
-import org.testng.Assert;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
-import java.util.ArrayList;
-import java.util.Arrays;
-import java.util.List;
-import java.util.Random;
-
-
-public class ReduceReadsUnitTest extends BaseTest {
-
-    Random random = new Random(987743);
-    Object2LongOpenHashMap<String> hash = new Object2LongOpenHashMap<String>();
-    long nextNumber = 0L;
-
-    /**
-     * Combinatorial unit test data provider example.
-     *
-     * Creates data for testMyData test function, containing two arguments, start and size at each value
-     *
-     * @return Object[][] for testng DataProvider
-     */
-    @DataProvider(name = "ReadNameProvider")
-    public Object[][] readNameProvider() {
-        final int readNameLength = 4;
-        final int nReads = 100000;
-        final int charVariety = 20;
-        ObjectArrayList<Object[]> tests = new ObjectArrayList<Object[]>();
-        ObjectOpenHashSet<String> truthSet = new ObjectOpenHashSet<String>();
-        byte[] bytes = new byte[readNameLength];
-        for ( int i = 0; i<nReads; i++) {
-            random.nextBytes(bytes);
-            StringBuilder readNameBuilder = new StringBuilder(readNameLength);
-            for (byte b : bytes) {
-                readNameBuilder.append((char) ('a' + Math.abs(b) % charVariety));
-            }
-            String readName = readNameBuilder.toString();
-            tests.add(new Object[]{readName, truthSet.contains(readName)});
-            truthSet.add(readName);
-        }
-
-        return tests.toArray(new Object[][]{});
-    }
-
-    /**
-     * Test the read name compression functionality
-     */
-    @Test(dataProvider = "ReadNameProvider", enabled = false)
-    public void testReadNameCompression(final String name, final boolean alreadySeen) {
-        GATKSAMRecord read = GATKSAMRecord.createRandomRead(1);
-        read.setReadName(name);
-        final int previousHashSize = hash.keySet().size();
-        final long previousNumber = nextNumber;
-        nextNumber = ReduceReads.compressReadName(hash, read, nextNumber);
-        Assert.assertEquals(hash.keySet().size(), alreadySeen ? previousHashSize : previousHashSize + 1);
-        Assert.assertEquals(nextNumber, alreadySeen ? previousNumber : previousNumber + 1);
-        Assert.assertTrue(hash.containsKey(name));
-    }
-
-
-    /////////////////////////////////////////////////////////////////////////////
-    //// This section tests the functionality related to known SNP positions ////
-    /////////////////////////////////////////////////////////////////////////////
-
-    private static SAMFileHeader header;
-    private static GenomeLocParser genomeLocParser;
-
-    @BeforeClass
-    public void beforeClass() {
-        header = ArtificialSAMUtils.createArtificialSamHeader(3, 1, 100);
-        genomeLocParser = new GenomeLocParser(header.getSequenceDictionary());
-    }
-
-    @DataProvider(name = "PopulateKnownsProvider")
-    public Object[][] populateKnownsProvider() {
-
-        final Allele A = Allele.create("A", true);
-        final Allele C = Allele.create("C");
-        final Allele G = Allele.create("G");
-        final Allele AC = Allele.create("AC");
-
-        final VariantContext snp_1_10 = new VariantContextBuilder("known", "chr1", 10, 10, Arrays.asList(A, C)).make();
-        final VariantContext snp_1_10_2 = new VariantContextBuilder("known", "chr1", 10, 10, Arrays.asList(A, G)).make();
-        final VariantContext snp_1_20 = new VariantContextBuilder("known", "chr1", 20, 20, Arrays.asList(A, C)).make();
-        final VariantContext snp_1_30 = new VariantContextBuilder("known", "chr1", 30, 30, Arrays.asList(A, C)).make();
-        final VariantContext snp_2_10 = new VariantContextBuilder("known", "chr2", 10, 10, Arrays.asList(A, C)).make();
-        final VariantContext snp_3_10 = new VariantContextBuilder("known", "chr3", 10, 10, Arrays.asList(A, C)).make();
-        final VariantContext indel_1_40 = new VariantContextBuilder("known", "chr1", 40, 40, Arrays.asList(A, AC)).make();
-        final VariantContext indel_2_40 = new VariantContextBuilder("known", "chr2", 40, 40, Arrays.asList(A, AC)).make();
-
-        final GATKSAMRecord read1 = ArtificialSAMUtils.createArtificialRead(header, "foo1", 0, 1, 1);
-        final GATKSAMRecord read2 = ArtificialSAMUtils.createArtificialRead(header, "foo2", 1, 1, 1);
-        final GATKSAMRecord read3 = ArtificialSAMUtils.createArtificialRead(header, "foo3", 2, 1, 1);
-
-        final ObjectArrayList<Object[]> tests = new ObjectArrayList<Object[]>();
-
-        // test single
-        tests.add(new Object[]{1, 1, read1, Arrays.asList(makeRefMetaDataTracker(snp_1_10))});
-
-        // test multiple at one position
-        tests.add(new Object[]{1, 1, read1, Arrays.asList(makeRefMetaDataTracker(snp_1_10), makeRefMetaDataTracker(snp_1_10_2))});
-
-        // test multiple
-        tests.add(new Object[]{3, 3, read1, Arrays.asList(makeRefMetaDataTracker(snp_1_10), makeRefMetaDataTracker(snp_1_20), makeRefMetaDataTracker(snp_1_30))});
-
-        // test indel not used
-        tests.add(new Object[]{3, 3, read1, Arrays.asList(makeRefMetaDataTracker(snp_1_10), makeRefMetaDataTracker(snp_1_20), makeRefMetaDataTracker(snp_1_30), makeRefMetaDataTracker(indel_1_40))});
-        tests.add(new Object[]{3, 3, read1, Arrays.asList(makeRefMetaDataTracker(snp_1_10), makeRefMetaDataTracker(snp_1_20), makeRefMetaDataTracker(snp_1_30), makeRefMetaDataTracker(indel_2_40))});
-
-        // test read clears
-        tests.add(new Object[]{3, 0, read2, Arrays.asList(makeRefMetaDataTracker(snp_1_10), makeRefMetaDataTracker(snp_1_20), makeRefMetaDataTracker(snp_1_30))});
-        tests.add(new Object[]{4, 1, read2, Arrays.asList(makeRefMetaDataTracker(snp_1_10), makeRefMetaDataTracker(snp_1_20), makeRefMetaDataTracker(snp_1_30), makeRefMetaDataTracker(snp_2_10))});
-        tests.add(new Object[]{3, 0, read3, Arrays.asList(makeRefMetaDataTracker(snp_1_10), makeRefMetaDataTracker(snp_1_20), makeRefMetaDataTracker(snp_1_30))});
-        tests.add(new Object[]{4, 0, read3, Arrays.asList(makeRefMetaDataTracker(snp_1_10), makeRefMetaDataTracker(snp_1_20), makeRefMetaDataTracker(snp_1_30), makeRefMetaDataTracker(snp_2_10))});
-        tests.add(new Object[]{4, 1, read3, Arrays.asList(makeRefMetaDataTracker(snp_1_10), makeRefMetaDataTracker(snp_1_20), makeRefMetaDataTracker(snp_1_30), makeRefMetaDataTracker(snp_3_10))});
-        tests.add(new Object[]{5, 1, read3, Arrays.asList(makeRefMetaDataTracker(snp_1_10), makeRefMetaDataTracker(snp_1_20), makeRefMetaDataTracker(snp_1_30), makeRefMetaDataTracker(snp_2_10), makeRefMetaDataTracker(snp_3_10))});
-
-        return tests.toArray(new Object[][]{});
-    }
-
-    private final RefMetaDataTracker makeRefMetaDataTracker(final Feature feature) {
-        final List<GATKFeature> x = new ArrayList<GATKFeature>();
-        x.add(new GATKFeature.TribbleGATKFeature(genomeLocParser, feature, "known"));
-        final RODRecordList rods = new RODRecordListImpl("known", x, genomeLocParser.createGenomeLoc(feature.getChr(), feature.getStart(), feature.getEnd()));
-        return new RefMetaDataTracker(Arrays.asList(rods));
-    }
-
-    @Test(dataProvider = "PopulateKnownsProvider")
-    public void testPopulateKnowns(final int expectedSizeBeforeClear, final int expectedSizeAfterClear, final GATKSAMRecord read, final List<RefMetaDataTracker> trackers) {
-        final ReduceReads rr = new ReduceReads();
-        RodBinding.resetNameCounter();
-        rr.known = Arrays.<RodBinding<VariantContext>>asList(new RodBinding(VariantContext.class, "known"));
-        rr.knownSnpPositions = new ObjectAVLTreeSet<GenomeLoc>();
-
-        final GenomeAnalysisEngine engine = new GenomeAnalysisEngine();
-        engine.setGenomeLocParser(genomeLocParser);
-        rr.setToolkit(engine);
-
-        for ( final RefMetaDataTracker tracker : trackers )
-            rr.populateKnownSNPs(tracker);
-        Assert.assertEquals(rr.knownSnpPositions.size(), expectedSizeBeforeClear);
-
-        rr.clearStaleKnownPositions(read);
-        Assert.assertEquals(rr.knownSnpPositions.size(), expectedSizeAfterClear);
-    }
-
-}
\ No newline at end of file
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/SlidingWindowUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/SlidingWindowUnitTest.java
deleted file mode 100644
index c49a671e2..000000000
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/compression/reducereads/SlidingWindowUnitTest.java
+++ /dev/null
@@ -1,964 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.compression.reducereads;
-
-import it.unimi.dsi.fastutil.objects.*;
-import net.sf.picard.reference.IndexedFastaSequenceFile;
-import net.sf.samtools.Cigar;
-import net.sf.samtools.CigarElement;
-import net.sf.samtools.CigarOperator;
-import net.sf.samtools.SAMFileHeader;
-import org.broadinstitute.sting.BaseTest;
-import org.broadinstitute.sting.utils.BaseUtils;
-import org.broadinstitute.sting.utils.GenomeLoc;
-import org.broadinstitute.sting.utils.UnvalidatingGenomeLoc;
-import org.broadinstitute.sting.utils.Utils;
-import org.broadinstitute.sting.utils.collections.Pair;
-import org.broadinstitute.sting.utils.fasta.CachingIndexedFastaSequenceFile;
-import org.broadinstitute.sting.utils.sam.ArtificialSAMUtils;
-import org.broadinstitute.sting.utils.sam.GATKSAMReadGroupRecord;
-import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
-import org.testng.Assert;
-import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
-import java.io.File;
-import java.io.FileNotFoundException;
-import java.util.ArrayList;
-import java.util.Arrays;
-import java.util.LinkedList;
-import java.util.List;
-
-public class SlidingWindowUnitTest extends BaseTest {
-
-    private static final int variantRegionLength = 1000;
-    private static final int globalStartPosition = 1000000;
-
-    private static boolean[] createBitset(final List<FinishedGenomeLoc> locs) {
-        final boolean[] variantRegionBitset = new boolean[variantRegionLength];
-        for ( FinishedGenomeLoc loc : locs ) {
-            final int stop = loc.getStop() - globalStartPosition;
-            for ( int i = loc.getStart() - globalStartPosition; i <= stop; i++ )
-                variantRegionBitset[i] = true;
-        }
-        return variantRegionBitset;
-    }
-
-    //////////////////////////////////////////////////////////////////////////////////////
-    //// Test for leading softclips immediately followed by an insertion in the CIGAR ////
-    //////////////////////////////////////////////////////////////////////////////////////
-
-    @Test(enabled = true)
-    public void testLeadingSoftClipThenInsertion() {
-
-        final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(header, "foo", 0, 1, 10);
-        read.setReadBases(Utils.dupBytes((byte) 'A', 10));
-        read.setBaseQualities(Utils.dupBytes((byte)30, 10));
-        read.setMappingQuality(30);
-        read.setCigarString("2S2I6M");
-
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, 1);
-        slidingWindow.addRead(read);
-        slidingWindow.close(null);
-    }
-
-    @Test(enabled = true)
-    public void testLeadingHardClipThenInsertion() {
-
-        final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(header, "foo", 0, 1, 8);
-        read.setReadBases(Utils.dupBytes((byte) 'A', 8));
-        read.setBaseQualities(Utils.dupBytes((byte)30, 8));
-        read.setMappingQuality(30);
-        read.setCigarString("2H2I6M");
-
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, 10, header, new GATKSAMReadGroupRecord("test"), 0, 0.05, 0.05, 0.05, 20, 20, 100, ReduceReads.DownsampleStrategy.Normal, false);
-        slidingWindow.addRead(read);
-        slidingWindow.close(null);
-    }
-
-    //////////////////////////////////////////////////////////////////////////////////////
-    //// This section tests the findVariantRegions() method and related functionality ////
-    //////////////////////////////////////////////////////////////////////////////////////
-
-    private static final FinishedGenomeLoc loc90to95 = new FinishedGenomeLoc("1", 0, 1000090, 1000095, false);
-    private static final FinishedGenomeLoc loc96to99 = new FinishedGenomeLoc("1", 0, 1000096, 1000099, false);
-    private static final FinishedGenomeLoc loc100to110 = new FinishedGenomeLoc("1", 0, 1000100, 1000110, false);
-    private static final FinishedGenomeLoc loc999 = new FinishedGenomeLoc("1", 0, 1000999, 1000999, false);
-
-    private class FindVariantRegionsTest {
-        public List<FinishedGenomeLoc> locs, expectedResult;
-        public boolean[] variantRegionBitset;
-
-        private FindVariantRegionsTest(final List<FinishedGenomeLoc> locs) {
-            this.locs = locs;
-            this.expectedResult = locs;
-            variantRegionBitset = createBitset(locs);
-        }
-
-        private FindVariantRegionsTest(final List<FinishedGenomeLoc> locs, final List<FinishedGenomeLoc> expectedResult) {
-            this.locs = locs;
-            this.expectedResult = expectedResult;
-            variantRegionBitset = createBitset(locs);
-        }
-    }
-
-    @DataProvider(name = "findVariantRegions")
-    public Object[][] createFindVariantRegionsData() {
-        List<Object[]> tests = new ArrayList<Object[]>();
-
-        tests.add(new Object[]{new FindVariantRegionsTest(Arrays.<FinishedGenomeLoc>asList(loc90to95))});
-        tests.add(new Object[]{new FindVariantRegionsTest(Arrays.<FinishedGenomeLoc>asList(loc90to95, loc100to110))});
-        tests.add(new Object[]{new FindVariantRegionsTest(Arrays.<FinishedGenomeLoc>asList(loc90to95, loc96to99, loc100to110), Arrays.<FinishedGenomeLoc>asList(new FinishedGenomeLoc("1", 0, 1000090, 1000110, false)))});
-        tests.add(new Object[]{new FindVariantRegionsTest(Arrays.<FinishedGenomeLoc>asList(loc90to95, loc999))});
-        tests.add(new Object[]{new FindVariantRegionsTest(Arrays.<FinishedGenomeLoc>asList(loc999))});
-
-        return tests.toArray(new Object[][]{});
-    }
-
-    @Test(dataProvider = "findVariantRegions", enabled = true)
-    public void testFindVariantRegions(FindVariantRegionsTest test) {
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, globalStartPosition);
-        final CompressionStash locs = slidingWindow.findVariantRegions(0, variantRegionLength, test.variantRegionBitset, true);
-        int index = 0;
-        for ( final FinishedGenomeLoc loc : locs ) {
-            Assert.assertTrue(loc.equals(test.expectedResult.get(index++)));
-        }
-    }
-
-    @Test(enabled = true)
-    public void testNoClosingRegions() {
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, globalStartPosition);
-        final CompressionStash locs = slidingWindow.findVariantRegions(0, variantRegionLength, createBitset(Arrays.<FinishedGenomeLoc>asList(loc90to95, loc999)), false);
-        Assert.assertEquals(locs.size(), 1);
-        Assert.assertEquals(locs.iterator().next(), loc90to95);
-    }
-
-
-    /////////////////////////////////////////////////////////////////////////////
-    //// This section tests the markSites() method and related functionality ////
-    /////////////////////////////////////////////////////////////////////////////
-
-    @Test(enabled = true)
-    public void testMarkedSitesClass() {
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, globalStartPosition);
-        final SlidingWindow.MarkedSites markedSites = slidingWindow.new MarkedSites();
-
-        markedSites.updateRegion(100, 100);
-        Assert.assertEquals(markedSites.getStartLocation(), 100);
-        Assert.assertEquals(markedSites.getVariantSiteBitSet().length, 100);
-
-        markedSites.updateRegion(300, 100);
-        Assert.assertEquals(markedSites.getStartLocation(), 300);
-        Assert.assertEquals(markedSites.getVariantSiteBitSet().length, 100);
-
-        markedSites.getVariantSiteBitSet()[10] = true;
-        markedSites.updateRegion(290, 100);
-        Assert.assertEquals(markedSites.getStartLocation(), 290);
-        Assert.assertEquals(markedSites.getVariantSiteBitSet().length, 100);
-        Assert.assertFalse(markedSites.getVariantSiteBitSet()[10]);
-
-        markedSites.getVariantSiteBitSet()[20] = true;
-        markedSites.updateRegion(290, 100);
-        Assert.assertEquals(markedSites.getStartLocation(), 290);
-        Assert.assertEquals(markedSites.getVariantSiteBitSet().length, 100);
-        Assert.assertTrue(markedSites.getVariantSiteBitSet()[20]);
-
-        markedSites.updateRegion(300, 100);
-        Assert.assertEquals(markedSites.getStartLocation(), 300);
-        Assert.assertEquals(markedSites.getVariantSiteBitSet().length, 100);
-
-        markedSites.getVariantSiteBitSet()[95] = true;
-        markedSites.updateRegion(390, 20);
-        Assert.assertEquals(markedSites.getStartLocation(), 390);
-        Assert.assertEquals(markedSites.getVariantSiteBitSet().length, 20);
-        Assert.assertTrue(markedSites.getVariantSiteBitSet()[5]);
-
-        markedSites.updateRegion(340, 60);
-        Assert.assertEquals(markedSites.getStartLocation(), 340);
-        Assert.assertEquals(markedSites.getVariantSiteBitSet().length, 60);
-
-        markedSites.getVariantSiteBitSet()[20] = true;
-        markedSites.updateRegion(350, 60);
-        Assert.assertEquals(markedSites.getStartLocation(), 350);
-        Assert.assertEquals(markedSites.getVariantSiteBitSet().length, 60);
-        Assert.assertTrue(markedSites.getVariantSiteBitSet()[10]);
-    }
-
-    @Test(enabled = true)
-    public void testMarkVariantRegion() {
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, globalStartPosition);
-        slidingWindow.getMarkedSitesForTesting().updateRegion(100, 100);
-
-        slidingWindow.markVariantRegion(40);
-        Assert.assertEquals(countTrueBits(slidingWindow.getMarkedSitesForTesting().getVariantSiteBitSet()), 21);
-
-        slidingWindow.markVariantRegion(5);
-        Assert.assertEquals(countTrueBits(slidingWindow.getMarkedSitesForTesting().getVariantSiteBitSet()), 37);
-
-        slidingWindow.markVariantRegion(95);
-        Assert.assertEquals(countTrueBits(slidingWindow.getMarkedSitesForTesting().getVariantSiteBitSet()), 52);
-    }
-
-    private static int countTrueBits(final boolean[] bitset) {
-        int count = 0;
-        for ( final boolean bit : bitset ) {
-            if ( bit )
-                count++;
-        }
-        return count;
-    }
-
-    @Test(enabled = true)
-    public void testMarkingRegionInCancerMode() {
-
-        final int contextSize = 10;
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, contextSize, header, new GATKSAMReadGroupRecord("test"), 0, 0.05, 0.05, 0.05, 20, 20, 100, ReduceReads.DownsampleStrategy.Normal, false);
-        slidingWindow.addRead(createSimpleRead("1", 0, 34, 75));
-        slidingWindow.addRead(createSimpleRead("2", 0, 97, 73));
-        slidingWindow.addRead(createSimpleRead("3", 0, 98, 75));
-        slidingWindow.addRead(createSimpleRead("4", 0, 98, 75));
-        slidingWindow.addRead(createSimpleRead("5", 0, 98, 75));
-
-        final CompressionStash regions = new CompressionStash();
-        regions.add(new FinishedGenomeLoc("1", 0, 89, 109, true));
-
-        slidingWindow.closeVariantRegions(regions, null, false);
-        Assert.assertEquals(slidingWindow.getMarkedSitesForTesting().getVariantSiteBitSet().length, 76 + contextSize);
-    }
-
-    private GATKSAMRecord createSimpleRead(final String name, final int refIndex, final int alignmentStart, final int length) {
-
-        final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(header, name, refIndex, alignmentStart, length);
-        read.setReadBases(Utils.dupBytes((byte) 'A', length));
-        read.setBaseQualities(Utils.dupBytes((byte) 30, length));
-        read.setMappingQuality(60);
-        return read;
-    }
-
-
-    /////////////////////////////////////////////////////////////////
-    //// This section tests the consensus creation functionality ////
-    /////////////////////////////////////////////////////////////////
-
-    private static final int readLength = 100;
-    private static final int testRegionSize = 1000;
-    private final ObjectList<GATKSAMRecord> basicReads = new ObjectArrayList<GATKSAMRecord>(20);
-    private IndexedFastaSequenceFile seq;
-    private SAMFileHeader header;
-
-    @BeforeClass
-    public void setup() throws FileNotFoundException {
-        seq = new CachingIndexedFastaSequenceFile(new File(b37KGReference));
-        header = ArtificialSAMUtils.createArtificialSamHeader(seq.getSequenceDictionary());
-
-        final int readFrequency = 20;
-
-        basicReads.clear();
-        for ( int i = 0; i < testRegionSize; i += readFrequency ) {
-            final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(header, "basicRead" + i, 0, globalStartPosition + i, readLength);
-            read.setReadBases(Utils.dupBytes((byte) 'A', readLength));
-            read.setBaseQualities(Utils.dupBytes((byte)30, readLength));
-            read.setMappingQuality(30);
-            read.setReadNegativeStrandFlag(i % 40 == 20);
-            basicReads.add(read);
-        }
-    }
-
-    private class ConsensusCreationTest {
-        public final int expectedNumberOfReads, expectedNumberOfReadsWithHetCompression, expectedNumberOfReadsAtDeepCoverage;
-        public final List<GATKSAMRecord> myReads = new ArrayList<GATKSAMRecord>(20);
-        public final String description;
-
-        private ConsensusCreationTest(final List<GenomeLoc> locs, final boolean readsShouldBeLowQuality, final boolean variantBaseShouldBeLowQuality, final int expectedNumberOfReads, final int expectedNumberOfReadsWithHetCompression, final int expectedNumberOfReadsAtDeepCoverage) {
-            this.expectedNumberOfReads = expectedNumberOfReads;
-            this.expectedNumberOfReadsWithHetCompression = expectedNumberOfReadsWithHetCompression;
-            this.expectedNumberOfReadsAtDeepCoverage = expectedNumberOfReadsAtDeepCoverage;
-            this.description = String.format("%d %d %d %b %b", expectedNumberOfReads, expectedNumberOfReadsWithHetCompression, expectedNumberOfReadsAtDeepCoverage, readsShouldBeLowQuality, variantBaseShouldBeLowQuality);
-
-            // first, add the basic reads to the collection
-            myReads.addAll(basicReads);
-
-            // then add the permuted reads
-            for ( final GenomeLoc loc : locs )
-                myReads.add(createVariantRead(loc, readsShouldBeLowQuality, variantBaseShouldBeLowQuality, CigarOperator.M));
-        }
-
-        private ConsensusCreationTest(final List<GenomeLoc> locs, final CigarOperator operator, final int expectedNumberOfReads, final int expectedNumberOfReadsWithHetCompression, final int expectedNumberOfReadsAtDeepCoverage) {
-            this.expectedNumberOfReads = expectedNumberOfReads;
-            this.expectedNumberOfReadsWithHetCompression = expectedNumberOfReadsWithHetCompression;
-            this.expectedNumberOfReadsAtDeepCoverage = expectedNumberOfReadsAtDeepCoverage;
-            this.description = String.format("%s %d %d %d", operator.toString(), expectedNumberOfReads, expectedNumberOfReadsWithHetCompression, expectedNumberOfReadsAtDeepCoverage);
-
-            // first, add the basic reads to the collection
-            myReads.addAll(basicReads);
-
-            // then add the permuted reads
-            for ( final GenomeLoc loc : locs )
-                myReads.add(createVariantRead(loc, false, false, operator));
-        }
-
-        public String toString() { return  description; }
-
-        private GATKSAMRecord createVariantRead(final GenomeLoc loc, final boolean readShouldBeLowQuality,
-                                                final boolean variantBaseShouldBeLowQuality, final CigarOperator operator) {
-
-            final int startPos = loc.getStart() - 50;
-
-            final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(header, "myRead" + startPos, 0, startPos, readLength);
-
-            final byte[] bases = Utils.dupBytes((byte) 'A', readLength);
-            // create a mismatch if requested
-            if ( operator == CigarOperator.M )
-                bases[50] = 'C';
-            read.setReadBases(bases);
-
-            final byte[] baseQuals = Utils.dupBytes((byte) 30, readLength);
-            if ( variantBaseShouldBeLowQuality )
-                baseQuals[50] = (byte)10;
-            read.setBaseQualities(baseQuals);
-            final byte mappingQual = readShouldBeLowQuality ? (byte)10 : (byte)30;
-            read.setMappingQuality(mappingQual);
-
-            if ( operator != CigarOperator.M ) {
-                final List<CigarElement> elements = new ArrayList<CigarElement>(3);
-                elements.add(new CigarElement(operator == CigarOperator.D ? 50 : 51, CigarOperator.M));
-                elements.add(new CigarElement(1, operator));
-                elements.add(new CigarElement(operator == CigarOperator.D ? 50 : 48, CigarOperator.M));
-                read.setCigar(new Cigar(elements));
-            }
-
-            return read;
-        }
-    }
-
-    private static final GenomeLoc loc290 = new UnvalidatingGenomeLoc("1", 0, 1000290, 1000290);
-    private static final GenomeLoc loc295 = new UnvalidatingGenomeLoc("1", 0, 1000295, 1000295);
-    private static final GenomeLoc loc309 = new UnvalidatingGenomeLoc("1", 0, 1000309, 1000309);
-    private static final GenomeLoc loc310 = new UnvalidatingGenomeLoc("1", 0, 1000310, 1000310);
-    private static final GenomeLoc loc320 = new UnvalidatingGenomeLoc("1", 0, 1000320, 1000320);
-    private static final GenomeLoc loc1100 = new UnvalidatingGenomeLoc("1", 0, 1001100, 1001100);
-
-    private static final int DEEP_COVERAGE_ITERATIONS = 100;
-
-    @DataProvider(name = "ConsensusCreation")
-    public Object[][] createConsensusCreationTestData() {
-        List<Object[]> tests = new ArrayList<Object[]>();
-
-        // test high quality reads and bases
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(), false, false, 2, 2, 2)});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290), false, false, 11, 8, 7 + DEEP_COVERAGE_ITERATIONS)});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290, loc295), false, false, 12, 12, 4 + (8 * DEEP_COVERAGE_ITERATIONS))});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290, loc309), false, false, 12, 12, 4 + (8 * DEEP_COVERAGE_ITERATIONS))});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290, loc310), false, false, 13, 13, 4 + (9 * DEEP_COVERAGE_ITERATIONS))});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290, loc320), false, false, 13, 12, 6 + (6 * DEEP_COVERAGE_ITERATIONS))});
-
-        // test low quality reads
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(), true, false, 2, 2, 2)});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290), true, false, 3, 3, 3)});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290, loc295), true, false, 3, 3, 3)});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290, loc309), true, false, 3, 3, 3)});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290, loc310), true, false, 3, 3, 3)});
-
-        // test low quality bases
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(), false, true, 2, 2, 2)});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290), false, true, 2, 2, 2)});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290, loc295), false, true, 2, 2, 2)});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290, loc309), false, true, 2, 2, 2)});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290, loc310), false, true, 2, 2, 2)});
-
-        // test mixture
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc1100), true, false, 3, 3, 3)});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc1100), false, true, 2, 2, 2)});
-
-        // test I/D operators
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290), CigarOperator.D, 11, 11, 4 + (7 * DEEP_COVERAGE_ITERATIONS))});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290, loc295), CigarOperator.D, 12, 12, 4 + (8 * DEEP_COVERAGE_ITERATIONS))});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290, loc309), CigarOperator.D, 12, 12, 4 + (8 * DEEP_COVERAGE_ITERATIONS))});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290, loc310), CigarOperator.D, 13, 13, 4 + (9 * DEEP_COVERAGE_ITERATIONS))});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290), CigarOperator.I, 11, 11, 4 + (7 * DEEP_COVERAGE_ITERATIONS))});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290, loc295), CigarOperator.I, 12, 12, 4 + (8 * DEEP_COVERAGE_ITERATIONS))});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290, loc309), CigarOperator.I, 12, 12, 4 + (8 * DEEP_COVERAGE_ITERATIONS))});
-        tests.add(new Object[]{new ConsensusCreationTest(Arrays.<GenomeLoc>asList(loc290, loc310), CigarOperator.I, 13, 13, 4 + (9 * DEEP_COVERAGE_ITERATIONS))});
-
-        return tests.toArray(new Object[][]{});
-    }
-
-    @Test(dataProvider = "ConsensusCreation", enabled = true)
-    public void testConsensusCreationTest(ConsensusCreationTest test) {
-        final ObjectAVLTreeSet<GenomeLoc> knownSNPs = new ObjectAVLTreeSet<GenomeLoc>();
-
-        // test WITHOUT het compression
-        SlidingWindow slidingWindow = new SlidingWindow("1", 0, 10, header, new GATKSAMReadGroupRecord("test"), 0, 0.05, 0.05, 0.05, 20, 20, 100, ReduceReads.DownsampleStrategy.Normal, false);
-        for ( final GATKSAMRecord read : test.myReads )
-            slidingWindow.addRead(read);
-        Pair<ObjectSet<GATKSAMRecord>, CompressionStash> result = slidingWindow.close(knownSNPs); // currently empty
-        Assert.assertEquals(result.getFirst().size(), test.expectedNumberOfReads);
-
-        // test WITH het compression at KNOWN sites
-        slidingWindow = new SlidingWindow("1", 0, 10, header, new GATKSAMReadGroupRecord("test"), 0, 0.05, 0.05, 0.05, 20, 20, 100, ReduceReads.DownsampleStrategy.Normal, false);
-        for ( final GATKSAMRecord read : test.myReads )
-            slidingWindow.addRead(read);
-        for ( int i = 0; i < 1200; i++ )
-            knownSNPs.add(new UnvalidatingGenomeLoc("1", 0, globalStartPosition + i, globalStartPosition + i));
-        result = slidingWindow.close(knownSNPs);
-        Assert.assertEquals(result.getFirst().size(), test.expectedNumberOfReadsWithHetCompression);
-
-        // test WITH het compression at ALL sites
-        slidingWindow = new SlidingWindow("1", 0, 10, header, new GATKSAMReadGroupRecord("test"), 0, 0.05, 0.05, 0.05, 20, 20, 100, ReduceReads.DownsampleStrategy.Normal, false);
-        for ( final GATKSAMRecord read : test.myReads )
-            slidingWindow.addRead(read);
-        result = slidingWindow.close(null);
-        Assert.assertEquals(result.getFirst().size(), test.expectedNumberOfReadsWithHetCompression);
-
-        // test with deep coverage
-        slidingWindow = new SlidingWindow("1", 0, 10, header, new GATKSAMReadGroupRecord("test"), 0, 0.05, 0.05, 0.05, 20, 20, 0, ReduceReads.DownsampleStrategy.Normal, false);
-        for ( int i = 0; i < DEEP_COVERAGE_ITERATIONS; i++ ) {
-            for ( final GATKSAMRecord read : test.myReads ) {
-                final GATKSAMRecord copy = ArtificialSAMUtils.createArtificialRead(header, read.getReadName() + "_" + (i+1), 0, read.getAlignmentStart(), readLength);
-                copy.setReadBases(read.getReadBases());
-                copy.setBaseQualities(read.getBaseQualities());
-                copy.setMappingQuality(read.getMappingQuality());
-                copy.setReadNegativeStrandFlag(read.getReadNegativeStrandFlag());
-                if ( read.getCigar() != null )
-                    copy.setCigar(read.getCigar());
-                slidingWindow.addRead(copy);
-            }
-        }
-        result = slidingWindow.close(null);
-        Assert.assertEquals(result.getFirst().size(), test.expectedNumberOfReadsAtDeepCoverage);
-    }
-
-    @Test
-    public void testConsensusCreationForMultiallelic() {
-
-        final int totalNumReads = 7;
-        final ObjectList<GATKSAMRecord> myReads = new ObjectArrayList<GATKSAMRecord>(totalNumReads);
-
-        for ( int i = 0; i < totalNumReads; i++ ) {
-            final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(header, "basicRead" + i, 0, globalStartPosition, readLength);
-            read.setBaseQualities(Utils.dupBytes((byte)30, readLength));
-            read.setMappingQuality(30);
-            read.setReadNegativeStrandFlag(false);
-
-            final char base = i < totalNumReads - 2 ? 'A' : ( i == totalNumReads - 2 ? 'C' : 'G');
-            read.setReadBases(Utils.dupBytes((byte) base, readLength));
-
-            myReads.add(read);
-        }
-
-        final ObjectAVLTreeSet<GenomeLoc> knownSNPs = new ObjectAVLTreeSet<GenomeLoc>();
-
-        // test WITHOUT het compression
-        SlidingWindow slidingWindow = new SlidingWindow("1", 0, 10, header, new GATKSAMReadGroupRecord("test"), 0, 0.1, 0.05, 0.05, 20, 20, 100, ReduceReads.DownsampleStrategy.Normal, false);
-        for ( final GATKSAMRecord read : myReads )
-            slidingWindow.addRead(read);
-        Pair<ObjectSet<GATKSAMRecord>, CompressionStash> result = slidingWindow.close(knownSNPs); // currently empty
-        Assert.assertEquals(result.getFirst().size(), totalNumReads); // no compression at all
-
-        // test WITH het compression at KNOWN sites
-        slidingWindow = new SlidingWindow("1", 0, 10, header, new GATKSAMReadGroupRecord("test"), 0, 0.1, 0.05, 0.05, 20, 20, 100, ReduceReads.DownsampleStrategy.Normal, false);
-        for ( final GATKSAMRecord read : myReads )
-            slidingWindow.addRead(read);
-        for ( int i = 0; i < readLength; i++ )
-            knownSNPs.add(new UnvalidatingGenomeLoc("1", 0, globalStartPosition + i, globalStartPosition + i));
-        result = slidingWindow.close(knownSNPs);
-        Assert.assertEquals(result.getFirst().size(), totalNumReads); // no compression at all
-
-        // test WITH het compression at ALL sites
-        slidingWindow = new SlidingWindow("1", 0, 10, header, new GATKSAMReadGroupRecord("test"), 0, 0.1, 0.05, 0.05, 20, 20, 100, ReduceReads.DownsampleStrategy.Normal, false);
-        for ( final GATKSAMRecord read : myReads )
-            slidingWindow.addRead(read);
-        result = slidingWindow.close(knownSNPs);
-        Assert.assertEquals(result.getFirst().size(), totalNumReads); // no compression at all
-    }
-
-    @Test
-    public void testConsensusCreationForInsertions() {
-
-        final int totalNumReads = 7;
-        final ObjectList<GATKSAMRecord> myReads = new ObjectArrayList<>(totalNumReads);
-
-        // add reads, one with a SNP and one with a SNP and insertion
-        for ( int i = 0; i < totalNumReads; i++ ) {
-            final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(header, "basicRead" + i, 0, globalStartPosition, readLength);
-            read.setBaseQualities(Utils.dupBytes((byte)30, readLength));
-            read.setMappingQuality(30);
-            read.setReadNegativeStrandFlag(false);
-
-            final byte[] bases = Utils.dupBytes((byte) 'A', readLength);
-            if ( i < 2 )
-                bases[20] = 'C';
-            if ( i == 0 )
-                bases[80] = 'C';
-            read.setReadBases(bases);
-
-            if ( i == 0 )
-                read.setCigarString("80M1I19M");
-
-            myReads.add(read);
-        }
-
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, 10, header, new GATKSAMReadGroupRecord("test"), 0, 0.1, 0.05, 0.05, 20, 20, 100, ReduceReads.DownsampleStrategy.Normal, false);
-        for ( final GATKSAMRecord read : myReads )
-            slidingWindow.addRead(read);
-        final Pair<ObjectSet<GATKSAMRecord>, CompressionStash> result = slidingWindow.close(null);
-        Assert.assertEquals(result.getFirst().size(), 3); // no compression at all for SNPs
-    }
-
-    @Test
-    public void testAddingReadPairWithSameCoordinates() {
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, 10);
-
-        final GATKSAMRecord read1 = ArtificialSAMUtils.createArtificialRead(header, "basicRead", 0, globalStartPosition, 1);
-        read1.setReadBases(new byte[]{(byte)'A'});
-        read1.setBaseQualities(new byte[]{(byte)'A'});
-        read1.setMappingQuality(30);
-        read1.setReadNegativeStrandFlag(false);
-        slidingWindow.addRead(read1);
-
-        final GATKSAMRecord read2 = ArtificialSAMUtils.createArtificialRead(header, "basicRead", 0, globalStartPosition, 1);
-        read2.setReadBases(new byte[]{(byte)'A'});
-        read2.setBaseQualities(new byte[]{(byte)'A'});
-        read2.setMappingQuality(30);
-        read2.setReadNegativeStrandFlag(true);
-        slidingWindow.addRead(read2);
-
-        Assert.assertEquals(slidingWindow.readsInWindow.size(), 2);
-    }
-
-    @Test
-    public void testOnlySpanningReadHasLowQual() {
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, 10, header, new GATKSAMReadGroupRecord("test"), 0, 0.1, 0.05, 0.05, 20, 20, 100, ReduceReads.DownsampleStrategy.Normal, false);
-
-        final GATKSAMRecord read1 = ArtificialSAMUtils.createArtificialRead(header, "basicRead1", 0, globalStartPosition, 100);
-        final GATKSAMRecord read2 = ArtificialSAMUtils.createArtificialRead(header, "basicRead2", 0, globalStartPosition + 50, 100);
-
-        final byte[] bases = Utils.dupBytes((byte) 'A', readLength);
-        read1.setReadBases(bases);
-        read2.setReadBases(bases);
-
-        final byte[] baseQuals = Utils.dupBytes((byte) 30, readLength);
-        baseQuals[80] = (byte)10;
-        read1.setBaseQualities(baseQuals);
-        read2.setBaseQualities(baseQuals);
-
-        read1.setMappingQuality(30);
-        read2.setMappingQuality(30);
-
-        slidingWindow.addRead(read1);
-        slidingWindow.addRead(read2);
-
-        Assert.assertEquals(slidingWindow.close(null).getFirst().size(), 1);
-    }
-
-
-    ///////////////////////////////////////////////////////////
-    //// This section tests the downsampling functionality ////
-    ///////////////////////////////////////////////////////////
-
-    @DataProvider(name = "Downsampling")
-    public Object[][] createDownsamplingTestData() {
-        List<Object[]> tests = new ArrayList<Object[]>();
-
-        for ( int i = 1; i < basicReads.size() + 10; i++ )
-            tests.add(new Object[]{i});
-
-        return tests.toArray(new Object[][]{});
-    }
-
-    @Test(dataProvider = "Downsampling", enabled = true)
-    public void testDownsamplingTest(final int dcov) {
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, 10, header, new GATKSAMReadGroupRecord("test"), 0, 0.05, 0.05, 0.05, 20, 20, dcov, ReduceReads.DownsampleStrategy.Normal, false);
-        final ObjectList<GATKSAMRecord> result = slidingWindow.downsampleVariantRegion(basicReads);
-
-        Assert.assertEquals(result.size(), Math.min(dcov, basicReads.size()));
-    }
-
-    @DataProvider(name = "DownsamplingFromClose")
-    public Object[][] createDownsamplingFromCloseTestData() {
-
-        final ObjectList<GATKSAMRecord> myReads = new ObjectArrayList<>(20);
-        for ( int i = 0; i < 21; i++ ) {
-            final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(header, "read" + i, 0, globalStartPosition, readLength);
-            final byte[] bases = Utils.dupBytes((byte) 'A', readLength);
-            if ( i < 5 )
-                bases[50] = 'C';
-            read.setReadBases(bases);
-            read.setBaseQualities(Utils.dupBytes((byte)30, readLength));
-            read.setMappingQuality(30);
-            read.setReadNegativeStrandFlag(false);
-            myReads.add(read);
-        }
-
-        List<Object[]> tests = new ArrayList<>();
-
-        for ( int i = 1; i < 25; i++ )
-            tests.add(new Object[]{myReads, i});
-
-        return tests.toArray(new Object[][]{});
-    }
-
-    @Test(dataProvider = "DownsamplingFromClose", enabled = true)
-    public void testDownsamplingTestFromClose(final ObjectList<GATKSAMRecord> myReads, final int dcov) {
-
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, 10, header, new GATKSAMReadGroupRecord("test"), 0, 0.05, 0.05, 0.05, 20, 20, dcov, ReduceReads.DownsampleStrategy.Normal, false);
-        for ( final GATKSAMRecord read : myReads )
-            slidingWindow.addRead(read);
-        Pair<ObjectSet<GATKSAMRecord>, CompressionStash> result = slidingWindow.close(new ObjectAVLTreeSet<GenomeLoc>()); // no het compression
-
-        Assert.assertEquals(result.getFirst().size(), Math.min(dcov, myReads.size()), "Down-sampling was not performed correctly");
-    }
-
-    @DataProvider(name = "NoDownsamplingForConsensusReads")
-    public Object[][] createNoDownsamplingForConsensusReadsData() {
-
-        final ObjectList<GATKSAMRecord> myReads = new ObjectArrayList<>(20);
-        for ( int i = 0; i < 30; i++ ) {
-            final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(header, "read" + i, 0, globalStartPosition, readLength);
-            final byte[] bases = Utils.dupBytes((byte) 'A', readLength);
-            if ( i < 10 )
-                bases[50] = 'C';
-            read.setReadBases(bases);
-            read.setBaseQualities(Utils.dupBytes((byte)30, readLength));
-            read.setMappingQuality(30);
-            read.setReadNegativeStrandFlag(false);
-            read.setReadNegativeStrandFlag(i % 2 == 0);
-            myReads.add(read);
-        }
-
-        List<Object[]> tests = new ArrayList<>();
-
-        for ( int i = 0; i < 5; i++ )
-            tests.add(new Object[]{myReads, i});
-
-        return tests.toArray(new Object[][]{});
-    }
-
-    @Test(dataProvider = "NoDownsamplingForConsensusReads", enabled = true)
-    public void testNoDownsamplingForConsensusReads(final ObjectList<GATKSAMRecord> myReads, final int dcov) {
-
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, 10, header, new GATKSAMReadGroupRecord("test"), 0, 0.05, 0.05, 0.05, 20, 20, dcov, ReduceReads.DownsampleStrategy.Normal, false);
-        for ( final GATKSAMRecord read : myReads )
-            slidingWindow.addRead(read);
-        Pair<ObjectSet<GATKSAMRecord>, CompressionStash> result = slidingWindow.close(null); // allow het compression (so we expect 4 reads)
-
-        Assert.assertEquals(result.getFirst().size(), 4, "Down-sampling was performed on consensus reads!");
-    }
-
-    //////////////////////////////////////////////////////////////
-    //// This section tests the consensus base quals accuracy ////
-    //////////////////////////////////////////////////////////////
-
-    private class QualsTest {
-        public final List<Integer> quals;
-        public final List<GATKSAMRecord> myReads = new ArrayList<GATKSAMRecord>(5);
-
-        private QualsTest(final List<Integer> quals) {
-            this.quals = quals;
-            for ( int i = 0; i < quals.size(); i++ ) {
-                final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(header, "basicRead" + i, 0, globalStartPosition, 1);
-                read.setReadBases(new byte[]{(byte)'A'});
-                read.setBaseQualities(new byte[]{quals.get(i).byteValue()});
-                read.setMappingQuality(30);
-                myReads.add(read);
-            }
-        }
-    }
-
-    @DataProvider(name = "ConsensusQuals")
-    public Object[][] createConsensusQualsData() {
-        List<Object[]> tests = new ArrayList<Object[]>();
-
-        final int[] quals = new int[]{ 0, 5, 10, 15, 20, 30, 40, 50 };
-
-        for ( final int qual1 : quals ) {
-            for ( final int qual2 : quals ) {
-                for ( final int qual3 : quals ) {
-                    tests.add(new Object[]{new QualsTest(Arrays.asList(qual1, qual2, qual3))});
-                }
-            }
-        }
-
-        return tests.toArray(new Object[][]{});
-    }
-
-    private static final byte minUsableConsensusQual = 10;
-
-    @Test(dataProvider = "ConsensusQuals", enabled = true)
-    public void testConsensusQualsTest(QualsTest test) {
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, 10, header, new GATKSAMReadGroupRecord("test"), 0, 0.05, 0.05, 0.05, minUsableConsensusQual, 20, 100, ReduceReads.DownsampleStrategy.Normal, false);
-        for ( final GATKSAMRecord read : test.myReads )
-            slidingWindow.addRead(read);
-        final Pair<ObjectSet<GATKSAMRecord>, CompressionStash> result = slidingWindow.close(new ObjectAVLTreeSet<GenomeLoc>());
-
-        Assert.assertEquals(result.getFirst().size(), 1);
-        final GATKSAMRecord read = result.getFirst().iterator().next();
-        final int actualBaseQual = read.getReducedCount(0) * read.getBaseQualities()[0];
-        final int expectedBaseQual = qualSum(test.quals);
-        Assert.assertEquals(actualBaseQual, expectedBaseQual);
-    }
-
-    private static int qualSum(final List<Integer> quals) {
-        int goodBases = 0;
-        int sum = 0;
-        for ( final int qual : quals ) {
-            if ( qual >= minUsableConsensusQual ) {
-                goodBases++;
-                sum += qual;
-            }
-        }
-
-        // handle a low quality consensus
-        if ( sum == 0 ) {
-            for ( final int qual : quals ) {
-                goodBases++;
-                sum += qual;
-            }
-        }
-
-        return sum - (sum % goodBases);
-    }
-
-
-    ////////////////////////////////////////////////////
-    //// This section tests the new header creation ////
-    ////////////////////////////////////////////////////
-
-    @DataProvider(name = "CreateNewHeader")
-    public Object[][] CreateNewHeaderTestData() {
-        List<Object[]> tests = new ArrayList<Object[]>();
-
-        for ( final int start : Arrays.asList(-10, -1, 0, 1, 10) ) {
-            for ( final int stop : Arrays.asList(-10, -1, 0, 1, 10) ) {
-                tests.add(new Object[]{start, stop});
-            }
-        }
-
-        return tests.toArray(new Object[][]{});
-    }
-
-    @Test(dataProvider = "CreateNewHeader", enabled = true)
-    public void createNewHeaderTest(final int start, final int stop) {
-
-        // set up the window header
-        final int currentHeaderStart = 100;
-        final int currentHeaderLength = 50;
-        final LinkedList<HeaderElement> windowHeader = new LinkedList<HeaderElement>();
-        for ( int i = 0; i < currentHeaderLength; i++ )
-            windowHeader.add(new HeaderElement(currentHeaderStart + i));
-
-        // set up the read
-        final int readStart = currentHeaderStart + start;
-        final int readLength = currentHeaderLength + stop - start;
-        final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(header, "basicRead", 0, readStart, readLength);
-        read.setReadBases(Utils.dupBytes((byte) 'A', readLength));
-        read.setBaseQualities(Utils.dupBytes((byte) 30, readLength));
-        read.setMappingQuality(30);
-
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, 10, header, new GATKSAMReadGroupRecord("test"), 0, 0.05, 0.05, 0.05, 20, 20, 10, ReduceReads.DownsampleStrategy.Normal, false);
-        int newIndex = slidingWindow.createNewHeaderElements(windowHeader, read, start);
-
-        Assert.assertEquals(newIndex, start > 0 ? start : 0);
-
-        final int expectedNewLength = currentHeaderLength + (start < 0 ? -start : 0) + (stop > 0 ? stop : 0);
-        Assert.assertEquals(windowHeader.size(), expectedNewLength);
-    }
-
-
-    ////////////////////////////////////////////////////////////
-    //// This section tests updating the header from a read ////
-    ////////////////////////////////////////////////////////////
-
-    @DataProvider(name = "UpdateHeaderForRead")
-    public Object[][] UpdateHeaderForReadTestData() {
-        List<Object[]> tests = new ArrayList<Object[]>();
-
-        for ( final int start : Arrays.asList(0, 1, 10) ) {
-            for ( final int readLength : Arrays.asList(1, 5, 10) ) {
-                tests.add(new Object[]{start, readLength});
-            }
-        }
-
-        return tests.toArray(new Object[][]{});
-    }
-
-    @Test(dataProvider = "UpdateHeaderForRead", enabled = true)
-    public void updateHeaderForReadTest(final int start, final int readLength) {
-
-        // set up the window header
-        final int currentHeaderStart = 100;
-        final int currentHeaderLength = 50;
-        final LinkedList<HeaderElement> windowHeader = new LinkedList<HeaderElement>();
-        for ( int i = 0; i < currentHeaderLength; i++ )
-            windowHeader.add(new HeaderElement(currentHeaderStart + i));
-
-        // set up the read
-        final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(header, "basicRead", 0, currentHeaderStart + start, readLength);
-        read.setReadBases(Utils.dupBytes((byte) 'A', readLength));
-        read.setBaseQualities(Utils.dupBytes((byte)30, readLength));
-        read.setMappingQuality(30);
-        read.setReadNegativeStrandFlag(false);
-
-        // add the read
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, 10, header, new GATKSAMReadGroupRecord("test"), 0, 0.05, 0.05, 0.05, 20, 20, 10, ReduceReads.DownsampleStrategy.Normal, false);
-        slidingWindow.actuallyUpdateHeaderForRead(windowHeader, read, false, start);
-        for ( int i = 0; i < start; i++ )
-            Assert.assertEquals(windowHeader.get(i).getBaseCounts(SlidingWindow.ConsensusType.POSITIVE_CONSENSUS).countOfBase(BaseUtils.Base.A.base), 0);
-        for ( int i = 0; i < readLength; i++ )
-            Assert.assertEquals(windowHeader.get(start + i).getBaseCounts(SlidingWindow.ConsensusType.POSITIVE_CONSENSUS).countOfBase(BaseUtils.Base.A.base), 1);
-        for ( int i = start + readLength; i < currentHeaderLength; i++ )
-            Assert.assertEquals(windowHeader.get(i).getBaseCounts(SlidingWindow.ConsensusType.POSITIVE_CONSENSUS).countOfBase(BaseUtils.Base.A.base), 0);
-
-        // now remove the read
-        slidingWindow.actuallyUpdateHeaderForRead(windowHeader, read, true, start);
-        for ( int i = 0; i < currentHeaderLength; i++ )
-            Assert.assertEquals(windowHeader.get(i).getBaseCounts(SlidingWindow.ConsensusType.POSITIVE_CONSENSUS).countOfBase(BaseUtils.Base.A.base), 0);
-    }
-
-    @Test
-    public void testUpdateHeaderForReadWithHighMQ() {
-
-        // set up the window header
-        final int currentHeaderStart = 100;
-        final LinkedList<HeaderElement> windowHeader = new LinkedList<>();
-        for ( int i = 0; i < readLength; i++ )
-            windowHeader.add(new HeaderElement(currentHeaderStart + i));
-
-        // set up the read
-        final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(header, "basicRead", 0, currentHeaderStart, readLength);
-        read.setReadBases(Utils.dupBytes((byte) 'A', readLength));
-        read.setBaseQualities(Utils.dupBytes((byte)30, readLength));
-        read.setMappingQuality(180);
-        read.setReadNegativeStrandFlag(false);
-
-        // add the read and make sure it's not filtered because of low MQ (byte vs. int)
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, 10, header, new GATKSAMReadGroupRecord("test"), 0, 0.05, 0.05, 0.05, 20, 20, 10, ReduceReads.DownsampleStrategy.Normal, false);
-        slidingWindow.actuallyUpdateHeaderForRead(windowHeader, read, false, 0);
-        for ( int i = 0; i < readLength; i++ )
-            Assert.assertEquals(windowHeader.get(i).getBaseCounts(SlidingWindow.ConsensusType.POSITIVE_CONSENSUS).countOfBase(BaseUtils.Base.A.base), 1);
-    }
-
-    //////////////////////////////////////////////////////////////////////////////////
-    //// This section tests functionality related to polyploid consensus creation ////
-    //////////////////////////////////////////////////////////////////////////////////
-
-    @DataProvider(name = "MatchesKnownProvider")
-    public Object[][] matchesKnownProvider() {
-
-        final ObjectArrayList<Object[]> tests = new ObjectArrayList<Object[]>();
-
-        // test no knowns
-        tests.add(new Object[]{new ObjectAVLTreeSet<GenomeLoc>(), loc290.getStart(), false});
-
-        final ObjectSortedSet<GenomeLoc> knownSnpPositions = new ObjectAVLTreeSet<GenomeLoc>();
-        knownSnpPositions.add(loc290);
-        knownSnpPositions.add(loc295);
-        knownSnpPositions.add(loc310);
-
-        // test overlap
-        tests.add(new Object[]{knownSnpPositions, loc290.getStart(), true});
-        tests.add(new Object[]{knownSnpPositions, loc295.getStart(), true});
-        tests.add(new Object[]{knownSnpPositions, loc310.getStart(), true});
-        tests.add(new Object[]{knownSnpPositions, loc309.getStart(), false});
-
-        return tests.toArray(new Object[][]{});
-    }
-
-    @Test(dataProvider = "MatchesKnownProvider")
-    public void testMatchesKnown(final ObjectSortedSet<GenomeLoc> knownSnpPositions, final int targetLoc, final boolean expectedResult) {
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, 10);
-        Assert.assertEquals(slidingWindow.matchesKnownPosition(targetLoc, knownSnpPositions), expectedResult);
-    }
-
-    @DataProvider(name = "SignificantSoftclipsProvider")
-    public Object[][] SignificantSoftclipsTestData() {
-        List<Object[]> tests = new ArrayList<Object[]>();
-
-        for ( final int indexWithSoftclips : Arrays.asList(-1, 0, 5, 9) ) {
-            for ( final int indexToSkip : Arrays.asList(-1, 0, 5, 9) ) {
-                tests.add(new Object[]{indexWithSoftclips, indexToSkip});
-            }
-        }
-
-        return tests.toArray(new Object[][]{});
-    }
-
-    @Test(dataProvider = "SignificantSoftclipsProvider", enabled = true)
-    public void significantSoftclipsTest(final int indexWithSoftclips, final int indexToSkip) {
-
-        // set up the window header
-        final int currentHeaderStart = 100;
-        final int currentHeaderLength = 10;
-        final LinkedList<HeaderElement> windowHeader = new LinkedList<HeaderElement>();
-        for ( int i = 0; i < currentHeaderLength; i++ )
-            windowHeader.add(new HeaderElement(currentHeaderStart + i));
-
-        // set up the normal read
-        final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(header, "basicRead", 0, currentHeaderStart, currentHeaderLength);
-        read.setReadBases(Utils.dupBytes((byte) 'A', currentHeaderLength));
-        read.setBaseQualities(Utils.dupBytes((byte)30, currentHeaderLength));
-        read.setMappingQuality(30);
-
-        // add the read
-        final SlidingWindow slidingWindow = new SlidingWindow("1", 0, 10, header, new GATKSAMReadGroupRecord("test"), 0, 0.05, 0.05, 0.05, 20, 20, 10, ReduceReads.DownsampleStrategy.Normal, false);
-        slidingWindow.actuallyUpdateHeaderForRead(windowHeader, read, false, 0);
-
-        // set up and add a soft-clipped read if requested
-        if ( indexWithSoftclips != -1 ) {
-            final GATKSAMRecord softclippedRead = ArtificialSAMUtils.createArtificialRead(header, "basicRead", 0, currentHeaderStart + indexWithSoftclips, 1);
-            softclippedRead.setReadBases(new byte[]{(byte) 'A'});
-            softclippedRead.setBaseQualities(new byte[]{(byte) 30});
-            softclippedRead.setMappingQuality(30);
-            softclippedRead.setCigarString("1S");
-            slidingWindow.actuallyUpdateHeaderForRead(windowHeader, softclippedRead, false, indexWithSoftclips);
-        }
-
-        final boolean result = slidingWindow.hasPositionWithSignificantSoftclipsOrVariant(windowHeader, currentHeaderStart + indexToSkip);
-        Assert.assertEquals(result, indexWithSoftclips != -1 && indexWithSoftclips != indexToSkip);
-    }
-}
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/genotyper/BiasedDownsamplingIntegrationTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/genotyper/BiasedDownsamplingIntegrationTest.java
deleted file mode 100644
index fd1f0de8a..000000000
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/genotyper/BiasedDownsamplingIntegrationTest.java
+++ /dev/null
@@ -1,162 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.genotyper;
-
-import org.broadinstitute.sting.WalkerTest;
-import org.broadinstitute.sting.gatk.GenomeAnalysisEngine;
-import org.broadinstitute.sting.utils.collections.Pair;
-import org.junit.Assert;
-import org.testng.annotations.DataProvider;
-import org.testng.annotations.Test;
-
-import java.io.File;
-import java.util.Arrays;
-import java.util.LinkedList;
-import java.util.List;
-import java.util.Random;
-
-public class BiasedDownsamplingIntegrationTest extends WalkerTest {
-
-    private final static String baseCommandUG = "-T UnifiedGenotyper -R " + hg19Reference + " --no_cmdline_in_header -glm BOTH -L 20:4,000,000-5,000,000";
-    private final static String baseCommandHC = "-T HaplotypeCaller -R " + hg19Reference + " --no_cmdline_in_header -L 20:4,000,000-5,000,000" + " --useFilteredReadsForAnnotations";
-
-    private final String ArtificalBAMLocation = privateTestDir + "ArtificallyContaminatedBams/";
-
-
-    // --------------------------------------------------------------------------------------------------------------
-    //
-    // testing UnifiedGenotyper contamination down-sampling on BAMs with artificially created contaminated.
-    //
-    // --------------------------------------------------------------------------------------------------------------
-
-    @Test
-    private void testDefaultContamination() {
-        final String bam1 = "NA11918.with.1.NA12842.reduced.bam";
-        final String bam2 = "NA12842.with.1.NA11918.reduced.bam";
-
-        WalkerTestSpec spec = new WalkerTestSpec(
-                baseCommandUG + " -I " + ArtificalBAMLocation + bam1 + " -I " + ArtificalBAMLocation + bam2 + " -o %s -contamination .05 ", 1,
-                Arrays.asList("b13612312ff991cf40ddc44255e76ecd"));
-        executeTest("test contamination on Artificial Contamination (flat) on " + bam1 + " and " + bam2 + " with .05 downsampling.", spec);
-    }
-
-
-    // verify that inputing a file with an effectively flat contamination level is equivalent to handing in a flat contamination level
-
-
-    @DataProvider(name="PerSampleEqualFlatContamBams")
-    public Object[][] makePerSampleEqualFlatContamBams() {
-        final List<Object[]> tests = new LinkedList<Object[]>();
-        tests.add(new Object[]{"NA11918.with.2.NA12842.reduced.bam", "NA12842.with.1.NA11918.reduced.bam", ArtificalBAMLocation + "contamination.case.6.txt", 0.0}) ;
-        tests.add(new Object[]{"NA11918.with.2.NA12842.reduced.bam", "NA12842.with.1.NA11918.reduced.bam", ArtificalBAMLocation + "contamination.case.7.txt", 0.15}) ;
-        tests.add(new Object[]{"NA11918.with.2.NA12842.reduced.bam", "NA12842.with.1.NA11918.reduced.bam", ArtificalBAMLocation + "contamination.case.8.txt", 0.3}) ;
-
-        return tests.toArray(new Object[][]{});
-    }
-
-    @Test(dataProvider = "PerSampleEqualFlatContamBams")
-    private void testPerSampleEqualsFlat(final String bam1, final String bam2, final String persampleFile, final Double downsampling) {
-        final String command =  baseCommandUG + " -I " + ArtificalBAMLocation + bam1 + " -I " + ArtificalBAMLocation + bam2 + " -o %s  ";
-
-        WalkerTestSpec spec = new WalkerTestSpec( command +" -contaminationFile " + persampleFile, 1, Arrays.asList(""));
-        final Random rnd = GenomeAnalysisEngine.getRandomGenerator();
-
-        rnd.setSeed(123451); // so that the two test cases have a hope of giving the same result
-        Pair<List<File>, List<String>> test1 = executeTest("test contamination on Artificial Contamination, with per-sample file on " + bam1 + " and " + bam2 + " with " + persampleFile, spec);
-
-        spec = new WalkerTestSpec(command + "-contamination " + downsampling.toString(), 1, Arrays.asList(""));
-
-        rnd.setSeed(123451); // so that the two test cases have a hope of giving the same result
-        Pair<List<File>, List<String>> test2 = executeTest("test contamination on Artificial Contamination, with flat contamination on " + bam1 + " and " + bam2 + " with " + downsampling.toString(), spec);
-
-        //verify that the md5s match up.
-        Assert.assertEquals(test1.getSecond().get(0),test2.getSecond().get(0));
-    }
-
-    // --------------------------------------------------------------------------------------------------------------
-    //
-    // testing HaplotypeCaller Contamination Removal
-    //
-    // --------------------------------------------------------------------------------------------------------------
-
-
-
-    @DataProvider(name="PerSampleEqualFlatContamBamsHC")
-    public Object[][] makePerSampleEqualFlatContamBamsHC() {
-        final List<Object[]> tests = new LinkedList<Object[]>();
-        tests.add(new Object[]{"NA11918.with.2.NA12842.reduced.bam", "NA12842.with.1.NA11918.reduced.bam", ArtificalBAMLocation + "contamination.case.6.txt", 0.0 }) ;
-        tests.add(new Object[]{"NA11918.with.2.NA12842.reduced.bam", "NA12842.with.1.NA11918.reduced.bam", ArtificalBAMLocation + "contamination.case.7.txt", 0.15}) ;
-        tests.add(new Object[]{"NA11918.with.2.NA12842.reduced.bam", "NA12842.with.1.NA11918.reduced.bam", ArtificalBAMLocation + "contamination.case.8.txt", 0.3}) ;
-
-        return tests.toArray(new Object[][]{});
-    }
-
-
-    @Test(dataProvider = "PerSampleEqualFlatContamBamsHC")
-    private void testPerSampleEqualsFlatHC(final String bam1, final String bam2, final String persampleFile, final Double downsampling) {
-        final String command =  baseCommandHC + " -I " + ArtificalBAMLocation + bam1 + " -I " + ArtificalBAMLocation + bam2 + " -o %s  ";
-
-        WalkerTestSpec spec = new WalkerTestSpec( command +" -contaminationFile " + persampleFile, 1, Arrays.asList(""));
-        final Random rnd = GenomeAnalysisEngine.getRandomGenerator();
-
-        rnd.setSeed(123451); // so that the two test cases have a hope of giving the same result
-
-        Pair<List<File>, List<String>> test1= executeTest("test contamination on Artificial Contamination, with per-sample file on " + bam1 + " and " + bam2 + " with " + persampleFile, spec);
-
-        WalkerTestSpec spec2 = new WalkerTestSpec(command + "-contamination " + downsampling.toString(), 1, Arrays.asList(""));
-
-        rnd.setSeed(123451); // so that the two test cases have a hope of giving the same result
-        Pair<List<File>, List<String>> test2=executeTest("test contamination on Artificial Contamination, with flat contamination on " + bam1 + " and " + bam2 + " with " + downsampling.toString(), spec);
-
-        //verify that the md5s match up.
-        Assert.assertEquals(test1.getSecond().get(0),test2.getSecond().get(0));
-
-    }
-
-
-
-}
\ No newline at end of file
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/genotyper/UnifiedGenotyperReducedReadsIntegrationTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/genotyper/UnifiedGenotyperReducedReadsIntegrationTest.java
deleted file mode 100644
index df749231e..000000000
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/genotyper/UnifiedGenotyperReducedReadsIntegrationTest.java
+++ /dev/null
@@ -1,87 +0,0 @@
-/*
-*  By downloading the PROGRAM you agree to the following terms of use:
-*  
-*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
-*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
-*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
-*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
-*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
-*  1. DEFINITIONS
-*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
-*  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
-*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
-*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
-*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
-*  Copyright 2012 Broad Institute, Inc.
-*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
-*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
-*  4. INDEMNIFICATION
-*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
-*  5. NO REPRESENTATIONS OR WARRANTIES
-*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
-*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
-*  6. ASSIGNMENT
-*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
-*  7. MISCELLANEOUS
-*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
-*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
-*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
-*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
-*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
-*/
-
-package org.broadinstitute.sting.gatk.walkers.genotyper;
-
-import org.broadinstitute.sting.WalkerTest;
-import org.testng.annotations.Test;
-
-import java.util.Arrays;
-
-public class UnifiedGenotyperReducedReadsIntegrationTest extends WalkerTest {
-
-    // --------------------------------------------------------------------------------------------------------------
-    //
-    // testing reduced reads
-    //
-    // --------------------------------------------------------------------------------------------------------------
-
-    @Test
-    public void testReducedBam() {
-        WalkerTest.WalkerTestSpec spec = new WalkerTest.WalkerTestSpec(
-                "-T UnifiedGenotyper --contamination_fraction_to_filter 0.05 --disableDithering -R " + b37KGReference + " --no_cmdline_in_header -I " + privateTestDir + "bamExample.ReducedRead.ADAnnotation.bam -o %s -L 1:67,225,396-67,288,518", 1,
-                Arrays.asList("ffde0d5e23523e4bd9e7e18f62d37d0f"));
-        executeTest("test calling on a ReducedRead BAM", spec);
-    }
-
-    @Test
-    public void testReducedBamSNPs() {
-        testReducedCalling("SNP", "cc0508b18028f2e84e6a42c1ff23721c");
-    }
-
-    @Test
-    public void testReducedBamINDELs() {
-        testReducedCalling("INDEL", "6fc00d5299b1bf334d39634c3409a69d");
-    }
-
-
-    private void testReducedCalling(final String model, final String md5) {
-        WalkerTest.WalkerTestSpec spec = new WalkerTest.WalkerTestSpec(
-                "-T UnifiedGenotyper --contamination_fraction_to_filter 0.05 --disableDithering -R " + b37KGReference + " --no_cmdline_in_header -I " + privateTestDir + "NA12878.HiSeq.b37.chr20.10_11mb.reduced.bam -o %s -L 20:10,000,000-10,500,000 -glm " + model, 1,
-                Arrays.asList(md5));
-        executeTest("test calling on a ReducedRead BAM with " + model, spec);
-    }
-}
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/AssemblyResultSetUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/AssemblyResultSetUnitTest.java
index af66d7f88..664afda51 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/AssemblyResultSetUnitTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/AssemblyResultSetUnitTest.java
@@ -171,7 +171,7 @@ public class AssemblyResultSetUnitTest extends BaseTest
 
         final ReadThreadingGraph rtg = new ReadThreadingGraph(10);
         for (final Haplotype h : haplotypes)
-            rtg.addSequence("seq-" + Math.abs(h.hashCode()), h.getBases(), null, h.isReference());
+            rtg.addSequence("seq-" + Math.abs(h.hashCode()), h.getBases(), h.isReference());
         final SeqGraph seqGraph = rtg.convertToSequenceGraph();
         final AssemblyResult ar = new AssemblyResult(AssemblyResult.Status.ASSEMBLED_SOME_VARIATION,seqGraph);
         ar.setThreadingGraph(rtg);
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCallerIntegrationTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCallerIntegrationTest.java
index 615c62c43..c95a3a839 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCallerIntegrationTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCallerIntegrationTest.java
@@ -217,28 +217,6 @@ public class HaplotypeCallerIntegrationTest extends WalkerTest {
     }
 
 
-    // --------------------------------------------------------------------------------------------------------------
-    //
-    // testing reduced reads
-    //
-    // --------------------------------------------------------------------------------------------------------------
-
-    @Test
-    public void HCTestReducedBam() {
-        WalkerTest.WalkerTestSpec spec = new WalkerTest.WalkerTestSpec(
-                "-T HaplotypeCaller --contamination_fraction_to_filter 0.05 --disableDithering --pcr_indel_model NONE -R " + b37KGReference + " --no_cmdline_in_header -I " + privateTestDir + "bamExample.ReducedRead.ADAnnotation.bam -o %s -L 1:67,225,396-67,288,518", 1,
-                Arrays.asList("12c56262ed30db1249b8d722e324357c"));
-        executeTest("HC calling on a ReducedRead BAM", spec);
-    }
-
-    @Test
-    public void testReducedBamWithReadsNotFullySpanningDeletion() {
-        WalkerTest.WalkerTestSpec spec = new WalkerTest.WalkerTestSpec(
-                "-T HaplotypeCaller --contamination_fraction_to_filter 0.05 --disableDithering --pcr_indel_model NONE -R " + b37KGReference + " --no_cmdline_in_header -I " + privateTestDir + "reduced.readNotFullySpanningDeletion.bam -o %s -L 1:167871297", 1,
-                Arrays.asList("1627cf5f3a97e8b73b3c095db46aef1b"));
-        executeTest("test calling on a ReducedRead BAM where the reads do not fully span a deletion", spec);
-    }
-
     // --------------------------------------------------------------------------------------------------------------
     //
     // test dbSNP annotation
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/ReferenceConfidenceModelUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/ReferenceConfidenceModelUnitTest.java
index 7d218c19c..309fd2549 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/ReferenceConfidenceModelUnitTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/ReferenceConfidenceModelUnitTest.java
@@ -157,26 +157,6 @@ public class ReferenceConfidenceModelUnitTest extends BaseTest {
         }
     }
 
-    @Test
-    public void testCalcNIndelInformativeReducedReads() {
-        final String bases = "ACGGGTTTGGAC";
-        final byte[] quals = Utils.dupBytes((byte)30, bases.length());
-        final int count = 10;
-        final int[] counts = new int[bases.length()];
-        for ( int i = 0; i < counts.length; i++ )
-            counts[i] = count;
-        final int position = 100;
-
-        final GATKSAMRecord read = ArtificialSAMUtils.createArtificialReducedRead(header, "foo", 0, position, counts.length, counts);
-        read.setReadString(bases);
-        read.setBaseQualities(quals);
-        read.setCigarString(bases.length() + "M");
-        final GenomeLoc loc = new UnvalidatingGenomeLoc("20", 0, position, position);
-        final ReadBackedPileup pileup = new ReadBackedPileupImpl(loc, Collections.singletonList(read), 0);
-        final int actual = model.calcNIndelInformativeReads(pileup, 0, bases.getBytes(), 3);
-        Assert.assertEquals(actual, count);
-    }
-
     @Test
     public void testClose() {
         model.close();
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraphUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraphUnitTest.java
index 0d9c07251..f6e2a106f 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraphUnitTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraphUnitTest.java
@@ -79,8 +79,8 @@ public class ReadThreadingGraphUnitTest extends BaseTest {
         final ReadThreadingGraph assembler = new ReadThreadingGraph(11);
         final String ref   = "CATGCACTTTAAAACTTGCCTTTTTAACAAGACTTCCAGATG";
         final String alt   = "CATGCACTTTAAAACTTGCCGTTTTAACAAGACTTCCAGATG";
-        assembler.addSequence("anonymous", getBytes(ref), null, true);
-        assembler.addSequence("anonymous", getBytes(alt), null, false);
+        assembler.addSequence("anonymous", getBytes(ref), true);
+        assembler.addSequence("anonymous", getBytes(alt), false);
         assembler.buildGraphIfNecessary();
         Assert.assertNotEquals(ref.length() - 11 + 1,assembler.vertexSet().size(),"the number of vertex in the graph is the same as if there was no alternative sequence");
         Assert.assertEquals(ref.length() - 11 + 1 + 11,assembler.vertexSet().size(),"the number of vertex in the graph is not the same as if there is an alternative sequence");
@@ -178,7 +178,7 @@ public class ReadThreadingGraphUnitTest extends BaseTest {
 
         // test that there are cycles detected for small kmer
         final ReadThreadingGraph rtgraph25 = new ReadThreadingGraph(25);
-        rtgraph25.addSequence("ref", ref.getBytes(), null, true);
+        rtgraph25.addSequence("ref", ref.getBytes(), true);
         for ( final GATKSAMRecord read : reads )
             rtgraph25.addRead(read);
         rtgraph25.buildGraphIfNecessary();
@@ -186,7 +186,7 @@ public class ReadThreadingGraphUnitTest extends BaseTest {
 
         // test that there are no cycles detected for large kmer
         final ReadThreadingGraph rtgraph75 = new ReadThreadingGraph(75);
-        rtgraph75.addSequence("ref", ref.getBytes(), null, true);
+        rtgraph75.addSequence("ref", ref.getBytes(), true);
         for ( final GATKSAMRecord read : reads )
             rtgraph75.addRead(read);
         rtgraph75.buildGraphIfNecessary();
@@ -200,7 +200,7 @@ public class ReadThreadingGraphUnitTest extends BaseTest {
         final byte[] ref = Utils.dupBytes((byte)'A', length);
 
         final ReadThreadingGraph rtgraph = new ReadThreadingGraph(25);
-        rtgraph.addSequence("ref", ref, null, true);
+        rtgraph.addSequence("ref", ref, true);
 
         // add reads with Ns at any position
         for ( int i = 0; i < length; i++ ) {
@@ -250,7 +250,7 @@ public class ReadThreadingGraphUnitTest extends BaseTest {
 
         // create the graph and populate it
         final ReadThreadingGraph rtgraph = new ReadThreadingGraph(kmerSize);
-        rtgraph.addSequence("ref", ref.getBytes(), null, true);
+        rtgraph.addSequence("ref", ref.getBytes(), true);
         final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(alt.getBytes(), Utils.dupBytes((byte) 30, alt.length()), alt.length() + "M");
         rtgraph.addRead(read);
         rtgraph.buildGraphIfNecessary();
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/SequenceForKmersUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/SequenceForKmersUnitTest.java
index 7c3160c30..fe381513e 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/SequenceForKmersUnitTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/SequenceForKmersUnitTest.java
@@ -55,26 +55,12 @@ public class SequenceForKmersUnitTest extends BaseTest {
     @Test
     public void testNoCount() {
         final byte[] seq = "ACGT".getBytes();
-        final SequenceForKmers sk = new SequenceForKmers("foo", seq, 0, seq.length, null, true);
+        final SequenceForKmers sk = new SequenceForKmers("foo", seq, 0, seq.length, 1, true);
         Assert.assertEquals(sk.name, "foo");
         Assert.assertEquals(sk.sequence, seq);
         Assert.assertEquals(sk.start, 0);
         Assert.assertEquals(sk.stop, seq.length);
+        Assert.assertEquals(sk.count, 1);
         Assert.assertEquals(sk.isRef, true);
-        for ( int i = 0; i < seq.length; i++ )
-            Assert.assertEquals(sk.getCount(i), 1);
-    }
-
-    @Test
-    public void testWithCounts() {
-        final int len = 256;
-        final int[] counts = new int[len];
-        for ( int i = 0; i < len; i++ ) counts[i] = i;
-        final byte[] seq = Utils.dupBytes((byte)'A', len);
-
-        final SequenceForKmers sk = new SequenceForKmers("foo", seq, 0, seq.length, counts, true);
-
-        for ( int i = 0; i < seq.length; i++ )
-            Assert.assertEquals(sk.getCount(i), i);
     }
 }
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/utils/pairhmm/ActiveRegionTestDataSet.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/utils/pairhmm/ActiveRegionTestDataSet.java
index 84b995749..1e5417227 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/utils/pairhmm/ActiveRegionTestDataSet.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/utils/pairhmm/ActiveRegionTestDataSet.java
@@ -116,9 +116,9 @@ public class ActiveRegionTestDataSet {
     public AssemblyResultSet assemblyResultSet() {
         if (assemblyResultSet == null) {
             final ReadThreadingGraph rtg = new ReadThreadingGraph(kmerSize);
-            rtg.addSequence("anonymous", this.getReference().getBytes(), null, true);
+            rtg.addSequence("anonymous", this.getReference().getBytes(), true);
             for (final String haplotype : this.haplotypesStrings()) {
-                rtg.addSequence("anonymous", haplotype.getBytes(), null, false);
+                rtg.addSequence("anonymous", haplotype.getBytes(), false);
             }
             rtg.buildGraphIfNecessary();
             if (rtg.hasCycles())
diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/datasources/reads/SAMDataSource.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/datasources/reads/SAMDataSource.java
index 9dc9734a5..4f680ffc3 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/datasources/reads/SAMDataSource.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/datasources/reads/SAMDataSource.java
@@ -31,7 +31,6 @@ import net.sf.samtools.*;
 import net.sf.samtools.util.CloseableIterator;
 import net.sf.samtools.util.RuntimeIOException;
 import org.apache.log4j.Logger;
-import org.broadinstitute.sting.commandline.Tags;
 import org.broadinstitute.sting.gatk.ReadMetrics;
 import org.broadinstitute.sting.gatk.ReadProperties;
 import org.broadinstitute.sting.gatk.arguments.ValidationExclusion;
@@ -48,10 +47,8 @@ import org.broadinstitute.sting.utils.exceptions.ReviewedStingException;
 import org.broadinstitute.sting.utils.exceptions.UserException;
 import org.broadinstitute.sting.utils.sam.GATKSAMReadGroupRecord;
 import org.broadinstitute.sting.utils.sam.GATKSamRecordFactory;
-import org.broadinstitute.sting.utils.text.XReadLines;
 
 import java.io.File;
-import java.io.FileNotFoundException;
 import java.lang.reflect.InvocationTargetException;
 import java.lang.reflect.Method;
 import java.util.*;
@@ -327,6 +324,8 @@ public class SAMDataSource {
         // and read group id (merged) -> read group id (original) mappings.
         for(SAMReaderID id: readerIDs) {
             SAMFileReader reader = readers.getReader(id);
+            checkForReducedBamFile(reader.getFileHeader());
+
             ReadGroupMapping mappingToMerged = new ReadGroupMapping();
 
             List<SAMReadGroupRecord> readGroups = reader.getFileHeader().getReadGroups();
@@ -352,6 +351,16 @@ public class SAMDataSource {
         resourcePool.releaseReaders(readers);
     }
 
+    /**
+     * Checks whether the provided SAM header if from a reduced bam file.
+     * @param header the SAM header for a given file
+     * @throws UserException if the header is from a reduced bam
+     */
+    private void checkForReducedBamFile(final SAMFileHeader header) {
+        if ( header.getProgramRecord("GATK ReduceReads") != null )
+            throw new UserException("The GATK no longer supports running off of BAMs produced by ReduceReads");
+    }
+
     public void close() {
         SAMReaders readers = resourcePool.getAvailableReaders();
         for(SAMReaderID readerID: readerIDs) {
diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/downsampling/AlleleBiasedDownsamplingUtils.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/downsampling/AlleleBiasedDownsamplingUtils.java
index fb7a16bfd..56c370276 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/downsampling/AlleleBiasedDownsamplingUtils.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/downsampling/AlleleBiasedDownsamplingUtils.java
@@ -65,18 +65,14 @@ public class AlleleBiasedDownsamplingUtils {
             alleleStratifiedElements[i] = new PileupElementList();
 
         // start by stratifying the reads by the alleles they represent at this position
-        boolean sawReducedRead = false;
         for ( final PileupElement pe : pileup ) {
-            if ( pe.getRead().isReducedRead() )
-                sawReducedRead = true;
-
             final int baseIndex = BaseUtils.simpleBaseToBaseIndex(pe.getBase());
             if ( baseIndex != -1 )
                 alleleStratifiedElements[baseIndex].add(pe);
         }
 
         // make a listing of allele counts and calculate the total count
-        final int[] alleleCounts = calculateAlleleCounts(alleleStratifiedElements, sawReducedRead);
+        final int[] alleleCounts = calculateAlleleCounts(alleleStratifiedElements);
         final int totalAlleleCount = (int)MathUtils.sum(alleleCounts);
 
         // do smart down-sampling
@@ -106,18 +102,12 @@ public class AlleleBiasedDownsamplingUtils {
      * Calculates actual allele counts for each allele (which can be different than the list size when reduced reads are present)
      *
      * @param alleleStratifiedElements       pileup elements stratified by allele
-     * @param sawReducedRead                 is at least one read a reduced read?
      * @return non-null int array representing allele counts
      */
-    private static int[] calculateAlleleCounts(final PileupElementList[] alleleStratifiedElements, final boolean sawReducedRead) {
+    private static int[] calculateAlleleCounts(final PileupElementList[] alleleStratifiedElements) {
         final int[] alleleCounts = new int[alleleStratifiedElements.length];
         for ( int i = 0; i < alleleStratifiedElements.length; i++ ) {
-            if ( !sawReducedRead ) {
-                alleleCounts[i] = alleleStratifiedElements[i].size();
-            } else {
-                for ( final PileupElement pe : alleleStratifiedElements[i] )
-                    alleleCounts[i] += pe.getRepresentativeCount();
-            }
+            alleleCounts[i] = alleleStratifiedElements[i].size();
         }
         return alleleCounts;
     }
@@ -211,24 +201,7 @@ public class AlleleBiasedDownsamplingUtils {
 
         int currentBitSetIndex = 0;
         for ( final PileupElement element : elements ) {
-
-            final int representativeCount = element.getRepresentativeCount();
-
-            // if it's a reduced read, we need to be smart about how we down-sample
-            if ( representativeCount > 1 ) {
-                // count how many bits are set over the span represented by this read
-                int setBits = 0;
-                for ( int i = 0; i < representativeCount; i++ )
-                    setBits += itemsToRemove.get(currentBitSetIndex++) ? 1 : 0;
-
-                // remove that count from the count of the reduced read
-                if ( setBits == representativeCount )
-                    elementsToRemove.add(element);
-                else
-                    element.adjustRepresentativeCount(-1 * setBits);
-            }
-            // otherwise it's trivial: remove if the corresponding bit is set
-            else if ( itemsToRemove.get(currentBitSetIndex++) ) {
+            if ( itemsToRemove.get(currentBitSetIndex++) ) {
                 elementsToRemove.add(element);
             }
         }
@@ -255,7 +228,6 @@ public class AlleleBiasedDownsamplingUtils {
         alleles.remove(Allele.NO_CALL);    // ignore the no-call bin
         final int numAlleles = alleles.size();
 
-        // TODO -- if we ever decide to make this work for reduced reads, this will need to use the representative counts instead
         final int[] alleleCounts = new int[numAlleles];
         for ( int i = 0; i < numAlleles; i++ )
             alleleCounts[i] = alleleReadMap.get(alleles.get(i)).size();
@@ -302,9 +274,6 @@ public class AlleleBiasedDownsamplingUtils {
 
         int currentBitSetIndex = 0;
         for ( final GATKSAMRecord read : reads ) {
-            if ( read.isReducedRead() )
-                throw new IllegalStateException("Allele-biased downsampling of reduced reads has not been implemented for a list of GATKSAMRecords");
-
             if ( itemsToRemove.get(currentBitSetIndex++) )
                 elementsToRemove.add(read);
         }
diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/downsampling/Downsampler.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/downsampling/Downsampler.java
index 466ade1ed..7b42f75f9 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/downsampling/Downsampler.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/downsampling/Downsampler.java
@@ -25,9 +25,6 @@
 
 package org.broadinstitute.sting.gatk.downsampling;
 
-import org.broadinstitute.sting.utils.locusiterator.AlignmentStateMachine;
-import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
-
 import java.util.Collection;
 import java.util.List;
 
@@ -159,14 +156,6 @@ public abstract class Downsampler<T> {
      * @return true if the item should not be subject to elimination during downsampling, otherwise false
      */
     protected boolean doNotDiscardItem( final Object item ) {
-        // Use getClass() rather than instanceof for performance reasons. Ugly but fast.
-        if ( item.getClass() == GATKSAMRecord.class ) {
-            return ((GATKSAMRecord)item).isReducedRead();
-        }
-        else if ( item.getClass() == AlignmentStateMachine.class ) {
-            return ((AlignmentStateMachine)item).isReducedRead();
-        }
-
         return false;
     }
 }
diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/walkers/coverage/CallableLoci.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/walkers/coverage/CallableLoci.java
index e30965925..2e38f5daa 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/walkers/coverage/CallableLoci.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/walkers/coverage/CallableLoci.java
@@ -314,14 +314,13 @@ public class CallableLoci extends LocusWalker<CallableLoci.CallableBaseState, Ca
             // count up the depths of all and QC+ bases
             int rawDepth = 0, QCDepth = 0, lowMAPQDepth = 0;
             for (PileupElement e : context.getBasePileup()) {
-                final int depth = e.getRepresentativeCount();
-                rawDepth += depth;
+                rawDepth++;
 
                 if (e.getMappingQual() <= maxLowMAPQ)
-                    lowMAPQDepth += depth;
+                    lowMAPQDepth++;
 
                 if (e.getMappingQual() >= minMappingQuality && (e.getQual() >= minBaseQuality || e.isDeletion())) {
-                    QCDepth += depth;
+                    QCDepth++;
                 }
             }
 
diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/walkers/coverage/CoverageUtils.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/walkers/coverage/CoverageUtils.java
index f0d6f7301..0d61af305 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/walkers/coverage/CoverageUtils.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/walkers/coverage/CoverageUtils.java
@@ -217,12 +217,12 @@ public class CoverageUtils {
 
     private static void updateCounts(int[] counts, PileupElement e) {
         if ( e.isDeletion() ) {
-            counts[BaseUtils.Base.D.ordinal()] += e.getRepresentativeCount();
+            counts[BaseUtils.Base.D.ordinal()]++;
         } else if ( BaseUtils.basesAreEqual(BaseUtils.Base.N.base, e.getBase()) ) {
-            counts[BaseUtils.Base.N.ordinal()] += e.getRepresentativeCount();
+            counts[BaseUtils.Base.N.ordinal()]++;
         } else {
             try {
-                counts[BaseUtils.simpleBaseToBaseIndex(e.getBase())] += e.getRepresentativeCount();
+                counts[BaseUtils.simpleBaseToBaseIndex(e.getBase())]++;
             } catch (ArrayIndexOutOfBoundsException exc) {
                 throw new ReviewedStingException("Expected a simple base, but actually received"+(char)e.getBase());
             }
diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/DeprecatedToolChecks.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/DeprecatedToolChecks.java
index 9823e524a..f867f76c2 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/DeprecatedToolChecks.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/DeprecatedToolChecks.java
@@ -42,6 +42,7 @@ public class DeprecatedToolChecks {
     private static Object2ObjectMap deprecatedGATKWalkers = new Object2ObjectOpenHashMap();
     static {
         // Indicate recommended replacement in parentheses if applicable
+        deprecatedGATKWalkers.put("ReduceReads", "3.0 (use recommended best practices pipeline with the HaplotypeCaller)");
         deprecatedGATKWalkers.put("CountCovariates", "2.0 (use BaseRecalibrator instead; see documentation for usage)");
         deprecatedGATKWalkers.put("TableRecalibration", "2.0 (use PrintReads with -BQSR instead; see documentation for usage)");
         deprecatedGATKWalkers.put("AlignmentWalker", "2.2 (no replacement)");
diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/clipping/ClippingOp.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/clipping/ClippingOp.java
index 7d5823ae0..fd04dbc21 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/clipping/ClippingOp.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/clipping/ClippingOp.java
@@ -399,12 +399,6 @@ public class ClippingOp {
             hardClippedRead.setBaseQualities(newBaseDeletionQuals, EventType.BASE_DELETION);
         }
 
-        if (read.isReducedRead()) {
-            final int[] reducedCounts = new int[newLength];
-            System.arraycopy(read.getReducedReadCounts(), copyStart, reducedCounts, 0, newLength);
-            hardClippedRead.setReducedReadCounts(reducedCounts);
-        }
-
         return hardClippedRead;
 
     }
diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/genotyper/PerReadAlleleLikelihoodMap.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/genotyper/PerReadAlleleLikelihoodMap.java
index b7cd03919..49ec6f20a 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/genotyper/PerReadAlleleLikelihoodMap.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/genotyper/PerReadAlleleLikelihoodMap.java
@@ -32,7 +32,6 @@ import org.broadinstitute.sting.utils.MathUtils;
 import org.broadinstitute.sting.utils.pileup.PileupElement;
 import org.broadinstitute.sting.utils.pileup.ReadBackedPileup;
 import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
-import org.broadinstitute.sting.utils.sam.ReadUtils;
 import org.broadinstitute.variant.variantcontext.Allele;
 
 import java.util.*;
@@ -115,13 +114,9 @@ public class PerReadAlleleLikelihoodMap {
             alleleReadMap.put(allele, new ArrayList<GATKSAMRecord>());
 
         for ( final Map.Entry<GATKSAMRecord, Map<Allele, Double>> entry : likelihoodReadMap.entrySet() ) {
-            // TODO -- come up with a strategy for down-sampling reduced reads
-            // Currently we are unable to remove reduced reads because their representative base count differs throughout the read
-            if ( !entry.getKey().isReducedRead() ) {
-                final MostLikelyAllele bestAllele = getMostLikelyAllele(entry.getValue());
-                if ( bestAllele.isInformative() )
-                    alleleReadMap.get(bestAllele.getMostLikelyAllele()).add(entry.getKey());
-            }
+            final MostLikelyAllele bestAllele = getMostLikelyAllele(entry.getValue());
+            if ( bestAllele.isInformative() )
+                alleleReadMap.get(bestAllele.getMostLikelyAllele()).add(entry.getKey());
         }
 
         return alleleReadMap;
@@ -233,10 +228,9 @@ public class PerReadAlleleLikelihoodMap {
                 for( final Map.Entry<GATKSAMRecord, Map<Allele,Double>> entry : likelihoodReadMap.entrySet() ) {
                     // Compute log10(10^x1/2 + 10^x2/2) = log10(10^x1+10^x2)-log10(2)
                     final GATKSAMRecord read = entry.getKey();
-                    final int count = ReadUtils.getMeanRepresentativeReadCount(read);
                     final double likelihood_iii = entry.getValue().get(iii_allele);
                     final double likelihood_jjj = entry.getValue().get(jjj_allele);
-                    haplotypeLikelihood += count * (MathUtils.approximateLog10SumLog10(likelihood_iii, likelihood_jjj) + MathUtils.LOG_ONE_HALF);
+                    haplotypeLikelihood += MathUtils.approximateLog10SumLog10(likelihood_iii, likelihood_jjj) + MathUtils.LOG_ONE_HALF;
 
                     // fast exit.  If this diploid pair is already worse than the max, just stop and look at the next pair
                     if ( haplotypeLikelihood < maxElement ) break;
diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/locusiterator/AlignmentStateMachine.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/locusiterator/AlignmentStateMachine.java
index 86f3500be..c4b566582 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/locusiterator/AlignmentStateMachine.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/locusiterator/AlignmentStateMachine.java
@@ -123,15 +123,6 @@ public class AlignmentStateMachine {
         return getRead().getReferenceIndex();
     }
 
-    /**
-     * Is our read a reduced read?
-     *
-     * @return true if the read we encapsulate is a reduced read, otherwise false
-     */
-    public boolean isReducedRead() {
-        return read.isReducedRead();
-    }
-
     /**
      * Is this the left edge state?  I.e., one that is before or after the current read?
      * @return true if this state is an edge state, false otherwise
diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/pileup/PileupElement.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/pileup/PileupElement.java
index 8a034dde0..42cfc9492 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/pileup/PileupElement.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/pileup/PileupElement.java
@@ -30,8 +30,6 @@ import com.google.java.contract.Requires;
 import net.sf.samtools.CigarElement;
 import net.sf.samtools.CigarOperator;
 import org.broadinstitute.sting.utils.BaseUtils;
-import org.broadinstitute.sting.utils.MathUtils;
-import org.broadinstitute.sting.utils.exceptions.UserException;
 import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
 
 import java.util.Arrays;
@@ -296,43 +294,6 @@ public class PileupElement implements Comparable<PileupElement> {
     //
     // --------------------------------------------------------------------------
 
-    /**
-     * Returns the number of elements in the pileup element.
-     *
-     * Unless this is a reduced read, the number of elements in a pileup element is one. In the event of
-     * this being a reduced read and a deletion, we return the average number of elements between the left
-     * and right elements to the deletion. We assume the deletion to be left aligned.
-     *
-     * @return the representative count
-     */
-    public int getRepresentativeCount() {
-        if (read.isReducedRead())     {
-            if (isDeletion() && (offset + 1 >= read.getReadLength()) )  // deletion in the end of the read
-                throw new UserException.MalformedBAM(read, String.format("Adjacent I/D events in read %s -- cigar: %s", read.getReadName(), read.getCigarString()));
-
-            return isDeletion()
-                    ? MathUtils.fastRound((read.getReducedCount(offset) + read.getReducedCount(offset + 1)) / 2.0)
-                    : read.getReducedCount(offset);
-        } else {
-            return 1;
-        }
-    }
-
-    /**
-     * Adjusts the representative count of this pileup element.
-     * Throws an exception if this element does not represent a reduced read.
-     *
-     * See GATKSAMRecord.adjustReducedCount() for warnings on the permanency of this operation.
-     *
-     * @param adjustmentFactor   how much to adjust the representative count (can be positive or negative)
-     */
-    public void adjustRepresentativeCount(final int adjustmentFactor) {
-        if ( read.isReducedRead() )
-            read.adjustReducedCount(offset, adjustmentFactor);
-        else
-            throw new IllegalArgumentException("Trying to adjust the representative count of a read that is not reduced");
-    }
-
     /**
      * Get the cigar element aligning this element to the genome
      * @return a non-null CigarElement
diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/pileup/ReadBackedPileupImpl.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/pileup/ReadBackedPileupImpl.java
index 455a6aa12..6ccf74e4e 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/pileup/ReadBackedPileupImpl.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/pileup/ReadBackedPileupImpl.java
@@ -811,10 +811,7 @@ public class ReadBackedPileupImpl implements ReadBackedPileup {
     @Override
     public int depthOfCoverage() {
         if (depthOfCoverage == UNINITIALIZED_CACHED_INT_VALUE) {
-            depthOfCoverage = 0;
-            for (PileupElement p : pileupElementTracker.unorderedIterable()) {
-                depthOfCoverage += p.getRepresentativeCount();
-            }
+            depthOfCoverage = pileupElementTracker.size();
         }
         return depthOfCoverage;
     }
diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/sam/ArtificialSAMUtils.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/sam/ArtificialSAMUtils.java
index 055f8630b..b8367a7df 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/sam/ArtificialSAMUtils.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/sam/ArtificialSAMUtils.java
@@ -324,31 +324,6 @@ public class ArtificialSAMUtils {
         return Arrays.asList(left, right);
     }
 
-    /**
-     * Create an artificial reduced read based on the parameters.  The cigar string will be *M, where * is the
-     * length of the read. The base counts specified in the baseCounts array will be stored fully encoded in
-     * the RR attribute.
-     *
-     * @param header         the SAM header to associate the read with
-     * @param name           the name of the read
-     * @param refIndex       the reference index, i.e. what chromosome to associate it with
-     * @param alignmentStart where to start the alignment
-     * @param length         the length of the read
-     * @param baseCounts     reduced base counts to encode in the RR attribute; length must match the read length
-     * @return the artificial reduced read
-     */
-    public static GATKSAMRecord createArtificialReducedRead( final SAMFileHeader header,
-                                                             final String name,
-                                                             final int refIndex,
-                                                             final int alignmentStart,
-                                                             final int length,
-                                                             final int[] baseCounts ) {
-        final GATKSAMRecord read = createArtificialRead(header, name, refIndex, alignmentStart, length);
-        read.setReducedReadCounts(baseCounts);
-        read.setReducedReadCountsTag();
-        return read;
-    }
-
     /**
      * Create a collection of identical artificial reads based on the parameters.  The cigar string for each
      * read will be *M, where * is the length of the read.
diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/sam/GATKSAMRecord.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/sam/GATKSAMRecord.java
index 93718b04d..52e6e1c25 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/sam/GATKSAMRecord.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/sam/GATKSAMRecord.java
@@ -27,7 +27,6 @@ package org.broadinstitute.sting.utils.sam;
 
 import com.google.java.contract.Ensures;
 import net.sf.samtools.*;
-import org.broadinstitute.sting.utils.MathUtils;
 import org.broadinstitute.sting.utils.NGSPlatform;
 import org.broadinstitute.sting.utils.exceptions.ReviewedStingException;
 import org.broadinstitute.sting.utils.recalibration.EventType;
@@ -51,12 +50,6 @@ import java.util.*;
  * functions, so modifying a GATKSAMRecord in any way may result in stale cached values.
  */
 public class GATKSAMRecord extends BAMRecord {
-    // ReduceReads specific attribute tags
-    public static final String REDUCED_READ_CONSENSUS_TAG = "RR";                   // marks a synthetic read produced by the ReduceReads tool
-    public static final String REDUCED_READ_STRANDED_TAG = "RS";                    // marks a stranded synthetic read produced by the ReduceReads tool
-    public static final String REDUCED_READ_ORIGINAL_ALIGNMENT_START_SHIFT = "OP";  // reads that are clipped may use this attribute to keep track of their original alignment start
-    public static final String REDUCED_READ_ORIGINAL_ALIGNMENT_END_SHIFT = "OE";    // reads that are clipped may use this attribute to keep track of their original alignment end
-
     // Base Quality Score Recalibrator specific attribute tags
     public static final String BQSR_BASE_INSERTION_QUALITIES = "BI";                // base qualities for insertions
     public static final String BQSR_BASE_DELETION_QUALITIES = "BD";                 // base qualities for deletions
@@ -70,17 +63,15 @@ public class GATKSAMRecord extends BAMRecord {
     // the SAMRecord data we're caching
     private String mReadString = null;
     private GATKSAMReadGroupRecord mReadGroup = null;
-    private int[] reducedReadCounts = null;
     private final static int UNINITIALIZED = -1;
     private int softStart = UNINITIALIZED;
     private int softEnd = UNINITIALIZED;
     private Integer adapterBoundary = null;
 
-    private Boolean isStrandlessRead = null;
+    private boolean isStrandlessRead = false;
 
     // because some values can be null, we don't want to duplicate effort
     private boolean retrievedReadGroup = false;
-    private boolean retrievedReduceReadCounts = false;
 
     // These temporary attributes were added here to make life easier for
     // certain algorithms by providing a way to label or attach arbitrary data to
@@ -160,9 +151,6 @@ public class GATKSAMRecord extends BAMRecord {
      * @return true if this read doesn't have meaningful strand information
      */
     public boolean isStrandless() {
-        if ( isStrandlessRead == null ) {
-            isStrandlessRead = isReducedRead() && getCharacterAttribute(REDUCED_READ_STRANDED_TAG) == null;
-        }
         return isStrandlessRead;
     }
 
@@ -342,185 +330,6 @@ public class GATKSAMRecord extends BAMRecord {
         return getReadGroup().getNGSPlatform();
     }
 
-    ///////////////////////////////////////////////////////////////////////////////
-    // *** ReduceReads functions                                              ***//
-    ///////////////////////////////////////////////////////////////////////////////
-
-    /**
-     * Get the counts of the bases in this reduced read
-     *
-     * NOTE that this is not the value of the REDUCED_READ_CONSENSUS_TAG, which
-     * is encoded in a special way.  This is the actual positive counts of the
-     * depth at each bases.  So for a RR with a tag of:
-     *
-     * [10, 5, -1, -5]
-     *
-     * this function returns
-     *
-     * [10, 15, 9, 5]
-     *
-     * as one might expect.
-     *
-     * @return a int[] holding the depth of the bases in this reduced read, or null if this isn't a reduced read
-     */
-    public int[] getReducedReadCounts() {
-        if ( ! retrievedReduceReadCounts ) {
-            final byte[] tag = getByteArrayAttribute(REDUCED_READ_CONSENSUS_TAG);
-            if ( tag != null ) reducedReadCounts = decodeReduceReadCounts(tag);
-            retrievedReduceReadCounts = true;
-        }
-
-        return reducedReadCounts;
-    }
-
-    /**
-     * The number of bases corresponding the i'th base of the reduced read.
-     *
-     * @param i the read based coordinate inside the read
-     * @return the number of bases corresponding to the i'th base of the reduced read
-     */
-    public final int getReducedCount(final int i) {
-        if ( !isReducedRead() )
-            throw new IllegalArgumentException("error trying to retrieve the reduced count from a read that is not reduced");
-        if ( i < 0 || i >= getReadBases().length )
-            throw new IllegalArgumentException("illegal offset used when retrieving reduced counts: " + i);
-
-        final int[] reducedCounts = getReducedReadCounts();
-        return reducedCounts[i];
-    }
-
-    /**
-     * Is this read a reduced read?
-     * @return true if yes
-     */
-    public boolean isReducedRead() {
-        return getReducedReadCounts() != null;
-    }
-
-    /**
-     * Set the reduced read counts tag for this record.
-     * Note that this method is slightly expensive as it converts to the correct reduced counts representation and sets the
-     * appropriate binary tag.  If you want to modify the reduced count in place without triggering the permanent conversion
-     * internally, use the #setReducedCount() method.
-     *
-     * @param counts the count array
-     */
-    public void setReducedReadCountsTag(final int[] counts) {
-        setAttribute(REDUCED_READ_CONSENSUS_TAG, encodeReduceReadCounts(counts));
-        retrievedReduceReadCounts = false;  // need to force new decode in case we had to handle precision problems with the counts
-    }
-
-    /**
-     * @see #setReducedReadCountsTag() and uses the currently stored values of the internal array.
-     * Useful if you've been using #setReducedCount() to modify the reduced count and now want to trigger the expensive conversion.
-     */
-    public void setReducedReadCountsTag() {
-        if ( !retrievedReduceReadCounts )
-            throw new IllegalStateException("Trying to write the reduced reads counts using an uninitialized internal array of counts");
-        setReducedReadCountsTag(reducedReadCounts);
-    }
-
-    /**
-     * Sets the reduced read count corresponding the i'th base of the reduced read.
-     *
-     * WARNING: does not actually write this value permanently to the binary tags for this read.  To trigger the conversion
-     *          and push that value into the read's binary tags, use #setReducedReadCountsTag().
-     *
-     * @param i      the read based coordinate inside the read
-     * @param count  the new count
-     */
-    public final void setReducedCount(final int i, final int count) {
-        if ( count < 0 )
-            throw new IllegalArgumentException("the reduced count cannot be set to a negative value");
-        if ( !isReducedRead() )
-            throw new IllegalArgumentException("error trying to set the reduced count for a read that is not reduced");
-        if ( i < 0 || i >= getReadBases().length )
-            throw new IllegalArgumentException("illegal offset used when setting the reduced count: " + i);
-
-        // force the initialization of the counts array if it hasn't happened yet
-        getReducedReadCounts()[i] = count;
-    }
-
-    /**
-     * Set the reduced read counts tag for this record to counts
-     *
-     * WARNING: does not actually write this value permanently to the binary tags for this read.  To trigger the conversion
-     *          and push that value into the read's binary tags, use #setReducedReadCountsTag().
-     *
-     * @param counts the count array
-     */
-    public void setReducedReadCounts(final int[] counts) {
-        if ( counts.length != getReadBases().length )
-            throw new IllegalArgumentException("Reduced counts length " + counts.length + " != bases length " + getReadBases().length);
-        retrievedReduceReadCounts = true;
-        reducedReadCounts = counts;
-    }
-
-    /**
-     * Sets the number of bases corresponding the i'th base of the reduced read.
-     *
-     * WARNING: does not actually write this value permanently to the binary tags for this read.  To trigger the conversion
-     *          and push that value into the read's binary tags, use #setReducedReadCountsTag().
-     *
-     * @param i                 the read based coordinate inside the read
-     * @param adjustmentFactor  how much to add/subtract to the current count
-     */
-    public final void adjustReducedCount(final int i, final int adjustmentFactor) {
-        if ( !isReducedRead() )
-            throw new IllegalArgumentException("error trying to set the reduced count for a read that is not reduced");
-        if ( i < 0 || i >= getReadBases().length )
-            throw new IllegalArgumentException("illegal offset used when setting the reduced count: " + i);
-
-        setReducedCount(i, getReducedReadCounts()[i] + adjustmentFactor);
-    }
-
-    /**
-     * Actually decode the consensus tag of a reduce read, returning a newly allocated
-     * set of values countsFromTag to be the real depth of cover at each base of the reduced read.
-     *
-     * for example, if the tag contains [10, 5, -1, -5], after running this function the
-     * byte[] will contain the true counts [10, 15, 9, 5].
-     *
-     * as one might expect.
-     *
-     * @param countsFromTag a non-null byte[] containing the tag encoded reduce reads counts
-     * @return a non-null int[] containing the true depth values for the vector
-     */
-    protected static int[] decodeReduceReadCounts(final byte[] countsFromTag) {
-        final int n = countsFromTag.length;
-        final int[] result = new int[n];
-        final int firstCount = countsFromTag[0] & 0xff; // unsigned byte
-        result[0] = firstCount;
-        for ( int i = 1; i < n; i++ ) {
-            final int offsetCount = countsFromTag[i] & 0xff; // unsigned byte
-            result[i] = (firstCount + offsetCount) % 256;
-        }
-
-        return result;
-    }
-
-    /**
-     * Converts int array from straight counts to the appropriate reduce reads representation in BAM (offset from first value)
-     *
-     * @param counts    the counts array
-     * @return non-null converted byte array
-     */
-    protected static byte[] encodeReduceReadCounts(final int[] counts) {
-        if ( counts.length == 0 )
-            throw new IllegalArgumentException("Trying to write a reduced read with a counts array of length 0");
-
-        final byte[] compressedCountsArray = new byte[counts.length];
-        final int firstCount = (int) MathUtils.bound(counts[0], 0, 255); // we want an unsigned byte capped at max byte representation
-        compressedCountsArray[0] = (byte)firstCount;
-        for ( int i = 1; i < counts.length; i++ ) {
-            final int count = (int) MathUtils.bound(counts[i], 0, 255);
-            final byte offset = (byte)(count - firstCount + (count >= firstCount ? 0 : 256)); // unsigned byte
-            compressedCountsArray[i] = offset;
-        }
-
-        return compressedCountsArray;
-    }
-
     ///////////////////////////////////////////////////////////////////////////////
     // *** GATKSAMRecord specific methods                                     ***//
     ///////////////////////////////////////////////////////////////////////////////
@@ -682,11 +491,7 @@ public class GATKSAMRecord extends BAMRecord {
      * @return the alignment start of a read before it was clipped
      */
     public int getOriginalAlignmentStart() {
-        int originalAlignmentStart = getUnclippedStart();
-        Integer alignmentShift = (Integer) getAttribute(REDUCED_READ_ORIGINAL_ALIGNMENT_START_SHIFT);
-        if (alignmentShift != null)
-            originalAlignmentStart += alignmentShift;
-        return originalAlignmentStart;    
+        return getUnclippedStart();
     }
 
     /**
@@ -697,11 +502,7 @@ public class GATKSAMRecord extends BAMRecord {
      * @return the alignment end of a read before it was clipped
      */
     public int getOriginalAlignmentEnd() {
-        int originalAlignmentEnd = getUnclippedEnd();
-        Integer alignmentShift = (Integer) getAttribute(REDUCED_READ_ORIGINAL_ALIGNMENT_END_SHIFT);
-        if (alignmentShift != null)
-            originalAlignmentEnd -= alignmentShift;
-        return originalAlignmentEnd;
+        return getUnclippedEnd();
     }
 
     /**
@@ -735,7 +536,6 @@ public class GATKSAMRecord extends BAMRecord {
         emptyRead.setCigarString("");
         emptyRead.setReadBases(new byte[0]);
         emptyRead.setBaseQualities(new byte[0]);
-        if ( read.isReducedRead() ) emptyRead.setReducedReadCounts(new int[0]);
 
         SAMReadGroupRecord samRG = read.getReadGroup();
         emptyRead.clearAttributes();
diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/sam/ReadUtils.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/sam/ReadUtils.java
index a512e9ca9..2b6654bcd 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/sam/ReadUtils.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/sam/ReadUtils.java
@@ -57,15 +57,6 @@ public class ReadUtils {
     private static final int DEFAULT_ADAPTOR_SIZE = 100;
     public static final int CLIPPING_GOAL_NOT_REACHED = -1;
 
-    public static int getMeanRepresentativeReadCount(GATKSAMRecord read) {
-        if (!read.isReducedRead())
-            return 1;
-
-        // compute mean representative read counts
-        final int[] counts = read.getReducedReadCounts();
-        return (int)Math.round((double)MathUtils.sum(counts)/counts.length);
-    }
-
     /**
      * A marker to tell which end of the read has been clipped
      */
@@ -695,8 +686,7 @@ public class ReadUtils {
                 case D:
                     for (int i = 0; i < cigarElement.getLength(); i++) {
                         if (refLocation >= startLocation && refLocation <= stopLocation) {
-                            int baseCount = read.isReducedRead() ? read.getReducedCount(refLocation - read.getSoftStart()) : 1;
-                            coverage[refLocation - startLocation] += baseCount;   // this may be a reduced read, so add the proper number of bases
+                            coverage[refLocation - startLocation]++;
                         }
                         refLocation++;
                     }
diff --git a/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/datasources/reads/SAMDataSourceUnitTest.java b/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/datasources/reads/SAMDataSourceUnitTest.java
index 52285fb2e..0c53de307 100644
--- a/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/datasources/reads/SAMDataSourceUnitTest.java
+++ b/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/datasources/reads/SAMDataSourceUnitTest.java
@@ -210,4 +210,21 @@ public class SAMDataSourceUnitTest extends BaseTest {
         List<SAMProgramRecord> doRemoveProgramRecords = data.getHeader().getProgramRecords();
         assertTrue(doRemoveProgramRecords.isEmpty(), "testRemoveProgramRecords: program records not cleared when removeProgramRecords = true");
     }
+
+    @Test(expectedExceptions = UserException.class)
+    public void testFailOnReducedReads() {
+        readers.add(new SAMReaderID(new File(privateTestDir + "old.reduced.bam"), new Tags()));
+
+        SAMDataSource data = new SAMDataSource(readers,
+                new ThreadAllocation(),
+                null,
+                genomeLocParser,
+                false,
+                SAMFileReader.ValidationStringency.SILENT,
+                null,
+                null,
+                new ValidationExclusion(),
+                new ArrayList<ReadFilter>(),
+                false);
+    }
 }
diff --git a/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/AlleleBiasedDownsamplingUtilsUnitTest.java b/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/AlleleBiasedDownsamplingUtilsUnitTest.java
index 6e908a3bf..c587d5e08 100644
--- a/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/AlleleBiasedDownsamplingUtilsUnitTest.java
+++ b/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/AlleleBiasedDownsamplingUtilsUnitTest.java
@@ -124,16 +124,10 @@ public class AlleleBiasedDownsamplingUtilsUnitTest extends BaseTest {
 
         final SAMFileHeader header = ArtificialSAMUtils.createArtificialSamHeader(1, 1, 1000);
 
-        for ( final int originalNormalCount : Arrays.asList(0, 1, 2, 10, 1000) ) {
-            for ( final int originalReducedCount : Arrays.asList(0, 1, 2, 10, 100) ) {
-                for ( final int indexToPutReducedRead : Arrays.asList(0, 2, originalNormalCount) ) {
-                    if ( originalReducedCount == 0 || indexToPutReducedRead > originalNormalCount )
-                        continue;
-                    for ( final int toRemove : Arrays.asList(0, 1, 2, 10, 1000) ) {
-                        if ( toRemove <= originalNormalCount + originalReducedCount )
-                            tests.add(new Object[]{header, originalNormalCount, originalReducedCount, indexToPutReducedRead, toRemove});
-                    }
-                }
+        for ( final int originalCount : Arrays.asList(1, 2, 10, 1000) ) {
+            for ( final int toRemove : Arrays.asList(0, 1, 2, 10, 1000) ) {
+                if ( toRemove <= originalCount )
+                    tests.add(new Object[]{header, originalCount, toRemove});
             }
         }
 
@@ -141,27 +135,17 @@ public class AlleleBiasedDownsamplingUtilsUnitTest extends BaseTest {
     }
 
     @Test(dataProvider = "BiasedDownsamplingTest")
-    public void testBiasedDownsampling(final SAMFileHeader header, final int originalNormalCount, final int originalReducedCount, final int indexToPutReducedRead, final int toRemove) {
+    public void testBiasedDownsampling(final SAMFileHeader header, final int originalCount, final int toRemove) {
 
-        final LinkedList<PileupElement> elements = new LinkedList<PileupElement>();
-        for ( int i = 0; i < originalNormalCount; i++ ) {
+        final LinkedList<PileupElement> elements = new LinkedList<>();
+        for ( int i = 0; i < originalCount; i++ ) {
             final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(header, "read", 0, 1, 1);
             elements.add(new PileupElement(read, 0, new CigarElement(1, CigarOperator.M), 0, 0));
         }
-        if ( originalReducedCount > 0 ) {
-            final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(header, "read", 0, 1, 1);
-            read.setReducedReadCountsTag(new int[]{originalReducedCount});
-            elements.add(indexToPutReducedRead, new PileupElement(read, 0, new CigarElement(1, CigarOperator.M), 0, 0));
-        }
 
-        final List<PileupElement> result = AlleleBiasedDownsamplingUtils.downsampleElements(elements, originalNormalCount + originalReducedCount, toRemove);
-        int pileupCount = 0;
-        for ( final PileupElement pe : elements ) // reduced reads may have gotten modified
-            pileupCount += pe.getRepresentativeCount();
-        for ( final PileupElement pe : result )
-            pileupCount -= pe.getRepresentativeCount();
+        final List<PileupElement> result = AlleleBiasedDownsamplingUtils.downsampleElements(elements, originalCount, toRemove);
 
-        Assert.assertEquals(pileupCount, originalNormalCount + originalReducedCount - toRemove);
+        Assert.assertEquals(result.size(), toRemove);
     }
 
     @Test
diff --git a/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/FractionalDownsamplerUnitTest.java b/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/FractionalDownsamplerUnitTest.java
index 8f0eee069..4fd9e491c 100644
--- a/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/FractionalDownsamplerUnitTest.java
+++ b/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/FractionalDownsamplerUnitTest.java
@@ -30,7 +30,6 @@ import net.sf.samtools.SAMRecord;
 import org.broadinstitute.sting.BaseTest;
 import org.broadinstitute.sting.gatk.GenomeAnalysisEngine;
 import org.broadinstitute.sting.utils.sam.ArtificialSAMUtils;
-import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
 import org.testng.annotations.DataProvider;
 import org.testng.annotations.Test;
 import org.testng.Assert;
@@ -156,36 +155,4 @@ public class FractionalDownsamplerUnitTest extends BaseTest {
         downsampler.resetStats();
         Assert.assertEquals(downsampler.getNumberOfDiscardedItems(), 0);
     }
-
-    @Test
-    public void testDoNotDiscardReducedReads() {
-        GenomeAnalysisEngine.resetRandomGenerator();
-        final ReadsDownsampler<GATKSAMRecord> downsampler = new FractionalDownsampler<GATKSAMRecord>(0.0);
-
-        final Collection<GATKSAMRecord> reads = new ArrayList<GATKSAMRecord>();
-        final SAMFileHeader header = ArtificialSAMUtils.createArtificialSamHeader(1, 1, 1000000);
-        final int[] baseCounts = { 10, 10, 10, 10, 10 };
-
-        for ( int i = 1; i <= 10; i++ ) {
-            reads.add(ArtificialSAMUtils.createArtificialReducedRead(header, "foo", 0, 1, 5, baseCounts));
-        }
-        for ( int i = 1; i <= 5; i++ ) {
-            reads.add(ArtificialSAMUtils.createArtificialRead(header, "foo", 0, 1, 5));
-        }
-
-        downsampler.submit(reads);
-        downsampler.signalEndOfInput();
-
-        Assert.assertEquals(downsampler.getNumberOfDiscardedItems(), 5, "wrong number of items discarded by the downsampler");
-        Assert.assertTrue(downsampler.hasFinalizedItems(), "downsampler should have finalized items but doesn't");
-        Assert.assertEquals(downsampler.size(), 10, "downsampler size() reports wrong number of items");
-
-        final Collection<GATKSAMRecord> readsReturned = downsampler.consumeFinalizedItems();
-
-        Assert.assertEquals(readsReturned.size(), 10, "wrong number of items returned by the downsampler");
-
-        for ( GATKSAMRecord readReturned : readsReturned ) {
-            Assert.assertTrue(readReturned.isReducedRead(), "non-reduced read survived the downsampling process, but shouldn't have");
-        }
-    }
 }
diff --git a/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/LevelingDownsamplerUnitTest.java b/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/LevelingDownsamplerUnitTest.java
index 8cf0fd2a1..07a8a7975 100644
--- a/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/LevelingDownsamplerUnitTest.java
+++ b/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/LevelingDownsamplerUnitTest.java
@@ -25,12 +25,8 @@
 
 package org.broadinstitute.sting.gatk.downsampling;
 
-import net.sf.samtools.SAMFileHeader;
 import org.broadinstitute.sting.BaseTest;
 import org.broadinstitute.sting.gatk.GenomeAnalysisEngine;
-import org.broadinstitute.sting.utils.locusiterator.AlignmentStateMachine;
-import org.broadinstitute.sting.utils.sam.ArtificialSAMUtils;
-import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
 import org.testng.annotations.Test;
 import org.testng.annotations.DataProvider;
 import org.testng.Assert;
@@ -164,41 +160,4 @@ public class LevelingDownsamplerUnitTest extends BaseTest {
 
         Assert.assertTrue(totalRemainingItems <= Math.max(test.targetSize, test.numStacks));
     }
-
-    @Test
-    public void testDoNotDiscardReducedReads() {
-        GenomeAnalysisEngine.resetRandomGenerator();
-        final Downsampler<LinkedList<AlignmentStateMachine>> downsampler = new LevelingDownsampler<LinkedList<AlignmentStateMachine>, AlignmentStateMachine>(1);
-
-        final Collection<LinkedList<AlignmentStateMachine>> groups = new LinkedList<LinkedList<AlignmentStateMachine>>();
-        final SAMFileHeader header = ArtificialSAMUtils.createArtificialSamHeader(1, 1, 1000000);
-        final int[] baseCounts = { 10, 10, 10, 10, 10 };
-
-        for ( int alignmentStart : Arrays.asList(1, 2, 3) ) {
-            final LinkedList<AlignmentStateMachine> group = new LinkedList<AlignmentStateMachine>();
-            for ( int i = 1; i <= 10; i++ ) {
-                group.add(new AlignmentStateMachine(ArtificialSAMUtils.createArtificialReducedRead(header, "foo", 0, alignmentStart, 5, baseCounts)));
-            }
-            groups.add(group);
-        }
-
-        downsampler.submit(groups);
-        downsampler.signalEndOfInput();
-
-        Assert.assertEquals(downsampler.getNumberOfDiscardedItems(), 0, "wrong number of items discarded by the downsampler");
-        Assert.assertTrue(downsampler.hasFinalizedItems(), "downsampler should have finalized items but doesn't");
-        Assert.assertEquals(downsampler.size(), 30, "downsampler size() reports wrong number of items");
-
-        final Collection<LinkedList<AlignmentStateMachine>> groupsReturned = downsampler.consumeFinalizedItems();
-
-        Assert.assertEquals(groupsReturned.size(), 3, "wrong number of groups returned by the downsampler");
-
-        for ( LinkedList<AlignmentStateMachine> group : groupsReturned ) {
-            Assert.assertEquals(group.size(), 10, "group has wrong size after downsampling");
-
-            for ( AlignmentStateMachine state : group ) {
-                Assert.assertTrue(state.isReducedRead());
-            }
-        }
-    }
 }
diff --git a/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/ReservoirDownsamplerUnitTest.java b/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/ReservoirDownsamplerUnitTest.java
index a50201efd..66abfd29b 100644
--- a/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/ReservoirDownsamplerUnitTest.java
+++ b/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/ReservoirDownsamplerUnitTest.java
@@ -30,7 +30,6 @@ import net.sf.samtools.SAMRecord;
 import org.broadinstitute.sting.BaseTest;
 import org.broadinstitute.sting.gatk.GenomeAnalysisEngine;
 import org.broadinstitute.sting.utils.sam.ArtificialSAMUtils;
-import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
 import org.testng.annotations.DataProvider;
 import org.testng.annotations.Test;
 import org.testng.Assert;
@@ -129,46 +128,4 @@ public class ReservoirDownsamplerUnitTest extends BaseTest {
         downsampler.resetStats();
         Assert.assertEquals(downsampler.getNumberOfDiscardedItems(), 0);
     }
-
-    @Test
-    public void testDoNotDiscardReducedReads() {
-        GenomeAnalysisEngine.resetRandomGenerator();
-        final ReadsDownsampler<GATKSAMRecord> downsampler = new ReservoirDownsampler<GATKSAMRecord>(1);
-
-        final Collection<GATKSAMRecord> reads = new ArrayList<GATKSAMRecord>();
-        final SAMFileHeader header = ArtificialSAMUtils.createArtificialSamHeader(1, 1, 1000000);
-        final int[] baseCounts = { 10, 10, 10, 10, 10 };
-
-        for ( int i = 1; i <= 10; i++ ) {
-            reads.add(ArtificialSAMUtils.createArtificialReducedRead(header, "foo", 0, 1, 5, baseCounts));
-        }
-        for ( int i = 1; i <= 5; i++ ) {
-            reads.add(ArtificialSAMUtils.createArtificialRead(header, "foo", 0, 1, 5));
-        }
-
-        downsampler.submit(reads);
-        downsampler.signalEndOfInput();
-
-        Assert.assertEquals(downsampler.getNumberOfDiscardedItems(), 4, "wrong number of items discarded by the downsampler");
-        Assert.assertTrue(downsampler.hasFinalizedItems(), "downsampler should have finalized items but doesn't");
-        Assert.assertEquals(downsampler.size(), 11, "downsampler size() reports wrong number of items");
-
-        final Collection<GATKSAMRecord> readsReturned = downsampler.consumeFinalizedItems();
-
-        Assert.assertEquals(readsReturned.size(), 11, "wrong number of items returned by the downsampler");
-
-        int numReducedReadsReturned = 0;
-        int numNormalReadsReturned = 0;
-        for ( GATKSAMRecord readReturned : readsReturned ) {
-            if ( readReturned.isReducedRead() ) {
-                numReducedReadsReturned++;
-            }
-            else {
-                numNormalReadsReturned++;
-            }
-        }
-
-        Assert.assertEquals(numReducedReadsReturned, 10, "wrong number of reduced reads returned by the downsampler");
-        Assert.assertEquals(numNormalReadsReturned, 1, "wrong number of non-reduced reads returned by the downsampler");
-    }
 }
diff --git a/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/SimplePositionalDownsamplerUnitTest.java b/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/SimplePositionalDownsamplerUnitTest.java
index bec0030d0..afe8729c2 100644
--- a/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/SimplePositionalDownsamplerUnitTest.java
+++ b/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/downsampling/SimplePositionalDownsamplerUnitTest.java
@@ -328,48 +328,4 @@ public class SimplePositionalDownsamplerUnitTest extends BaseTest {
 
         Assert.assertEquals(downsampledReads.size(), 10);
     }
-
-    @Test
-    public void testDoNotDiscardReducedReads() {
-        GenomeAnalysisEngine.resetRandomGenerator();
-        final ReadsDownsampler<GATKSAMRecord> downsampler = new SimplePositionalDownsampler<GATKSAMRecord>(1);
-
-        final Collection<GATKSAMRecord> reads = new ArrayList<GATKSAMRecord>();
-        final SAMFileHeader header = ArtificialSAMUtils.createArtificialSamHeader(1, 1, 1000000);
-        final int[] baseCounts = { 10, 10, 10, 10, 10 };
-
-        for ( int alignmentStart : Arrays.asList(1, 2, 3) ) {
-            for ( int i = 1; i <= 10; i++ ) {
-                reads.add(ArtificialSAMUtils.createArtificialReducedRead(header, "foo", 0, alignmentStart, 5, baseCounts));
-            }
-            for ( int i = 1; i <= 5; i++ ) {
-                reads.add(ArtificialSAMUtils.createArtificialRead(header, "foo", 0, alignmentStart, 5));
-            }
-        }
-
-        downsampler.submit(reads);
-        downsampler.signalEndOfInput();
-
-        Assert.assertEquals(downsampler.getNumberOfDiscardedItems(), 12, "wrong number of items discarded by the downsampler");
-        Assert.assertTrue(downsampler.hasFinalizedItems(), "downsampler should have finalized items but doesn't");
-        Assert.assertEquals(downsampler.size(), 33, "downsampler size() reports wrong number of items");
-
-        final Collection<GATKSAMRecord> readsReturned = downsampler.consumeFinalizedItems();
-
-        Assert.assertEquals(readsReturned.size(), 33, "wrong number of items returned by the downsampler");
-
-        int numReducedReadsReturned = 0;
-        int numNormalReadsReturned = 0;
-        for ( GATKSAMRecord readReturned : readsReturned ) {
-            if ( readReturned.isReducedRead() ) {
-                numReducedReadsReturned++;
-            }
-            else {
-                numNormalReadsReturned++;
-            }
-        }
-
-        Assert.assertEquals(numReducedReadsReturned, 30, "wrong number of reduced reads returned by the downsampler");
-        Assert.assertEquals(numNormalReadsReturned, 3, "wrong number of non-reduced reads returned by the downsampler");
-    }
 }
diff --git a/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/traversals/TAROrderedReadCacheUnitTest.java b/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/traversals/TAROrderedReadCacheUnitTest.java
index 4d85997b3..62f4bdc88 100644
--- a/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/traversals/TAROrderedReadCacheUnitTest.java
+++ b/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/traversals/TAROrderedReadCacheUnitTest.java
@@ -26,11 +26,9 @@
 package org.broadinstitute.sting.gatk.traversals;
 
 import net.sf.picard.reference.IndexedFastaSequenceFile;
-import net.sf.samtools.SAMFileHeader;
 import org.broadinstitute.sting.BaseTest;
 import org.broadinstitute.sting.utils.fasta.CachingIndexedFastaSequenceFile;
 import org.broadinstitute.sting.utils.sam.ArtificialBAMBuilder;
-import org.broadinstitute.sting.utils.sam.ArtificialSAMUtils;
 import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
 import org.testng.Assert;
 import org.testng.annotations.BeforeClass;
@@ -41,7 +39,6 @@ import java.io.File;
 import java.io.FileNotFoundException;
 import java.util.ArrayList;
 import java.util.Arrays;
-import java.util.Collection;
 import java.util.List;
 
 public class TAROrderedReadCacheUnitTest extends BaseTest {
@@ -104,47 +101,6 @@ public class TAROrderedReadCacheUnitTest extends BaseTest {
         verifySortednessOfReads(cacheReads);
     }
 
-    @Test
-    public void testReadCacheWithReducedReads() {
-        final List<GATKSAMRecord> reads = new ArrayList<GATKSAMRecord>();
-        final SAMFileHeader header = ArtificialSAMUtils.createArtificialSamHeader(1, 1, 1000000);
-        final int[] baseCounts = { 10, 10, 10, 10, 10 };
-
-        for ( int i = 1; i <= 100; i++ ) {
-            reads.add(ArtificialSAMUtils.createArtificialReducedRead(header, "foo", 0, i, 5, baseCounts));
-            reads.add(ArtificialSAMUtils.createArtificialRead(header, "foo", 0, i, 5));
-        }
-
-        final TAROrderedReadCache cache = new TAROrderedReadCache(50);
-
-        cache.addAll(reads);
-
-        // Our cache should have kept all of the reduced reads (which are retained unconditionally and do not count
-        // towards the capacity limit), and discarded half of the 100 non-reduced reads due to the cache capacity
-        // limit of 50.
-        Assert.assertEquals(cache.size(), 150, "wrong number of reads in the cache at the end");
-        Assert.assertEquals(cache.getNumDiscarded(), 50, "wrong number of reads discarded from the cache");
-
-        final List<GATKSAMRecord> cacheReads = cache.popCurrentReads();
-
-        int numReducedReadsRetained = 0;
-        int numNormalReadsRetained = 0;
-
-        for ( GATKSAMRecord read : cacheReads ) {
-            if ( read.isReducedRead() ) {
-                numReducedReadsRetained++;
-            }
-            else {
-                numNormalReadsRetained++;
-            }
-        }
-
-        Assert.assertEquals(numReducedReadsRetained, 100, "wrong number of reduced reads retained in the cache");
-        Assert.assertEquals(numNormalReadsRetained, 50, "wrong number of non-reduced reads retained in the cache");
-
-        verifySortednessOfReads(cacheReads);
-    }
-
     private void verifySortednessOfReads( final List<GATKSAMRecord> reads) {
         int lastStart = -1;
         for ( GATKSAMRecord read : reads ) {
diff --git a/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/walkers/coverage/CallableLociIntegrationTest.java b/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/walkers/coverage/CallableLociIntegrationTest.java
index 336c15ccc..5392e8037 100644
--- a/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/walkers/coverage/CallableLociIntegrationTest.java
+++ b/public/gatk-framework/src/test/java/org/broadinstitute/sting/gatk/walkers/coverage/CallableLociIntegrationTest.java
@@ -67,13 +67,4 @@ public class CallableLociIntegrationTest extends WalkerTest {
                 Arrays.asList("7f79ad8195c4161060463eeb21d2bb11", "7ee269e5f4581a924529a356cc806e55"));
         executeTest("formatBed lots of arguments", spec);
     }
-
-    @Test(enabled=true)
-    public void testWithReducedRead() {
-        String gatk_args = reduceReadArgs + " -L 20:10,000,000-11,000,000 -minDepth 10 -maxDepth 100 --minBaseQuality 10 --minMappingQuality 20 -summary %s";
-        WalkerTestSpec spec = new WalkerTestSpec(gatk_args, 1,
-                Arrays.asList("69fc303c888fd1fa2937b9518dc82f9e", "f512a85c373087ce03a24ab0f98522c0"));
-        executeTest("CallableLoci with ReducedRead", spec);
-    }
-
 }
diff --git a/public/gatk-framework/src/test/java/org/broadinstitute/sting/utils/clipping/ReadClipperUnitTest.java b/public/gatk-framework/src/test/java/org/broadinstitute/sting/utils/clipping/ReadClipperUnitTest.java
index cc008404c..cd12c3b9b 100644
--- a/public/gatk-framework/src/test/java/org/broadinstitute/sting/utils/clipping/ReadClipperUnitTest.java
+++ b/public/gatk-framework/src/test/java/org/broadinstitute/sting/utils/clipping/ReadClipperUnitTest.java
@@ -411,22 +411,6 @@ public class ReadClipperUnitTest extends BaseTest {
 
     }
 
-    @Test(enabled = !DEBUG)
-    public void testHardClipReducedRead() {
-        GATKSAMRecord read = ReadClipperTestUtils.makeReadFromCigar("10M");
-        final int[] counts = new int[read.getReadLength()];
-        for ( int i = 0; i < counts.length; i++ ) counts[i] = i;
-        read.setReducedReadCounts(counts);
-        int alnStart = read.getAlignmentStart();
-        int alnEnd = read.getAlignmentEnd();
-        int readLength = read.getReadLength();
-        for (int i = 0; i < readLength / 2; i++) {
-            GATKSAMRecord clippedRead = ReadClipper.hardClipBothEndsByReferenceCoordinates(read, alnStart + i, alnEnd - i);
-            final int[] expectedReducedCounts = Arrays.copyOfRange(counts, i + 1, readLength - i - 1);
-            Assert.assertEquals(clippedRead.getReducedReadCounts(), expectedReducedCounts);
-        }
-    }
-
     @Test(enabled = !DEBUG)
     public void testRevertEntirelySoftclippedReads() {
         GATKSAMRecord read = ReadClipperTestUtils.makeReadFromCigar("2H1S3H");
diff --git a/public/gatk-framework/src/test/java/org/broadinstitute/sting/utils/pileup/PileupElementUnitTest.java b/public/gatk-framework/src/test/java/org/broadinstitute/sting/utils/pileup/PileupElementUnitTest.java
index 888ab7f7f..39058233e 100644
--- a/public/gatk-framework/src/test/java/org/broadinstitute/sting/utils/pileup/PileupElementUnitTest.java
+++ b/public/gatk-framework/src/test/java/org/broadinstitute/sting/utils/pileup/PileupElementUnitTest.java
@@ -27,7 +27,6 @@ package org.broadinstitute.sting.utils.pileup;
 
 import net.sf.samtools.CigarElement;
 import net.sf.samtools.CigarOperator;
-import org.broadinstitute.sting.utils.QualityUtils;
 import org.broadinstitute.sting.utils.Utils;
 import org.broadinstitute.sting.utils.locusiterator.AlignmentStateMachine;
 import org.broadinstitute.sting.utils.locusiterator.LIBS_position;
@@ -126,7 +125,6 @@ public class PileupElementUnitTest extends LocusIteratorByStateBaseTest {
             // TODO -- add meaningful tests
             pe.getBaseInsertionQual();
             pe.getBaseDeletionQual();
-            pe.getRepresentativeCount();
         }
     }
 
diff --git a/public/gatk-framework/src/test/java/org/broadinstitute/sting/utils/sam/GATKSAMRecordUnitTest.java b/public/gatk-framework/src/test/java/org/broadinstitute/sting/utils/sam/GATKSAMRecordUnitTest.java
index e9af685a6..837f3fa45 100644
--- a/public/gatk-framework/src/test/java/org/broadinstitute/sting/utils/sam/GATKSAMRecordUnitTest.java
+++ b/public/gatk-framework/src/test/java/org/broadinstitute/sting/utils/sam/GATKSAMRecordUnitTest.java
@@ -27,22 +27,15 @@ package org.broadinstitute.sting.utils.sam;
 
 import net.sf.samtools.SAMFileHeader;
 import org.broadinstitute.sting.BaseTest;
-import org.broadinstitute.sting.utils.locusiterator.LocusIteratorByState;
-import org.broadinstitute.sting.utils.pileup.PileupElement;
 import org.testng.Assert;
 import org.testng.annotations.BeforeClass;
-import org.testng.annotations.DataProvider;
 import org.testng.annotations.Test;
 
-import java.util.ArrayList;
-import java.util.List;
-
 
 public class GATKSAMRecordUnitTest extends BaseTest {
-    GATKSAMRecord read, reducedRead;
+    GATKSAMRecord read;
     final static String BASES = "ACTG";
     final static String QUALS = "!+5?";
-    final private static int[] REDUCED_READ_COUNTS = new int[]{10, 20, 30, 40};
 
     @BeforeClass
     public void init() {
@@ -51,121 +44,6 @@ public class GATKSAMRecordUnitTest extends BaseTest {
         read.setReadUnmappedFlag(true);
         read.setReadBases(new String(BASES).getBytes());
         read.setBaseQualityString(new String(QUALS));
-
-        reducedRead = ArtificialSAMUtils.createArtificialRead(header, "reducedRead", 0, 1, BASES.length());
-        reducedRead.setReadBases(BASES.getBytes());
-        reducedRead.setBaseQualityString(QUALS);
-        reducedRead.setReducedReadCountsTag(REDUCED_READ_COUNTS);
-    }
-
-    @Test
-    public void testReducedReads() {
-        reducedRead.setReducedReadCountsTag(REDUCED_READ_COUNTS);
-
-        Assert.assertFalse(read.isReducedRead(), "isReducedRead is false for normal read");
-        Assert.assertEquals(read.getReducedReadCounts(), null, "No reduced read tag in normal read");
-
-        Assert.assertTrue(reducedRead.isReducedRead(), "isReducedRead is true for reduced read");
-        for (int i = 0; i < reducedRead.getReadLength(); i++) {
-            Assert.assertEquals(reducedRead.getReducedCount(i), REDUCED_READ_COUNTS[i], "Reduced read count not set to the expected value at " + i);
-        }
-    }
-
-    @Test(expectedExceptions = IllegalArgumentException.class)
-    public void testGetReducedCountOnNormalRead() {
-        read.getReducedCount(0);
-    }
-
-    @Test(expectedExceptions = IllegalArgumentException.class)
-    public void testSetReducedTagOnNormalRead() {
-        read.setReducedCount(0, 2);
-    }
-
-    @Test(expectedExceptions = IllegalArgumentException.class)
-    public void testAdjustReducedCountToNegativeNumber() {
-        reducedRead.setReducedCount(0, 1);
-        reducedRead.adjustReducedCount(0, -2);
-    }
-
-    @Test
-    public void testSetReducedCountOnReducedRead() {
-        for (int i = 0; i < reducedRead.getReadLength(); i++) {
-            final byte newCount = (byte)i;
-            reducedRead.setReducedCount(i, newCount);
-            Assert.assertEquals(reducedRead.getReducedCount(i), newCount, "Reduced read count not set to the expected value at " + i);
-        }
-
-        for (int i = 0; i < reducedRead.getReadLength(); i++) {
-            final int newCount = reducedRead.getReducedCount(i) + i;
-            reducedRead.adjustReducedCount(i, i);
-            Assert.assertEquals(reducedRead.getReducedCount(i), newCount, "Reduced read count not set to the expected value at " + i);
-        }
-    }
-
-    @Test
-    public void testReducedReadEncodeAndDecode() {
-
-        // encode
-        byte[] encoded = GATKSAMRecord.encodeReduceReadCounts(REDUCED_READ_COUNTS);
-
-        // decode
-        int[] decoded = GATKSAMRecord.decodeReduceReadCounts(encoded);
-
-        // for the heck of it, let's encode and decode again!
-        encoded = GATKSAMRecord.encodeReduceReadCounts(decoded);
-        decoded = GATKSAMRecord.decodeReduceReadCounts(encoded);
-
-        for (int i = 0; i < decoded.length; i++)
-            Assert.assertEquals(decoded[i], REDUCED_READ_COUNTS[i]);
-    }
-
-    @Test
-    public void testByteBoundsOnReducedTag() {
-        reducedRead.setReducedCount(0, 1000);
-        reducedRead.setReducedReadCountsTag();
-        reducedRead.adjustReducedCount(0, -255);
-        Assert.assertEquals(reducedRead.getReducedCount(0), 0);
-    }
-
-    @Test
-    public void testReducedReadPileupElement() {
-        reducedRead.setReducedReadCountsTag(REDUCED_READ_COUNTS);
-
-        PileupElement readp = LocusIteratorByState.createPileupForReadAndOffset(read, 0);
-        PileupElement reducedreadp = LocusIteratorByState.createPileupForReadAndOffset(reducedRead, 0);
-
-        Assert.assertFalse(readp.getRead().isReducedRead());
-
-        Assert.assertTrue(reducedreadp.getRead().isReducedRead());
-        Assert.assertEquals(reducedreadp.getRepresentativeCount(), REDUCED_READ_COUNTS[0]);
-        Assert.assertEquals(reducedreadp.getQual(), readp.getQual());
-    }
-
-    @Test
-    public void testGetOriginalAlignments() {
-        final byte [] bases = {'A', 'A', 'A', 'A', 'A', 'A', 'A', 'A'};
-        final byte [] quals = {20 , 20 , 20 , 20 , 20 , 20 , 20 , 20 };
-        GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(bases, quals, "6M");
-
-        // A regular read with all matches
-        Assert.assertEquals(read.getAlignmentStart(), read.getOriginalAlignmentStart());
-        Assert.assertEquals(read.getAlignmentEnd(), read.getOriginalAlignmentEnd());
-
-        // Alignment start shifted
-        int alignmentShift = 2;
-        read.setAttribute(GATKSAMRecord.REDUCED_READ_ORIGINAL_ALIGNMENT_START_SHIFT, alignmentShift);
-        Assert.assertEquals(read.getAlignmentStart() + alignmentShift, read.getOriginalAlignmentStart());
-        Assert.assertEquals(read.getAlignmentEnd(), read.getOriginalAlignmentEnd());
-
-        // Both alignments shifted
-        read.setAttribute(GATKSAMRecord.REDUCED_READ_ORIGINAL_ALIGNMENT_END_SHIFT, alignmentShift);
-        Assert.assertEquals(read.getAlignmentStart() + alignmentShift, read.getOriginalAlignmentStart());
-        Assert.assertEquals(read.getAlignmentEnd() - alignmentShift, read.getOriginalAlignmentEnd());
-
-        // Alignment end shifted
-        read.setAttribute(GATKSAMRecord.REDUCED_READ_ORIGINAL_ALIGNMENT_START_SHIFT, null);
-        Assert.assertEquals(read.getAlignmentStart(), read.getOriginalAlignmentStart());
-        Assert.assertEquals(read.getAlignmentEnd() - alignmentShift, read.getOriginalAlignmentEnd());
     }
 
     @Test
@@ -197,36 +75,4 @@ public class GATKSAMRecordUnitTest extends BaseTest {
         read.setIsStrandless(true);
         read.setReadNegativeStrandFlag(true);
     }
-
-    @Test
-    public void testGetReducedCountsIsCorrect() {
-        reducedRead.setReducedReadCountsTag(REDUCED_READ_COUNTS);
-        final int[] counts = reducedRead.getReducedReadCounts();
-        Assert.assertNotSame(counts, reducedRead.getAttribute(GATKSAMRecord.REDUCED_READ_CONSENSUS_TAG));
-        for ( int i = 0; i < counts.length; i++ )
-            Assert.assertEquals(counts[i], reducedRead.getReducedCount(i), "Reduced counts vector not equal to getReducedCount(i) at " + i);
-    }
-
-    @DataProvider(name = "ReducedReadCountConversionProvider")
-    public Object[][] ReducedReadCountConversionTestData() {
-        List<Object[]> tests = new ArrayList<Object[]>();
-
-        tests.add(new Object[]{new int[] {100, 100, 100, 101}, new byte[] {100, 0, 0, 1}});
-        tests.add(new Object[]{new int[] {1, 100, 100, 0}, new byte[] {1, 99, 99, -1}});
-        tests.add(new Object[]{new int[] {127, 100, 0, 1}, new byte[] {127, -27, -127, -126}});
-        tests.add(new Object[]{new int[] {1, 127, 51, 126}, new byte[] {1, 126, 50, 125}});
-        tests.add(new Object[]{new int[] {300, 127, 1, 255}, new byte[] {-1, -128, 2, 0}});
-        tests.add(new Object[]{new int[] {1, 300, 51, 126}, new byte[] {1, -2, 50, 125}});
-
-        return tests.toArray(new Object[][]{});
-    }
-
-    @Test(dataProvider = "ReducedReadCountConversionProvider", enabled = true)
-    public void reducedReadCountConversionTest(final int[] counts, final byte[] expectedConversion) {
-
-        reducedRead.setReducedReadCountsTag(counts);
-        final byte[] actualConversion = reducedRead.getByteArrayAttribute(GATKSAMRecord.REDUCED_READ_CONSENSUS_TAG);
-        for ( int i = 0; i < actualConversion.length; i++ )
-            Assert.assertEquals(actualConversion[i], expectedConversion[i], "Conversion differs at position " + i + ": " + actualConversion[i] + " vs. " + expectedConversion[i]);
-    }
 }

From 6c872308d8640cbcbaa8977d468193f5fe041568 Mon Sep 17 00:00:00 2001
From: Eric Banks <ebanks@broadinstitute.org>
Date: Thu, 13 Feb 2014 10:50:53 -0500
Subject: [PATCH 07/18] Add the capability to the N-cigar splitter to also
 hard-clip off overhangs based on observed split positions.

We use a "manager" to keep track of observed splits and previous reads.  This can be extended/modified in the
future to try to salvage those overhangs instead of hard-clipping them and/or try other possible strategies.

Added unit tests and more integration tests.
---
 .../walkers/rnaseq/OverhangFixingManager.java | 380 ++++++++++++++++++
 .../gatk/walkers/rnaseq/SplitNCigarReads.java | 232 +++++------
 .../rnaseq/OverhangFixingManagerUnitTest.java | 172 ++++++++
 ...a => SplitNCigarReadsIntegrationTest.java} |  41 +-
 .../rnaseq/SplitNCigarReadsUnitTest.java      |  37 +-
 5 files changed, 720 insertions(+), 142 deletions(-)
 create mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/rnaseq/OverhangFixingManager.java
 create mode 100644 protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/rnaseq/OverhangFixingManagerUnitTest.java
 rename protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/rnaseq/{SplitNCigarReadsIntegrationTests.java => SplitNCigarReadsIntegrationTest.java} (79%)

diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/rnaseq/OverhangFixingManager.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/rnaseq/OverhangFixingManager.java
new file mode 100644
index 000000000..581a9e426
--- /dev/null
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/rnaseq/OverhangFixingManager.java
@@ -0,0 +1,380 @@
+/*
+*  By downloading the PROGRAM you agree to the following terms of use:
+*  
+*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
+*  
+*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
+*  
+*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
+*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
+*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
+*  
+*  1. DEFINITIONS
+*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
+*  
+*  2. LICENSE
+*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
+*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
+*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
+*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
+*  
+*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
+*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
+*  Copyright 2012 Broad Institute, Inc.
+*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
+*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
+*  
+*  4. INDEMNIFICATION
+*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
+*  
+*  5. NO REPRESENTATIONS OR WARRANTIES
+*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
+*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
+*  
+*  6. ASSIGNMENT
+*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
+*  
+*  7. MISCELLANEOUS
+*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
+*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
+*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
+*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
+*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
+*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
+*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
+*/
+
+package org.broadinstitute.sting.gatk.walkers.rnaseq;
+
+import net.sf.samtools.SAMFileWriter;
+import net.sf.samtools.SAMRecordCoordinateComparator;
+import org.apache.log4j.Logger;
+import org.broadinstitute.sting.utils.GenomeLoc;
+import org.broadinstitute.sting.utils.GenomeLocParser;
+import org.broadinstitute.sting.utils.clipping.ReadClipper;
+import org.broadinstitute.sting.utils.fasta.CachingIndexedFastaSequenceFile;
+import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
+
+import java.util.*;
+
+/**
+ * The class manages reads and splices and tries to apply overhang clipping when appropriate.
+ * Important note: although for efficiency the manager does try to send reads to the underlying writer in coordinate
+ * sorted order, it does NOT guarantee that it will do so in every case!  So unless there's a good reason not to,
+ * methods that instantiate this manager should pass in a writer that does not assume the reads are pre-sorted.
+ */
+public class OverhangFixingManager {
+
+    protected static final Logger logger = Logger.getLogger(OverhangFixingManager.class);
+    private static final boolean DEBUG = false;
+
+    // how many reads should we store in memory before flushing the queue?
+    private final int MAX_RECORDS_IN_MEMORY;
+
+    // how many mismatches do we tolerate in the overhangs?
+    private final int MAX_MISMATCHES_IN_OVERHANG;
+
+    // how many bases do we tolerate in the overhang before deciding not to clip?
+    private final int MAX_BASES_IN_OVERHANG;
+
+    // should we not bother fixing overhangs?
+    private final boolean doNotFixOverhangs;
+
+    // where we ultimately write out our records
+    private final SAMFileWriter writer;
+
+    // fasta reference reader to check overhanging edges in the exome reference sequence
+    private final CachingIndexedFastaSequenceFile referenceReader;
+
+    // the genome loc parser
+    private final GenomeLocParser genomeLocParser;
+
+    // the read cache
+    private final static int initialCapacity = 5000;
+    private PriorityQueue<SplitRead> waitingReads = new PriorityQueue<>(initialCapacity, new SplitReadComparator());
+
+    // the set of current splices to use
+    private final Set<Splice> splices = new TreeSet<>(new SpliceComparator());
+
+    protected static final int MAX_SPLICES_TO_KEEP = 1000;
+
+
+    /**
+     *
+     * @param writer                   actual writer
+     * @param genomeLocParser          the GenomeLocParser object
+     * @param referenceReader          the reference reader
+     * @param maxRecordsInMemory       max records to keep in memory
+     * @param maxMismatchesInOverhangs max number of mismatches permitted in the overhangs before requiring clipping
+     * @param maxBasesInOverhangs      max number of bases permitted in the overhangs before deciding not to clip
+     * @param doNotFixOverhangs        if true, don't clip overhangs at all
+     */
+    public OverhangFixingManager(final SAMFileWriter writer,
+                                 final GenomeLocParser genomeLocParser,
+                                 final CachingIndexedFastaSequenceFile referenceReader,
+                                 final int maxRecordsInMemory,
+                                 final int maxMismatchesInOverhangs,
+                                 final int maxBasesInOverhangs,
+                                 final boolean doNotFixOverhangs) {
+        this.writer = writer;
+        this.genomeLocParser = genomeLocParser;
+        this.referenceReader = referenceReader;
+        this.MAX_RECORDS_IN_MEMORY = maxRecordsInMemory;
+        this.MAX_MISMATCHES_IN_OVERHANG = maxMismatchesInOverhangs;
+        this.MAX_BASES_IN_OVERHANG = maxBasesInOverhangs;
+        this.doNotFixOverhangs = doNotFixOverhangs;
+    }
+
+    public final int getNReadsInQueue() { return waitingReads.size(); }
+
+    /**
+     * For testing purposes only
+     *
+     * @return the list of reads currently in the queue
+     */
+    protected List<SplitRead> getReadsInQueueForTesting() {
+        return new ArrayList<>(waitingReads);
+    }
+
+    /**
+     * For testing purposes only
+     *
+     * @return the list of splices currently in the queue
+     */
+    protected List<Splice> getSplicesForTesting() {
+        return new ArrayList<>(splices);
+    }
+
+    /**
+     * Add a new observed split to the list to use
+     *
+     * @param contig  the contig
+     * @param start   the start of the split, inclusive
+     * @param end     the end of the split, inclusive
+     */
+    public void addSplicePosition(final String contig, final int start, final int end) {
+        if ( doNotFixOverhangs )
+            return;
+
+        // is this a new splice?  if not, we are done
+        final Splice splice = new Splice(contig, start, end);
+        if ( splices.contains(splice) )
+            return;
+
+        // initialize it with the reference context
+        // we don't want to do this until we know for sure that it's a new splice position
+        splice.initialize(referenceReader);
+
+        // clear the set of old split positions seen if we hit a new contig
+        final boolean sameContig = splices.isEmpty() || splices.iterator().next().loc.getContig().equals(contig);
+        if ( !sameContig )
+            splices.clear();
+
+        // run this position against the existing reads
+        for ( final SplitRead read : waitingReads )
+            fixSplit(read, splice);
+
+        splices.add(splice);
+
+        if ( splices.size() > MAX_SPLICES_TO_KEEP )
+            cleanSplices();
+    }
+
+    /**
+     * Add a read to the manager
+     *
+     * @param read  the read to add
+     */
+    public void addRead(final GATKSAMRecord read) {
+        if ( read == null ) throw new IllegalArgumentException("read added to manager is null, which is not allowed");
+
+        // if the new read is on a different contig or we have too many reads, then we need to flush the queue and clear the map
+        final boolean tooManyReads = getNReadsInQueue() >= MAX_RECORDS_IN_MEMORY;
+        final boolean encounteredNewContig = getNReadsInQueue() > 0 && !waitingReads.peek().read.getReferenceIndex().equals(read.getReferenceIndex());
+
+        if ( tooManyReads || encounteredNewContig ) {
+            if ( DEBUG ) logger.warn("Flushing queue on " + (tooManyReads ? "too many reads" : ("move to new contig: " + read.getReferenceName() + " from " + waitingReads.peek().read.getReferenceName())) + " at " + read.getAlignmentStart());
+
+            final int targetQueueSize = encounteredNewContig ? 0 : MAX_RECORDS_IN_MEMORY / 2;
+
+            // write the required number of waiting reads to disk
+            while ( getNReadsInQueue() > targetQueueSize )
+                writer.addAlignment(waitingReads.poll().read);
+        }
+
+        final SplitRead splitRead = new SplitRead(read);
+
+        // fix overhangs, as needed
+        for ( final Splice splice : splices)
+            fixSplit(splitRead, splice);
+
+        // add the new read to the queue
+        waitingReads.add(splitRead);
+    }
+
+    /**
+     * Clean up the list of splices
+     */
+    private void cleanSplices() {
+        final int targetQueueSize = splices.size() / 2;
+        final Iterator<Splice> iter = splices.iterator();
+        for ( int i = 0; i < targetQueueSize; i++ ) {
+            iter.next();
+            iter.remove();
+        }
+    }
+
+    /**
+     * Try to fix the given read using the given split
+     *
+     * @param read        the read to fix
+     * @param splice      the split (bad region to clip out)
+     */
+    private void fixSplit(final SplitRead read, final Splice splice) {
+        // if the read doesn't even overlap the split position then we can just exit
+        if ( !splice.loc.overlapsP(read.loc) )
+            return;
+
+        if ( isLeftOverhang(read.loc, splice.loc) ) {
+            final int overhang = splice.loc.getStop() - read.loc.getStart() + 1;
+            if ( overhangingBasesMismatch(read.read.getReadBases(), 0, splice.reference, splice.reference.length - overhang, overhang) ) {
+                final GATKSAMRecord clippedRead = ReadClipper.hardClipByReadCoordinates(read.read, 0, overhang - 1);
+                read.setRead(clippedRead);
+            }
+        }
+        else if ( isRightOverhang(read.loc, splice.loc) ) {
+            final int overhang = read.loc.getStop() - splice.loc.getStart() + 1;
+            if ( overhangingBasesMismatch(read.read.getReadBases(), read.read.getReadLength() - overhang, splice.reference, 0, overhang) ) {
+                final GATKSAMRecord clippedRead = ReadClipper.hardClipByReadCoordinates(read.read, read.read.getReadLength() - overhang, read.read.getReadLength() - 1);
+                read.setRead(clippedRead);
+            }
+        }
+    }
+
+    /**
+     * Is this a proper overhang on the left side of the read?
+     *
+     * @param readLoc    the read's loc
+     * @param spliceLoc   the split's loc
+     * @return true if it's a left side overhang
+     */
+    protected static boolean isLeftOverhang(final GenomeLoc readLoc, final GenomeLoc spliceLoc) {
+        return readLoc.getStart() <= spliceLoc.getStop() && readLoc.getStart() > spliceLoc.getStart() && readLoc.getStop() > spliceLoc.getStop();
+    }
+
+    /**
+     * Is this a proper overhang on the right side of the read?
+     *
+     * @param readLoc    the read's loc
+     * @param spliceLoc   the split's loc
+     * @return true if it's a right side overhang
+     */
+    protected static boolean isRightOverhang(final GenomeLoc readLoc, final GenomeLoc spliceLoc) {
+        return readLoc.getStop() >= spliceLoc.getStart() && readLoc.getStop() < spliceLoc.getStop() && readLoc.getStart() < spliceLoc.getStart();
+    }
+
+    /**
+     * Are there too many mismatches to the reference among the overhanging bases?
+     *
+     * @param read                  the read bases
+     * @param readStartIndex        where to start on the read
+     * @param reference             the reference bases
+     * @param referenceStartIndex   where to start on the reference
+     * @param spanToTest            how many bases to test
+     * @return true if too many overhanging bases mismatch, false otherwise
+     */
+    protected boolean overhangingBasesMismatch(final byte[] read,
+                                               final int readStartIndex,
+                                               final byte[] reference,
+                                               final int referenceStartIndex,
+                                               final int spanToTest) {
+        // don't process too small a span, too large a span, or a span that is most of a read
+        if ( spanToTest < 1 || spanToTest > MAX_BASES_IN_OVERHANG || spanToTest > read.length / 2 )
+            return false;
+
+        int numMismatchesSeen = 0;
+        for ( int i = 0; i < spanToTest; i++ ) {
+            if ( read[readStartIndex + i] != reference[referenceStartIndex + i] ) {
+                if ( ++numMismatchesSeen > MAX_MISMATCHES_IN_OVERHANG )
+                    return true;
+            }
+        }
+
+        // we can still mismatch overall if at least half of the bases mismatch
+        return numMismatchesSeen >= ((spanToTest+1)/2);
+    }
+
+    /**
+     * Close out the manager stream by clearing the read cache
+     */
+    public void close() {
+        // write out all of the remaining reads
+        while ( ! waitingReads.isEmpty() )
+            writer.addAlignment(waitingReads.poll().read);
+    }
+
+    // class to represent the reads with their soft-clip-included GenomeLocs
+    protected final class SplitRead {
+
+        public GATKSAMRecord read;
+        public GenomeLoc loc;
+
+        public SplitRead(final GATKSAMRecord read) {
+            setRead(read);
+        }
+
+        public void setRead(final GATKSAMRecord read) {
+            if ( !read.isEmpty() ) {
+                this.read = read;
+                loc = genomeLocParser.createGenomeLoc(read.getReferenceName(), read.getSoftStart(), read.getSoftEnd());
+            }
+        }
+    }
+
+    // class to represent the comparator for the split reads
+    private final class SplitReadComparator implements Comparator<SplitRead> {
+
+        private final SAMRecordCoordinateComparator readComparator;
+
+        public SplitReadComparator() {
+            readComparator = new SAMRecordCoordinateComparator();
+        }
+
+        public int compare(final SplitRead read1, final SplitRead read2) {
+            return readComparator.compare(read1.read, read2.read);
+        }
+    }
+
+    // class to represent the split positions
+    protected final class Splice {
+
+        public final GenomeLoc loc;
+        public byte[] reference;
+
+        public Splice(final String contig, final int start, final int end) {
+            loc = genomeLocParser.createGenomeLoc(contig, start, end);
+        }
+
+        public void initialize(final CachingIndexedFastaSequenceFile referenceReader) {
+            reference = referenceReader.getSubsequenceAt(loc.getContig(), loc.getStart(), loc.getStop()).getBases();
+        }
+
+        @Override
+        public boolean equals(final Object other) {
+            return other != null && (other instanceof Splice) && this.loc.equals(((Splice)other).loc);
+        }
+
+        @Override
+        public int hashCode() {
+            return loc.hashCode();
+        }
+    }
+
+    // class to represent the comparator for the split reads
+    private final class SpliceComparator implements Comparator<Splice> {
+
+        public int compare(final Splice position1, final Splice position2) {
+            return position1.loc.compareTo(position2.loc);
+        }
+    }
+}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/rnaseq/SplitNCigarReads.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/rnaseq/SplitNCigarReads.java
index 223745431..6b9fca312 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/rnaseq/SplitNCigarReads.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/rnaseq/SplitNCigarReads.java
@@ -47,30 +47,28 @@
 package org.broadinstitute.sting.gatk.walkers.rnaseq;
 
 import net.sf.samtools.*;
+import org.broadinstitute.sting.commandline.Advanced;
 import org.broadinstitute.sting.commandline.Argument;
+import org.broadinstitute.sting.commandline.Hidden;
 import org.broadinstitute.sting.commandline.Output;
 import org.broadinstitute.sting.gatk.CommandLineGATK;
 import org.broadinstitute.sting.gatk.GenomeAnalysisEngine;
 import org.broadinstitute.sting.gatk.contexts.ReferenceContext;
 import org.broadinstitute.sting.gatk.io.StingSAMFileWriter;
-import org.broadinstitute.sting.gatk.iterators.ReadTransformer;
-import org.broadinstitute.sting.gatk.iterators.ReadTransformersMode;
 import org.broadinstitute.sting.gatk.refdata.RefMetaDataTracker;
-import org.broadinstitute.sting.gatk.walkers.BAQMode;
 import org.broadinstitute.sting.gatk.walkers.DataSource;
 import org.broadinstitute.sting.gatk.walkers.ReadWalker;
 import org.broadinstitute.sting.gatk.walkers.Requires;
 import org.broadinstitute.sting.utils.Utils;
-import org.broadinstitute.sting.utils.baq.BAQ;
 import org.broadinstitute.sting.utils.clipping.ReadClipper;
 import org.broadinstitute.sting.utils.exceptions.UserException;
+import org.broadinstitute.sting.utils.fasta.CachingIndexedFastaSequenceFile;
 import org.broadinstitute.sting.utils.help.DocumentedGATKFeature;
 import org.broadinstitute.sting.utils.help.HelpConstants;
 import org.broadinstitute.sting.utils.sam.CigarUtils;
 import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
 
-import java.io.PrintStream;
-import java.util.*;
+import java.io.FileNotFoundException;
 
 /**
  *
@@ -88,119 +86,138 @@ import java.util.*;
 
 @DocumentedGATKFeature( groupName = HelpConstants.DOCS_CAT_DATA, extraDocs = {CommandLineGATK.class} )
 @Requires({DataSource.READS, DataSource.REFERENCE})
-public class SplitNCigarReads extends ReadWalker<List<GATKSAMRecord>, SAMFileWriter> {
+public class SplitNCigarReads extends ReadWalker<GATKSAMRecord, OverhangFixingManager> {
+
+    // The name that will go in the @PG tag
+    public static final String PROGRAM_RECORD_NAME = "GATK SplitNCigarReads";
+
 
     @Output(doc="Write output to this BAM filename instead of STDOUT")
-    StingSAMFileWriter out;
-
-    @Argument(required = false)
-    PrintStream splitPositionsOutput = System.out;
-
-    @Argument(fullName="outputAsBED", shortName="bed", doc="Output as BED file", required=false)
-    boolean outputAsBED = false;
-
-    @Argument(fullName="printSplitPositions", shortName="splitPosition", doc="print the split positions", required=false)
-    boolean printSplitPositions = false;
-
-    public static final String PROGRAM_RECORD_NAME = "GATK SplitNCigarReads";   // The name that will go in the @PG tag
-   // public static SplitPositions splitPositions = null;
-    public static String results = "";
+    protected StingSAMFileWriter writer;
 
     /**
-     * The initialize function.
+     * For expert users only!  To minimize memory consumption you can lower this number, but then the tool may skip
+     * overhang fixing in regions with too much coverage.  Just make sure to give Java enough memory!  4Gb should be
+     * enough with the default value.
      */
+    @Advanced
+    @Argument(fullName="maxReadsInMemory", shortName="maxInMemory", doc="max reads allowed to be kept in memory at a time by the BAM writer", required=false)
+    protected int MAX_RECORDS_IN_MEMORY = 150000;
+
+    /**
+     * If there are more than this many mismatches within the overhang regions, the whole overhang will get hard-clipped out.
+     * It is still possible in some cases that the overhang could get clipped if the number of mismatches do not exceed this
+     * value, e.g. if most of the overhang mismatches.
+     */
+    @Advanced
+    @Argument(fullName="maxMismatchesInOverhang", shortName="maxMismatches", doc="max number of mismatches allowed in the overhang", required=false)
+    protected int MAX_MISMATCHES_IN_OVERHANG = 1;
+
+    /**
+     * If there are more than this many bases in the overhang, we won't try to hard-clip them out
+     */
+    @Advanced
+    @Argument(fullName="maxBasesInOverhang", shortName="maxOverhang", doc="max number of bases allowed in the overhang", required=false)
+    protected int MAX_BASES_TO_CLIP = 40;
+
+    @Argument(fullName="doNotFixOverhangs", shortName="doNotFixOverhangs", doc="do not have the walker hard-clip overhanging sections of the reads", required=false)
+    protected boolean doNotFixOverhangs = false;
+
+    @Hidden
+    @Argument(fullName = "no_pg_tag", shortName = "npt", doc = "Necessary for integration tests", required = false)
+    protected boolean NO_PG_TAG = false;
+
+    /**
+     * This stores all of the already-split reads and manages any processing (e.g. clipping overhangs) that happens to them.
+     * It will emit reads to the underlying writer as needed so we don't need to worry about any of that in this class.
+     */
+    protected OverhangFixingManager overhangManager;
+
+
+    @Override
     public void initialize() {
         final GenomeAnalysisEngine toolkit = getToolkit();
 
-        final boolean preSorted = false;
-        if (getToolkit() != null) {
-            Utils.setupWriter(out, toolkit, toolkit.getSAMFileHeader(), preSorted, this, PROGRAM_RECORD_NAME);
+        if ( !NO_PG_TAG ) {
+            // we don't want to assume that reads will be written in order by the manager because in deep, deep pileups it won't work
+            Utils.setupWriter(writer, toolkit, toolkit.getSAMFileHeader(), false, this, PROGRAM_RECORD_NAME);
+        }
+
+        try {
+            final CachingIndexedFastaSequenceFile referenceReader = new CachingIndexedFastaSequenceFile(toolkit.getArguments().referenceFile);
+            overhangManager = new OverhangFixingManager(writer, toolkit.getGenomeLocParser(), referenceReader, MAX_RECORDS_IN_MEMORY, MAX_MISMATCHES_IN_OVERHANG, MAX_BASES_TO_CLIP, doNotFixOverhangs);
+        }
+        catch (FileNotFoundException ex) {
+            throw new UserException.CouldNotReadInputFile(toolkit.getArguments().referenceFile, ex);
         }
-        out.setPresorted(preSorted);
-      //  splitPositions = new SplitPositions();
     }
 
-    /**
-     * The reads map function.
-     *
-     * @param ref  the reference bases that correspond to our read, if a reference was provided
-     * @param read the read itself, as a GATKSAMRecord
-     *
-     * @return a list of split read if there are N's in the cigar string, or the read itself.
-     */
-    public List<GATKSAMRecord> map(final ReferenceContext ref,final GATKSAMRecord read,final RefMetaDataTracker metaDataTracker) {
-          return splitNCigarRead(read);
+    @Override
+    public GATKSAMRecord map(final ReferenceContext ref, final GATKSAMRecord read, final RefMetaDataTracker metaDataTracker) {
+          return read;
+    }
+
+    @Override
+    public OverhangFixingManager reduceInit() {
+        return overhangManager;
+    }
+
+    @Override
+    public OverhangFixingManager reduce(final GATKSAMRecord read, final OverhangFixingManager manager) {
+        splitNCigarRead(read, manager);
+        return manager;
+    }
+
+    @Override
+    public void onTraversalDone(final OverhangFixingManager manager) {
+        manager.close();
     }
 
     /**
      * Goes through the cigar string of the read and create new reads for each consecutive non-N elements (while hard clipping the rest of the read).
      * For example: for a read with cigar '1H2M2D1M2N1M2I1N1M2S' 3 new reads will be created with cigar strings: 1H2M2D1M, 1M2I and 1M2S
      *
-     * @param read the read to split, as a GATKSAMRecord
-     * @return a list of split read if there are N's in the cigar string, or the read itself.
+     * @param read     the read to split
+     * @param manager  the output manager
      */
+    public static void splitNCigarRead(final GATKSAMRecord read, final OverhangFixingManager manager) {
+        final int numCigarElements = read.getCigar().numCigarElements();
 
-    public static List<GATKSAMRecord> splitNCigarRead(final GATKSAMRecord read){
-        final List<GATKSAMRecord> splitReads = new ArrayList<>();
         int firstCigarIndex = 0;
-        for (int i = 0; i < read.getCigar().numCigarElements(); i ++){
+        for ( int i = 0; i < numCigarElements; i++ ) {
             final CigarElement cigarElement = read.getCigar().getCigarElement(i);
-            if(cigarElement.getOperator() == CigarOperator.N){
-                final boolean addToSplitPositions = true;
-                splitReads.add(splitReadBasedOnCigar(read,firstCigarIndex,i, addToSplitPositions));
+            if (cigarElement.getOperator() == CigarOperator.N) {
+                manager.addRead(splitReadBasedOnCigar(read, firstCigarIndex, i, manager));
                 firstCigarIndex = i+1;
             }
         }
-        //if there are no N's in the read
-        if (firstCigarIndex == 0)
-            splitReads.add(read);
 
+        // if there are no N's in the read
+        if (firstCigarIndex == 0) {
+            manager.addRead(read);
+        }
         //add the last section of the read: from the last N to the the end of the read
         // (it will be done for all the usual cigar string that does not end with N)
-        else if(firstCigarIndex < read.getCigar().numCigarElements()){
-            final boolean addToSplitPositions = false;
-            splitReads.add(splitReadBasedOnCigar(read,firstCigarIndex,read.getCigar().numCigarElements(), addToSplitPositions));
+        else if (firstCigarIndex < numCigarElements) {
+            manager.addRead(splitReadBasedOnCigar(read, firstCigarIndex, numCigarElements, null));
         }
-        return splitReads;
-    }
-
-
-    /**
-     * reduceInit is called once before any calls to the map function.  We use it here to setup the splitPositionsOutput
-     * bam file, if it was specified on the command line
-     *
-     * @return SAMFileWriter, set to the BAM splitPositionsOutput file if the command line option was set, null otherwise
-     */
-    public SAMFileWriter reduceInit() {
-        return out;
     }
 
     /**
-     * given a read and a splitPositionsOutput location, reduce by emitting the read
+     * Pull out an individual split position for a read
      *
-     * @param reads   the split reads itself
-     * @param output the splitPositionsOutput source
-     * @return the SAMFileWriter, so that the next reduce can emit to the same source
+     * @param read               the read being split
+     * @param cigarStartIndex    the index of the first cigar element to keep
+     * @param cigarEndIndex      the index of the last cigar element to keep
+     * @param forSplitPositions  the manager for keeping track of split positions; can be null
+     * @return a non-null read representing the section of the original read being split out
      */
-    public SAMFileWriter reduce(final List<GATKSAMRecord> reads,final SAMFileWriter output ) {
-        for (final GATKSAMRecord read: reads)
-            output.addAlignment(read);
-        return output;
-    }
-
-    public void onTraversalDone(SAMFileWriter readResult) {
-        super.onTraversalDone(readResult);
-        if(printSplitPositions)
-            splitPositionsOutput.println(results);
-    //        splitPositionsOutput.println(splitPositions);
-
-    }
-    private static GATKSAMRecord splitReadBasedOnCigar(final GATKSAMRecord read, final int cigarStartIndex, final int cigarEndIndex, final boolean addToSplitPositions){
+    private static GATKSAMRecord splitReadBasedOnCigar(final GATKSAMRecord read, final int cigarStartIndex, final int cigarEndIndex, final OverhangFixingManager forSplitPositions) {
         int cigarFirstIndex = cigarStartIndex;
         int cigarSecondIndex = cigarEndIndex;
 
-        //in case a section of the read is end or start with D (for example the first section in 1M1D1N1M is 1M1D), we should trim this cigar element
-        // it can be if, but it was kept as while to make sure the code can work with Cigar string that were not "cleaned"
+        //in case a section of the read ends or starts with D (for example the first section in 1M1D1N1M is 1M1D), we should trim this cigar element
+        // it can be 'if', but it was kept as 'while' to make sure the code can work with Cigar strings that were not "cleaned"
         while(read.getCigar().getCigarElement(cigarFirstIndex).getOperator().equals(CigarOperator.D))
             cigarFirstIndex++;
         while(read.getCigar().getCigarElement(cigarSecondIndex-1).getOperator().equals(CigarOperator.D))
@@ -213,54 +230,13 @@ public class SplitNCigarReads extends ReadWalker<List<GATKSAMRecord>, SAMFileWri
         final int startRefIndex = read.getOriginalAlignmentStart() + CigarUtils.countRefBasesBasedOnCigar(read,0,cigarFirstIndex); //goes through the prefix of the cigar (up to cigarStartIndex) and move the reference index.
         final int stopRefIndex = startRefIndex + CigarUtils.countRefBasesBasedOnCigar(read,cigarFirstIndex,cigarSecondIndex)-1; //goes through a consecutive non-N section of the cigar (up to cigarEndIndex) and move the reference index.
 
-        if(addToSplitPositions){
-            final int splitPosition = startRefIndex + CigarUtils.countRefBasesBasedOnCigar(read,cigarFirstIndex,cigarEndIndex);  //we use cigarEndIndex instead of cigarSecondIndex so we won't take into account the D's at the end.
+        if ( forSplitPositions != null ) {
             final String contig = read.getReferenceName();
-//            results += String.format("%s:%d-%d\n", contig, splitPosition, splitPosition );
-//            splitPositions.addSplitPosition(contig,splitPosition);
+            final int splitStart = startRefIndex + CigarUtils.countRefBasesBasedOnCigar(read,cigarFirstIndex,cigarEndIndex);  //we use cigarEndIndex instead of cigarSecondIndex so we won't take into account the D's at the end.
+            final int splitEnd = splitStart + read.getCigar().getCigarElement(cigarEndIndex).getLength() - 1;
+            forSplitPositions.addSplicePosition(contig, splitStart, splitEnd);
         }
 
         return ReadClipper.hardClipToRegionIncludingClippedBases(read, startRefIndex, stopRefIndex);
-
     }
-
-    private class SplitPosition {
-        public final String contig;
-        public final int start;
-        public final int end;
-
-        public SplitPosition(final String c, final int position) {
-            contig = c;
-            start = position;
-            end = position;
-        }
-    }
-
-
-   private class SplitPositions {
-        private final HashSet<SplitPosition> splitPositions;
-
-        public SplitPositions() {
-            splitPositions = new HashSet<>();
-        }
-
-        public void addSplitPosition(final String contig, final int position) {
-            final SplitPosition newSplitPosition = new SplitPosition(contig, position);
-            splitPositions.add(newSplitPosition);
-        }
-
-        public String toString() {
-            String result = ""; // = "Contig\tstart\tstop\n";
-
-            for (SplitPosition position: splitPositions) {
-                if (outputAsBED)
-                    result += String.format("%s\t%d\t%d\n", position.contig, position.start-1, position.end );
-                else
-                    result += String.format("%s:%d-%d\n", position.contig, position.start, position.end );
-            }
-            return result;
-        }
-    }
-
-
 }
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/rnaseq/OverhangFixingManagerUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/rnaseq/OverhangFixingManagerUnitTest.java
new file mode 100644
index 000000000..62f6bcfbd
--- /dev/null
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/rnaseq/OverhangFixingManagerUnitTest.java
@@ -0,0 +1,172 @@
+/*
+*  By downloading the PROGRAM you agree to the following terms of use:
+*  
+*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
+*  
+*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
+*  
+*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
+*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
+*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
+*  
+*  1. DEFINITIONS
+*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
+*  
+*  2. LICENSE
+*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
+*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
+*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
+*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
+*  
+*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
+*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
+*  Copyright 2012 Broad Institute, Inc.
+*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
+*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
+*  
+*  4. INDEMNIFICATION
+*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
+*  
+*  5. NO REPRESENTATIONS OR WARRANTIES
+*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
+*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
+*  
+*  6. ASSIGNMENT
+*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
+*  
+*  7. MISCELLANEOUS
+*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
+*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
+*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
+*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
+*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
+*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
+*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
+*/
+
+package org.broadinstitute.sting.gatk.walkers.rnaseq;
+
+import org.broadinstitute.sting.BaseTest;
+import org.broadinstitute.sting.utils.GenomeLoc;
+import org.broadinstitute.sting.utils.GenomeLocParser;
+import org.broadinstitute.sting.utils.fasta.CachingIndexedFastaSequenceFile;
+import org.testng.Assert;
+import org.testng.annotations.BeforeClass;
+import org.testng.annotations.DataProvider;
+import org.testng.annotations.Test;
+
+import java.io.File;
+import java.io.FileNotFoundException;
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.List;
+
+public class OverhangFixingManagerUnitTest extends BaseTest {
+
+    private CachingIndexedFastaSequenceFile referenceReader;
+    private GenomeLocParser genomeLocParser;
+
+    @BeforeClass
+    public void setup() throws FileNotFoundException {
+        referenceReader = new CachingIndexedFastaSequenceFile(new File(b37KGReference));
+        genomeLocParser = new GenomeLocParser(referenceReader.getSequenceDictionary());
+    }
+
+    @Test
+    public void testCleanSplices() {
+
+        final OverhangFixingManager manager = new OverhangFixingManager(null, genomeLocParser, referenceReader, 10000, 1, 40, false);
+
+        final int offset = 10;
+        for ( int i = 0; i < OverhangFixingManager.MAX_SPLICES_TO_KEEP + 1; i++ )
+            manager.addSplicePosition("20", offset + i, offset + 1 + i);
+
+        final List<OverhangFixingManager.Splice> splices = manager.getSplicesForTesting();
+
+        Assert.assertEquals(splices.size(), (OverhangFixingManager.MAX_SPLICES_TO_KEEP / 2) + 1);
+
+        final int minStartPos = (OverhangFixingManager.MAX_SPLICES_TO_KEEP / 2) + offset;
+
+        for ( final OverhangFixingManager.Splice splice : splices )
+            Assert.assertTrue(splice.loc.getStart() >= minStartPos);
+    }
+
+    @DataProvider(name = "OverhangTest")
+    public Object[][] makeOverhangData() {
+        final List<Object[]> tests = new ArrayList<>();
+        for ( int leftRead : Arrays.asList(10, 20, 30, 40) ) {
+            for ( int rightRead : Arrays.asList(20, 30, 40, 50) ) {
+                if ( leftRead >= rightRead )
+                    continue;
+                for ( int leftSplice : Arrays.asList(10, 20, 30) ) {
+                    for ( int rightSplice : Arrays.asList(20, 30, 40) ) {
+                        if ( leftSplice >= rightSplice )
+                            continue;
+
+                        final GenomeLoc readLoc = genomeLocParser.createGenomeLoc("1", leftRead, rightRead);
+                        final GenomeLoc spliceLoc = genomeLocParser.createGenomeLoc("1", leftSplice, rightSplice);
+                        tests.add(new Object[]{readLoc, spliceLoc});
+                    }
+                }
+            }
+        }
+        return tests.toArray(new Object[][]{});
+    }
+
+    @Test(dataProvider = "OverhangTest")
+    public void testLeftOverhangs(final GenomeLoc readLoc, final GenomeLoc spliceLoc) {
+        final boolean isValidOverhang = readLoc.getStart() <= spliceLoc.getStop() &&
+                readLoc.getStop() > spliceLoc.getStop() &&
+                readLoc.getStart() > spliceLoc.getStart();
+        Assert.assertEquals(OverhangFixingManager.isLeftOverhang(readLoc, spliceLoc), isValidOverhang, readLoc + " vs. " + spliceLoc);
+    }
+
+    @Test(dataProvider = "OverhangTest")
+    public void testRightOverhangs(final GenomeLoc readLoc, final GenomeLoc spliceLoc) {
+        final boolean isValidOverhang = readLoc.getStop() >= spliceLoc.getStart() &&
+                readLoc.getStop() < spliceLoc.getStop() &&
+                readLoc.getStart() < spliceLoc.getStart();
+        Assert.assertEquals(OverhangFixingManager.isRightOverhang(readLoc, spliceLoc), isValidOverhang, readLoc + " vs. " + spliceLoc);
+    }
+
+    @DataProvider(name = "MismatchEdgeConditionTest")
+    public Object[][] makeMismatchEdgeConditionData() {
+        final List<Object[]> tests = new ArrayList<>();
+        tests.add(new Object[]{null, 1, null, 1, 0});
+        tests.add(new Object[]{null, 1, null, 1, 100});
+        tests.add(new Object[]{new byte[4], 1, null, 1, 3});
+        return tests.toArray(new Object[][]{});
+    }
+
+    @Test(dataProvider = "MismatchEdgeConditionTest")
+    public void testMismatchEdgeCondition(final byte[] read, final int readStart, final byte[] ref, final int refStart, final int overhang) {
+        final OverhangFixingManager manager = new OverhangFixingManager(null, genomeLocParser, referenceReader, 10000, 1, 40, false);
+        Assert.assertFalse(manager.overhangingBasesMismatch(read, readStart, ref, refStart, overhang));
+    }
+
+    @DataProvider(name = "MismatchTest")
+    public Object[][] makeMismatchData() {
+        final List<Object[]> tests = new ArrayList<>();
+
+        final byte[] AAAA = new byte[]{(byte)'A', (byte)'A', (byte)'A', (byte)'A'};
+        final byte[] AAAC = new byte[]{(byte)'A', (byte)'A', (byte)'A', (byte)'C'};
+        final byte[] AAAAAA = new byte[]{(byte)'A', (byte)'A', (byte)'A', (byte)'A', (byte)'A', (byte)'A'};
+        final byte[] AAAACA = new byte[]{(byte)'A', (byte)'A', (byte)'A', (byte)'A', (byte)'C', (byte)'A'};
+        final byte[] AAAACC = new byte[]{(byte)'A', (byte)'A', (byte)'A', (byte)'A', (byte)'C', (byte)'C'};
+
+        tests.add(new Object[]{AAAA, 2, AAAA, 2, 2, false});
+        tests.add(new Object[]{AAAA, 2, AAAC, 2, 2, true});
+        tests.add(new Object[]{AAAAAA, 3, AAAACA, 3, 3, false});
+        tests.add(new Object[]{AAAAAA, 3, AAAACC, 3, 3, true});
+        tests.add(new Object[]{AAAAAA, 4, AAAACC, 4, 2, true});
+        tests.add(new Object[]{AAAAAA, 2, AAAACC, 2, 3, false});
+
+        return tests.toArray(new Object[][]{});
+    }
+
+    @Test(dataProvider = "MismatchTest")
+    public void testMismatch(final byte[] read, final int readStart, final byte[] ref, final int refStart, final int overhang, final boolean expected) {
+        final OverhangFixingManager manager = new OverhangFixingManager(null, genomeLocParser, referenceReader, 10000, 1, 40, false);
+        Assert.assertEquals(manager.overhangingBasesMismatch(read, readStart, ref, refStart, overhang), expected, new String(read) + " vs. " + new String(ref) + " @" + overhang);
+    }
+}
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/rnaseq/SplitNCigarReadsIntegrationTests.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/rnaseq/SplitNCigarReadsIntegrationTest.java
similarity index 79%
rename from protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/rnaseq/SplitNCigarReadsIntegrationTests.java
rename to protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/rnaseq/SplitNCigarReadsIntegrationTest.java
index 398fe221c..87af68fc4 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/rnaseq/SplitNCigarReadsIntegrationTests.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/rnaseq/SplitNCigarReadsIntegrationTest.java
@@ -48,7 +48,6 @@ package org.broadinstitute.sting.gatk.walkers.rnaseq;
 
 import org.broadinstitute.sting.WalkerTest;
 import org.testng.annotations.Test;
-import org.broadinstitute.sting.BaseTest;
 import java.util.Arrays;
 
 /**
@@ -57,27 +56,57 @@ import java.util.Arrays;
  * Date: 12/5/13
  * Time: 1:04 PM
  */
-public class SplitNCigarReadsIntegrationTests extends WalkerTest {
+public class SplitNCigarReadsIntegrationTest extends WalkerTest {
 
-    @Test
+    @Test(enabled = false)
     // contain reads without N's, with N's and with N's and I's
+    // TODO -- Ami: please put the bam file in the repo
     public void testSplitWithInsertions() {
         WalkerTest.WalkerTestSpec spec = new WalkerTest.WalkerTestSpec(
-                "-T SplitNCigarReads -R " + BaseTest.b37KGReference + " -I " + BaseTest.privateTestDir + "SplitNCigarReads.integrationTest.unsplitReads.withI.bam -o %s -U ALLOW_N_CIGAR_READS", 1,
+                "-T SplitNCigarReads -R " + b37KGReference + " -I " + privateTestDir + "SplitNCigarReads.integrationTest.unsplitReads.withI.bam -o %s --no_pg_tag -U ALLOW_N_CIGAR_READS", 1,
                 Arrays.asList("037c72fe1572efb63cccbe0a8dda3cb1"));
         executeTest("test split N cigar reads with insertions", spec);
     }
 
-    @Test
+    @Test(enabled = false)
     // contain reads without N's, with N's and with N's and D's, and also with more then one N element in the cigar.
+    // TODO -- Ami: please put the bam file in the repo
     public void testSplitWithDeletions() {
         WalkerTest.WalkerTestSpec spec = new WalkerTest.WalkerTestSpec(
-                "-T SplitNCigarReads -R " + BaseTest.b37KGReference + " -I " + BaseTest.privateTestDir + "SplitNCigarReads.integrationTest.unsplitReads.withD.bam -o %s -U ALLOW_N_CIGAR_READS", 1,
+                "-T SplitNCigarReads -R " + b37KGReference + " -I " + privateTestDir + "SplitNCigarReads.integrationTest.unsplitReads.withD.bam -o %s --no_pg_tag -U ALLOW_N_CIGAR_READS", 1,
                 Arrays.asList("8472005c16353715025353d6d453faf4"));
         executeTest("test split N cigar reads with deletions", spec);
     }
 
+    @Test
+    public void testSplitsWithOverhangs() {
+        WalkerTest.WalkerTestSpec spec = new WalkerTest.WalkerTestSpec(
+                "-T SplitNCigarReads -R " + b37KGReference + " -I " + privateTestDir + "NA12878.RNAseq.bam -o %s --no_pg_tag -U ALLOW_N_CIGAR_READS", 1,
+                Arrays.asList("2832abc680c6b5a0219702ad5bf22f01"));
+        executeTest("test splits with overhangs", spec);
+    }
 
+    @Test
+    public void testSplitsWithOverhangsNotClipping() {
+        WalkerTest.WalkerTestSpec spec = new WalkerTest.WalkerTestSpec(
+                "-T SplitNCigarReads --doNotFixOverhangs -R " + b37KGReference + " -I " + privateTestDir + "NA12878.RNAseq.bam -o %s --no_pg_tag -U ALLOW_N_CIGAR_READS", 1,
+                Arrays.asList("59783610006bf7a1ccae57ee2016123b"));
+        executeTest("test splits with overhangs not clipping", spec);
+    }
 
+    @Test
+    public void testSplitsWithOverhangs0Mismatches() {
+        WalkerTest.WalkerTestSpec spec = new WalkerTest.WalkerTestSpec(
+                "-T SplitNCigarReads --maxMismatchesInOverhang 0 -R " + b37KGReference + " -I " + privateTestDir + "NA12878.RNAseq.bam -o %s --no_pg_tag -U ALLOW_N_CIGAR_READS", 1,
+                Arrays.asList("7547a5fc41ebfd1bbe62ce854b37b6ef"));
+        executeTest("test splits with overhangs 0 mismatches", spec);
+    }
 
+    @Test
+    public void testSplitsWithOverhangs5BasesInOverhang() {
+        WalkerTest.WalkerTestSpec spec = new WalkerTest.WalkerTestSpec(
+                "-T SplitNCigarReads --maxBasesInOverhang 5 -R " + b37KGReference + " -I " + privateTestDir + "NA12878.RNAseq.bam -o %s --no_pg_tag -U ALLOW_N_CIGAR_READS", 1,
+                Arrays.asList("f222eb02b003c08d4a606ab1bcb7931b"));
+        executeTest("test splits with overhangs 5 bases in overhang", spec);
+    }
 }
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/rnaseq/SplitNCigarReadsUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/rnaseq/SplitNCigarReadsUnitTest.java
index 7eb95877d..d0f8280af 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/rnaseq/SplitNCigarReadsUnitTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/rnaseq/SplitNCigarReadsUnitTest.java
@@ -49,12 +49,17 @@ package org.broadinstitute.sting.gatk.walkers.rnaseq;
 import net.sf.samtools.Cigar;
 import net.sf.samtools.CigarElement;
 import net.sf.samtools.CigarOperator;
-import org.broadinstitute.sting.gatk.walkers.rnaseq.SplitNCigarReads;
+import org.broadinstitute.sting.BaseTest;
+import org.broadinstitute.sting.utils.GenomeLocParser;
 import org.broadinstitute.sting.utils.clipping.ReadClipperTestUtils;
+import org.broadinstitute.sting.utils.fasta.CachingIndexedFastaSequenceFile;
 import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
 import org.testng.Assert;
+import org.testng.annotations.BeforeClass;
 import org.testng.annotations.Test;
 
+import java.io.File;
+import java.io.FileNotFoundException;
 import java.util.Arrays;
 import java.util.LinkedList;
 import java.util.List;
@@ -69,7 +74,7 @@ import java.util.List;
  * Date: 11/14/13
  * Time: 6:49 PM
  */
-public class SplitNCigarReadsUnitTest {
+public class SplitNCigarReadsUnitTest extends BaseTest {
     final static CigarElement[] cigarElements = {
             new CigarElement(1, CigarOperator.HARD_CLIP),
             new CigarElement(1, CigarOperator.SOFT_CLIP),
@@ -79,6 +84,21 @@ public class SplitNCigarReadsUnitTest {
             new CigarElement(1, CigarOperator.SKIPPED_REGION)
     };
 
+    private CachingIndexedFastaSequenceFile referenceReader;
+    private GenomeLocParser genomeLocParser;
+
+    @BeforeClass
+    public void setup() throws FileNotFoundException {
+        referenceReader = new CachingIndexedFastaSequenceFile(new File(hg18Reference));
+        genomeLocParser = new GenomeLocParser(referenceReader.getSequenceDictionary());
+    }
+
+    private final class TestManager extends OverhangFixingManager {
+        public TestManager() {
+            super(null, genomeLocParser, referenceReader, 10000, 1, 40, false);
+        }
+    }
+
     @Test(enabled = true)
     public void splitReadAtN() {
         final int cigarStringLength = 10;
@@ -94,26 +114,27 @@ public class SplitNCigarReadsUnitTest {
 
         for(Cigar cigar: cigarList){
 
-
             final int numOfSplits = numOfNElements(cigar.getCigarElements());
 
             if(numOfSplits != 0 && isCigarDoesNotHaveEmptyRegionsBetweenNs(cigar)){
 
+                final TestManager manager = new TestManager();
                 GATKSAMRecord read = ReadClipperTestUtils.makeReadFromCigar(cigar);
-                List<GATKSAMRecord> splitReads = SplitNCigarReads.splitNCigarRead(read);
+                SplitNCigarReads.splitNCigarRead(read, manager);
+                List<OverhangFixingManager.SplitRead> splitReads = manager.getReadsInQueueForTesting();
                 final int expectedReads = numOfSplits+1;
                 Assert.assertEquals(splitReads.size(),expectedReads,"wrong number of reads after split read with cigar: "+cigar+" at Ns [expected]: "+expectedReads+" [actual value]: "+splitReads.size());
                 final List<Integer> readLengths = consecutiveNonNElements(read.getCigar().getCigarElements());
                 int index = 0;
                 int offsetFromStart = 0;
-                for(GATKSAMRecord splitRead: splitReads){
+                for(final OverhangFixingManager.SplitRead splitRead: splitReads){
                     int expectedLength = readLengths.get(index);
-                    Assert.assertTrue(splitRead.getReadLength() == expectedLength,
+                    Assert.assertTrue(splitRead.read.getReadLength() == expectedLength,
                             "the "+index+" (starting with 0) split read has a wrong length.\n" +
                             "cigar of original read: "+cigar+"\n"+
                             "expected length: "+expectedLength+"\n"+
-                            "actual length: "+splitRead.getReadLength()+"\n");
-                    assertBases(splitRead.getReadBases(), read.getReadBases(), offsetFromStart);
+                            "actual length: "+splitRead.read.getReadLength()+"\n");
+                    assertBases(splitRead.read.getReadBases(), read.getReadBases(), offsetFromStart);
                     index++;
                     offsetFromStart += expectedLength;
                 }

From fa65716fe944112ea6f05271dce3e14ea19795a1 Mon Sep 17 00:00:00 2001
From: Eric Banks <ebanks@broadinstitute.org>
Date: Sun, 2 Feb 2014 04:16:31 -0500
Subject: [PATCH 08/18] Added code to retrieve dangling heads from the read
 threading graph (previously we were rescuing just the tails).

The purpose of this is to be able to call SNPs that fall at the beginning of a capture region (or exon).
Before, the read threading code would only start threading from the first kmer that matched the reference.  But
that means that, in the case of a SNP at the beginning of an exome, it wouldn't start threading the read until
after the SNP position - so we'd lose the SNP.

For now, this is still very experimental.  It works well for RNAseq data, but does introduce FPs in normal exomes.
I know why this is and how to fix it, but it requires a much larger fix to the HC: the HC needs to pass all reads
and bases to the annotation engine (like UG does) instead of just the high quality ones.  So for now, the head
merging is disabled by default.

As per reviewer comments, I moved the head and tail merging code out into their own class.
---
 .../haplotypecaller/HaplotypeCaller.java      |   8 +
 .../haplotypecaller/LocalAssemblyEngine.java  |   9 +
 .../haplotypecaller/graphs/BaseGraph.java     |  18 -
 .../graphs/DeBruijnVertex.java                |   8 -
 .../DanglingChainMergingGraph.java            | 520 ++++++++++++++++++
 .../readthreading/HaplotypeGraph.java         |   5 +-
 .../readthreading/ReadThreadingAssembler.java |   3 +-
 .../readthreading/ReadThreadingGraph.java     | 300 +---------
 .../VariantAnnotatorIntegrationTest.java      |   2 +-
 ...lexAndSymbolicVariantsIntegrationTest.java |   4 +-
 .../HaplotypeCallerIntegrationTest.java       |  10 +-
 .../graphs/BaseGraphUnitTest.java             |  15 -
 .../DanglingChainMergingGraphUnitTest.java    | 230 ++++++++
 .../ReadThreadingAssemblerUnitTest.java       |  23 +
 .../ReadThreadingGraphUnitTest.java           |  83 ---
 15 files changed, 829 insertions(+), 409 deletions(-)
 create mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraph.java
 create mode 100644 protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraphUnitTest.java

diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCaller.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCaller.java
index ad05e87d9..13403c0ac 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCaller.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCaller.java
@@ -278,6 +278,13 @@ public class HaplotypeCaller extends ActiveRegionWalker<List<VariantContext>, In
     @Argument(fullName="numPruningSamples", shortName="numPruningSamples", doc="The number of samples that must pass the minPuning factor in order for the path to be kept", required = false)
     protected int numPruningSamples = 1;
 
+    /**
+     * This mode is currently experimental and should only be used in the RNA-seq calling pipeline.
+     */
+    @Advanced
+    @Argument(fullName="recoverDanglingHeads", shortName="recoverDanglingHeads", doc="Should we enable dangling head recovery in the read threading assembler?", required = false)
+    protected boolean recoverDanglingHeads = false;
+
     @Hidden
     @Argument(fullName="dontRecoverDanglingTails", shortName="dontRecoverDanglingTails", doc="Should we disable dangling tail recovery in the read threading assembler?", required = false)
     protected boolean dontRecoverDanglingTails = false;
@@ -634,6 +641,7 @@ public class HaplotypeCaller extends ActiveRegionWalker<List<VariantContext>, In
         assemblyEngine.setDebugGraphTransformations(debugGraphTransformations);
         assemblyEngine.setAllowCyclesInKmerGraphToGeneratePaths(allowCyclesInKmerGraphToGeneratePaths);
         assemblyEngine.setRecoverDanglingTails(!dontRecoverDanglingTails);
+        assemblyEngine.setRecoverDanglingHeads(recoverDanglingHeads);
         assemblyEngine.setMinBaseQualityToUseInAssembly(MIN_BASE_QUALTY_SCORE);
 
         MIN_TAIL_QUALITY = (byte)(MIN_BASE_QUALTY_SCORE - 1);
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/LocalAssemblyEngine.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/LocalAssemblyEngine.java
index d0e28d878..d49827405 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/LocalAssemblyEngine.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/LocalAssemblyEngine.java
@@ -86,6 +86,7 @@ public abstract class LocalAssemblyEngine {
     protected boolean allowCyclesInKmerGraphToGeneratePaths = false;
     protected boolean debugGraphTransformations = false;
     protected boolean recoverDanglingTails = true;
+    protected boolean recoverDanglingHeads = true;
 
     protected byte minBaseQualityToUseInAssembly = DEFAULT_MIN_BASE_QUALITY_TO_USE;
     protected int pruneFactor = 2;
@@ -456,4 +457,12 @@ public abstract class LocalAssemblyEngine {
     public void setRecoverDanglingTails(boolean recoverDanglingTails) {
         this.recoverDanglingTails = recoverDanglingTails;
     }
+
+    public boolean isRecoverDanglingHeads() {
+        return recoverDanglingHeads;
+    }
+
+    public void setRecoverDanglingHeads(boolean recoverDanglingHeads) {
+        this.recoverDanglingHeads = recoverDanglingHeads;
+    }
 }
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/BaseGraph.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/BaseGraph.java
index edd8dbb16..c9d51b81b 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/BaseGraph.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/BaseGraph.java
@@ -646,24 +646,6 @@ public class BaseGraph<V extends BaseVertex, E extends BaseEdge> extends Default
                 '}';
     }
 
-    /**
-     * The base sequence for the given path.
-     * Note, this assumes that the path does not start with a source node.
-     *
-     * @param path the list of vertexes that make up the path
-     * @return  non-null sequence of bases corresponding to the given path
-     */
-    @Ensures({"result != null"})
-    public byte[] getBasesForPath(final List<? extends DeBruijnVertex> path) {
-        if ( path == null ) throw new IllegalArgumentException("Path cannot be null");
-
-        final StringBuffer sb = new StringBuffer();
-        for ( final DeBruijnVertex v : path )
-            sb.append((char)v.getSuffix());
-
-        return sb.toString().getBytes();
-    }
-
     /**
      * Get the set of vertices within distance edges of source, regardless of edge direction
      *
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/DeBruijnVertex.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/DeBruijnVertex.java
index ec2ccff20..cf95f6a5a 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/DeBruijnVertex.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/DeBruijnVertex.java
@@ -65,14 +65,6 @@ public class DeBruijnVertex extends BaseVertex {
         super(sequence);
     }
 
-    /**
-     * For testing purposes only
-     * @param sequence
-     */
-    protected DeBruijnVertex( final String sequence ) {
-        this(sequence.getBytes());
-    }
-
     /**
      * Get the kmer size for this DeBruijnVertex
      * @return integer >= 1
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraph.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraph.java
new file mode 100644
index 000000000..e59d39a97
--- /dev/null
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraph.java
@@ -0,0 +1,520 @@
+/*
+*  By downloading the PROGRAM you agree to the following terms of use:
+*  
+*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
+*  
+*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
+*  
+*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
+*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
+*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
+*  
+*  1. DEFINITIONS
+*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
+*  
+*  2. LICENSE
+*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
+*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
+*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
+*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
+*  
+*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
+*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
+*  Copyright 2012 Broad Institute, Inc.
+*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
+*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
+*  
+*  4. INDEMNIFICATION
+*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
+*  
+*  5. NO REPRESENTATIONS OR WARRANTIES
+*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
+*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
+*  
+*  6. ASSIGNMENT
+*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
+*  
+*  7. MISCELLANEOUS
+*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
+*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
+*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
+*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
+*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
+*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
+*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
+*/
+
+package org.broadinstitute.sting.gatk.walkers.haplotypecaller.readthreading;
+
+import com.google.java.contract.Ensures;
+import net.sf.samtools.Cigar;
+import net.sf.samtools.CigarElement;
+import net.sf.samtools.CigarOperator;
+import org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs.*;
+import org.broadinstitute.sting.utils.sam.AlignmentUtils;
+import org.broadinstitute.sting.utils.smithwaterman.*;
+import org.jgrapht.EdgeFactory;
+
+import java.util.*;
+
+public abstract class DanglingChainMergingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSampleEdge> {
+
+    private static final int MAX_CIGAR_COMPLEXITY = 3;
+    private static final int MIN_DANGLING_TAIL_LENGTH = 5;  // SNP + 3 stabilizing nodes + the LCA
+    private static final int MAXIMUM_MISMATCHES_IN_DANGLING_HEAD_MERGE = 1;
+
+    protected boolean alreadyBuilt;
+
+    /**
+     * Create a new ReadThreadingAssembler using kmerSize for matching
+     * @param kmerSize must be >= 1
+     */
+    protected DanglingChainMergingGraph(final int kmerSize, final EdgeFactory<MultiDeBruijnVertex, MultiSampleEdge> edgeFactory) {
+        super(kmerSize, edgeFactory);
+    }
+
+    /**
+     * Edge factory that encapsulates the numPruningSamples assembly parameter
+     */
+    protected static class MyEdgeFactory implements EdgeFactory<MultiDeBruijnVertex, MultiSampleEdge> {
+        final int numPruningSamples;
+
+        public MyEdgeFactory(int numPruningSamples) {
+            this.numPruningSamples = numPruningSamples;
+        }
+
+        @Override
+        public MultiSampleEdge createEdge(final MultiDeBruijnVertex sourceVertex, final MultiDeBruijnVertex targetVertex) {
+            return new MultiSampleEdge(false, 1, numPruningSamples);
+        }
+
+        public MultiSampleEdge createEdge(final boolean isRef, final int multiplicity) {
+            return new MultiSampleEdge(isRef, multiplicity, numPruningSamples);
+        }
+
+    }
+
+    /**
+     * Class to keep track of the important dangling chain merging data
+     */
+    protected final class DanglingChainMergeHelper {
+        final List<MultiDeBruijnVertex> danglingPath, referencePath;
+        final byte[] danglingPathString, referencePathString;
+        final Cigar cigar;
+
+        public DanglingChainMergeHelper(final List<MultiDeBruijnVertex> danglingPath,
+                                        final List<MultiDeBruijnVertex> referencePath,
+                                        final byte[] danglingPathString,
+                                        final byte[] referencePathString,
+                                        final Cigar cigar) {
+            this.danglingPath = danglingPath;
+            this.referencePath = referencePath;
+            this.danglingPathString = danglingPathString;
+            this.referencePathString = referencePathString;
+            this.cigar = cigar;
+        }
+    }
+
+    /**
+     * Try to recover dangling tails
+     *
+     * @param pruneFactor  the prune factor to use in ignoring chain pieces
+     */
+    public void recoverDanglingTails(final int pruneFactor) {
+        if ( ! alreadyBuilt )  throw new IllegalStateException("recoverDanglingTails requires the graph be already built");
+
+        int attempted = 0;
+        int nRecovered = 0;
+        for ( final MultiDeBruijnVertex v : vertexSet() ) {
+            if ( outDegreeOf(v) == 0 && ! isRefSink(v) ) {
+                attempted++;
+                nRecovered += recoverDanglingTail(v, pruneFactor);
+            }
+        }
+
+        logger.debug("Recovered " + nRecovered + " of " + attempted + " dangling tails");
+    }
+
+    /**
+     * Try to recover dangling heads
+     *
+     * @param pruneFactor  the prune factor to use in ignoring chain pieces
+     */
+    public void recoverDanglingHeads(final int pruneFactor) {
+        if ( ! alreadyBuilt )  throw new IllegalStateException("recoverDanglingHeads requires the graph be already built");
+
+        // we need to build a list of dangling heads because that process can modify the graph (and otherwise generate
+        // a ConcurrentModificationException if we do it while iterating over the vertexes)
+        final List<MultiDeBruijnVertex> danglingHeads = new ArrayList<>();
+
+        int attempted = 0;
+        int nRecovered = 0;
+        for ( final MultiDeBruijnVertex v : vertexSet() ) {
+            if ( inDegreeOf(v) == 0 && ! isRefSource(v) )
+                danglingHeads.add(v);
+        }
+
+        // now we can try to recover the dangling heads
+        for ( final MultiDeBruijnVertex v : danglingHeads ) {
+            attempted++;
+            nRecovered += recoverDanglingHead(v, pruneFactor);
+        }
+
+        logger.debug("Recovered " + nRecovered + " of " + attempted + " dangling heads");
+    }
+
+    /**
+     * Attempt to attach vertex with out-degree == 0 to the graph
+     *
+     * @param vertex the vertex to recover
+     * @param pruneFactor  the prune factor to use in ignoring chain pieces
+     * @return 1 if we successfully recovered the vertex and 0 otherwise
+     */
+    protected int recoverDanglingTail(final MultiDeBruijnVertex vertex, final int pruneFactor) {
+        if ( outDegreeOf(vertex) != 0 ) throw new IllegalStateException("Attempting to recover a dangling tail for " + vertex + " but it has out-degree > 0");
+
+        // generate the CIGAR string from Smith-Waterman between the dangling tail and reference paths
+        final DanglingChainMergeHelper danglingTailMergeResult = generateCigarAgainstDownwardsReferencePath(vertex, pruneFactor);
+
+        // if the CIGAR is too complex (or couldn't be computed) then we do not allow the merge into the reference path
+        if ( danglingTailMergeResult == null || ! cigarIsOkayToMerge(danglingTailMergeResult.cigar, false, true) )
+            return 0;
+
+        // merge
+        return mergeDanglingTail(danglingTailMergeResult);
+    }
+
+    /**
+     * Attempt to attach vertex with in-degree == 0, or a vertex on its path, to the graph
+     *
+     * @param vertex the vertex to recover
+     * @param pruneFactor  the prune factor to use in ignoring chain pieces
+     * @return 1 if we successfully recovered a vertex and 0 otherwise
+     */
+    protected int recoverDanglingHead(final MultiDeBruijnVertex vertex, final int pruneFactor) {
+        if ( inDegreeOf(vertex) != 0 ) throw new IllegalStateException("Attempting to recover a dangling head for " + vertex + " but it has in-degree > 0");
+
+        // generate the CIGAR string from Smith-Waterman between the dangling tail and reference paths
+        final DanglingChainMergeHelper danglingHeadMergeResult = generateCigarAgainstUpwardsReferencePath(vertex, pruneFactor);
+
+        // if the CIGAR is too complex (or couldn't be computed) then we do not allow the merge into the reference path
+        if ( danglingHeadMergeResult == null || ! cigarIsOkayToMerge(danglingHeadMergeResult.cigar, true, false) )
+            return 0;
+
+        // merge
+        return mergeDanglingHead(danglingHeadMergeResult);
+    }
+
+    /**
+     * Determine whether the provided cigar is okay to merge into the reference path
+     *
+     * @param cigar    the cigar to analyze
+     * @param requireFirstElementM if true, require that the first cigar element be an M operator in order for it to be okay
+     * @param requireLastElementM  if true, require that the last cigar element be an M operator in order for it to be okay
+     * @return true if it's okay to merge, false otherwise
+     */
+    protected boolean cigarIsOkayToMerge(final Cigar cigar, final boolean requireFirstElementM, final boolean requireLastElementM) {
+
+        final List<CigarElement> elements = cigar.getCigarElements();
+        final int numElements = elements.size();
+
+        // don't allow more than a couple of different ops
+        if ( numElements == 0 || numElements > MAX_CIGAR_COMPLEXITY )
+            return false;
+
+        // the last element must be an M
+        if ( requireFirstElementM && elements.get(0).getOperator() != CigarOperator.M )
+            return false;
+
+        // the last element must be an M
+        if ( requireLastElementM && elements.get(numElements - 1).getOperator() != CigarOperator.M )
+            return false;
+
+        // TODO -- do we want to check whether the Ms mismatch too much also?
+
+        return true;
+    }
+
+    /**
+     * Actually merge the dangling tail if possible
+     *
+     * @param danglingTailMergeResult   the result from generating a Cigar for the dangling tail against the reference
+     * @return 1 if merge was successful, 0 otherwise
+     */
+    protected int mergeDanglingTail(final DanglingChainMergeHelper danglingTailMergeResult) {
+
+        final List<CigarElement> elements = danglingTailMergeResult.cigar.getCigarElements();
+        final CigarElement lastElement = elements.get(elements.size() - 1);
+        if ( lastElement.getOperator() != CigarOperator.M )
+            throw new IllegalArgumentException("The last Cigar element must be an M");
+
+        final int lastRefIndex = danglingTailMergeResult.cigar.getReferenceLength() - 1;
+        final int matchingSuffix = Math.min(GraphUtils.longestSuffixMatch(danglingTailMergeResult.referencePathString, danglingTailMergeResult.danglingPathString, lastRefIndex), lastElement.getLength());
+        if ( matchingSuffix == 0 )
+            return 0;
+
+        final int altIndexToMerge = Math.max(danglingTailMergeResult.cigar.getReadLength() - matchingSuffix - 1, 0);
+
+        // there is an important edge condition that we need to handle here: Smith-Waterman correctly calculates that there is a
+        // deletion, that deletion is left-aligned such that the LCA node is part of that deletion, and the rest of the dangling
+        // tail is a perfect match to the suffix of the reference path.  In this case we need to push the reference index to merge
+        // down one position so that we don't incorrectly cut a base off of the deletion.
+        final boolean firstElementIsDeletion = elements.get(0).getOperator() == CigarOperator.D;
+        final boolean mustHandleLeadingDeletionCase =  firstElementIsDeletion && (elements.get(0).getLength() + matchingSuffix == lastRefIndex + 1);
+        final int refIndexToMerge = lastRefIndex - matchingSuffix + 1 + (mustHandleLeadingDeletionCase ? 1 : 0);
+
+        addEdge(danglingTailMergeResult.danglingPath.get(altIndexToMerge), danglingTailMergeResult.referencePath.get(refIndexToMerge), ((MyEdgeFactory)getEdgeFactory()).createEdge(false, 1));
+
+        return 1;
+    }
+
+    /**
+     * Actually merge the dangling head if possible
+     *
+     * @param danglingHeadMergeResult   the result from generating a Cigar for the dangling head against the reference
+     * @return 1 if merge was successful, 0 otherwise
+     */
+    protected int mergeDanglingHead(final DanglingChainMergeHelper danglingHeadMergeResult) {
+
+        final List<CigarElement> elements = danglingHeadMergeResult.cigar.getCigarElements();
+        final CigarElement firstElement = elements.get(0);
+        if ( firstElement.getOperator() != CigarOperator.M )
+            throw new IllegalArgumentException("The first Cigar element must be an M");
+
+        final int indexesToMerge = bestPrefixMatch(danglingHeadMergeResult.referencePathString, danglingHeadMergeResult.danglingPathString, firstElement.getLength());
+        if ( indexesToMerge <= 0 )
+            return 0;
+
+        // we can't push back the reference path
+        if ( indexesToMerge >= danglingHeadMergeResult.referencePath.size() - 1 )
+            return 0;
+
+        // but we can manipulate the dangling path if we need to
+        if ( indexesToMerge >= danglingHeadMergeResult.danglingPath.size() &&
+                ! extendDanglingPathAgainstReference(danglingHeadMergeResult, indexesToMerge - danglingHeadMergeResult.danglingPath.size() + 2) )
+            return 0;
+
+        addEdge(danglingHeadMergeResult.referencePath.get(indexesToMerge+1), danglingHeadMergeResult.danglingPath.get(indexesToMerge), ((MyEdgeFactory)getEdgeFactory()).createEdge(false, 1));
+
+        return 1;
+    }
+
+    /**
+     * Generates the CIGAR string from the Smith-Waterman alignment of the dangling path (where the
+     * provided vertex is the sink) and the reference path.
+     *
+     * @param vertex   the sink of the dangling chain
+     * @param pruneFactor  the prune factor to use in ignoring chain pieces
+     * @return a SmithWaterman object which can be null if no proper alignment could be generated
+     */
+    protected DanglingChainMergeHelper generateCigarAgainstDownwardsReferencePath(final MultiDeBruijnVertex vertex, final int pruneFactor) {
+
+        // find the lowest common ancestor path between vertex and the reference sink if available
+        final List<MultiDeBruijnVertex> altPath = findPathUpwardsToLowestCommonAncestorOfReference(vertex, pruneFactor);
+        if ( altPath == null || isRefSource(altPath.get(0)) || altPath.size() < MIN_DANGLING_TAIL_LENGTH )
+            return null;
+
+        // now get the reference path from the LCA
+        final List<MultiDeBruijnVertex> refPath = getReferencePath(altPath.get(0), TraversalDirection.downwards);
+
+        // create the Smith-Waterman strings to use
+        final byte[] refBases = getBasesForPath(refPath, false);
+        final byte[] altBases = getBasesForPath(altPath, false);
+
+        // run Smith-Waterman to determine the best alignment (and remove trailing deletions since they aren't interesting)
+        final SmithWaterman alignment = new SWPairwiseAlignment(refBases, altBases, SWParameterSet.STANDARD_NGS, SWPairwiseAlignment.OVERHANG_STRATEGY.LEADING_INDEL);
+        return new DanglingChainMergeHelper(altPath, refPath, altBases, refBases, AlignmentUtils.removeTrailingDeletions(alignment.getCigar()));
+    }
+
+    /**
+     * Generates the CIGAR string from the Smith-Waterman alignment of the dangling path (where the
+     * provided vertex is the source) and the reference path.
+     *
+     * @param vertex   the source of the dangling head
+     * @param pruneFactor  the prune factor to use in ignoring chain pieces
+     * @return a SmithWaterman object which can be null if no proper alignment could be generated
+     */
+    protected DanglingChainMergeHelper generateCigarAgainstUpwardsReferencePath(final MultiDeBruijnVertex vertex, final int pruneFactor) {
+
+        // find the highest common descendant path between vertex and the reference source if available
+        final List<MultiDeBruijnVertex> altPath = findPathDownwardsToHighestCommonDescendantOfReference(vertex, pruneFactor);
+        if ( altPath == null || isRefSink(altPath.get(0)) )
+            return null;
+
+        // now get the reference path from the LCA
+        final List<MultiDeBruijnVertex> refPath = getReferencePath(altPath.get(0), TraversalDirection.upwards);
+
+        // create the Smith-Waterman strings to use
+        final byte[] refBases = getBasesForPath(refPath, true);
+        final byte[] altBases = getBasesForPath(altPath, true);
+
+        // run Smith-Waterman to determine the best alignment (and remove trailing deletions since they aren't interesting)
+        final SmithWaterman alignment = new SWPairwiseAlignment(refBases, altBases, SWParameterSet.STANDARD_NGS, SWPairwiseAlignment.OVERHANG_STRATEGY.LEADING_INDEL);
+        return new DanglingChainMergeHelper(altPath, refPath, altBases, refBases, AlignmentUtils.removeTrailingDeletions(alignment.getCigar()));
+    }
+
+    /**
+     * Finds the path upwards in the graph from this vertex to the reference sequence, including the lowest common ancestor vertex.
+     * Note that nodes are excluded if their pruning weight is less than the pruning factor.
+     *
+     * @param vertex   the original vertex
+     * @param pruneFactor  the prune factor to use in ignoring chain pieces
+     * @return the path if it can be determined or null if this vertex either doesn't merge onto the reference path or
+     *  has an ancestor with multiple incoming edges before hitting the reference path
+     */
+    protected List<MultiDeBruijnVertex> findPathUpwardsToLowestCommonAncestorOfReference(final MultiDeBruijnVertex vertex, final int pruneFactor) {
+        final LinkedList<MultiDeBruijnVertex> path = new LinkedList<>();
+
+        MultiDeBruijnVertex v = vertex;
+        while ( ! isReferenceNode(v) && inDegreeOf(v) == 1 ) {
+            final MultiSampleEdge edge = incomingEdgeOf(v);
+            // if it has too low a weight, don't use it (or previous vertexes) for the path
+            if ( edge.getPruningMultiplicity() < pruneFactor )
+                path.clear();
+            // otherwise it is safe to use
+            else
+                path.addFirst(v);
+            v = getEdgeSource(edge);
+        }
+        path.addFirst(v);
+
+        return isReferenceNode(v) ? path : null;
+    }
+
+    /**
+     * Finds the path downwards in the graph from this vertex to the reference sequence, including the highest common descendant vertex.
+     * However note that the path is reversed so that this vertex ends up at the end of the path.
+     * Also note that nodes are excluded if their pruning weight is less than the pruning factor.
+     *
+     * @param vertex   the original vertex
+     * @param pruneFactor  the prune factor to use in ignoring chain pieces
+     * @return the path if it can be determined or null if this vertex either doesn't merge onto the reference path or
+     *  has a descendant with multiple outgoing edges before hitting the reference path
+     */
+    protected List<MultiDeBruijnVertex> findPathDownwardsToHighestCommonDescendantOfReference(final MultiDeBruijnVertex vertex, final int pruneFactor) {
+        final LinkedList<MultiDeBruijnVertex> path = new LinkedList<>();
+
+        MultiDeBruijnVertex v = vertex;
+        while ( ! isReferenceNode(v) && outDegreeOf(v) == 1 ) {
+            final MultiSampleEdge edge = outgoingEdgeOf(v);
+            // if it has too low a weight, don't use it (or previous vertexes) for the path
+            if ( edge.getPruningMultiplicity() < pruneFactor )
+                path.clear();
+                // otherwise it is safe to use
+            else
+                path.addFirst(v);
+            v = getEdgeTarget(edge);
+        }
+        path.addFirst(v);
+
+        return isReferenceNode(v) ? path : null;
+    }
+
+    private enum TraversalDirection {
+        downwards,
+        upwards
+    }
+
+    /**
+     * Finds the path in the graph from this vertex to the reference sink, including this vertex
+     *
+     * @param start   the reference vertex to start from
+     * @param direction describes which direction to move in the graph (i.e. down to the reference sink or up to the source)
+     * @return the path (non-null, non-empty)
+     */
+    protected List<MultiDeBruijnVertex> getReferencePath(final MultiDeBruijnVertex start, final TraversalDirection direction) {
+        if ( ! isReferenceNode(start) ) throw new IllegalArgumentException("Cannot construct the reference path from a vertex that is not on that path");
+
+        final List<MultiDeBruijnVertex> path = new ArrayList<>();
+
+        MultiDeBruijnVertex v = start;
+        while ( v != null ) {
+            path.add(v);
+            v = (direction == TraversalDirection.downwards ? getNextReferenceVertex(v) : getPrevReferenceVertex(v));
+        }
+
+        return path;
+    }
+
+    /**
+     * The base sequence for the given path.
+     *
+     * @param path the list of vertexes that make up the path
+     * @param reverseIfSource if true and if we encounter a source node, then reverse the character sequence for that node
+     * @return  non-null sequence of bases corresponding to the given path
+     */
+    @Ensures({"result != null"})
+    public byte[] getBasesForPath(final List<MultiDeBruijnVertex> path, final boolean reverseIfSource) {
+        if ( path == null ) throw new IllegalArgumentException("Path cannot be null");
+
+        final StringBuilder sb = new StringBuilder();
+        for ( final MultiDeBruijnVertex v : path ) {
+            if ( isSource(v) ) {
+                final String seq = v.getSequenceString();
+                sb.append(reverseIfSource ? new StringBuilder(seq).reverse().toString() : seq);
+            } else {
+                sb.append((char)v.getSuffix());
+            }
+        }
+
+        return sb.toString().getBytes();
+    }
+
+    /**
+     * Finds the index of the best extent of the prefix match between the provided paths, for dangling head merging.
+     * Assumes that path1.length >= maxIndex and path2.length >= maxIndex.
+     *
+     * @param path1  the first path
+     * @param path2  the second path
+     * @param maxIndex the maximum index to traverse (not inclusive)
+     * @return the index of the ideal prefix match or -1 if it cannot find one, must be less than maxIndex
+     */
+    protected static int bestPrefixMatch(final byte[] path1, final byte[] path2, final int maxIndex) {
+        int mismatches = 0;
+        int index = 0;
+        int lastGoodIndex = -1;
+        while ( index < maxIndex ) {
+            if ( path1[index] != path2[index] ) {
+                if ( ++mismatches > MAXIMUM_MISMATCHES_IN_DANGLING_HEAD_MERGE )
+                    return lastGoodIndex;
+                lastGoodIndex = index;
+            }
+            index++;
+        }
+        // if we got here then we hit the max index
+        return lastGoodIndex;
+    }
+
+    protected boolean extendDanglingPathAgainstReference(final DanglingChainMergeHelper danglingHeadMergeResult, final int numNodesToExtend) {
+
+        final int indexOfLastDanglingNode = danglingHeadMergeResult.danglingPath.size() - 1;
+        final int indexOfRefNodeToUse = indexOfLastDanglingNode + numNodesToExtend;
+        if ( indexOfRefNodeToUse >= danglingHeadMergeResult.referencePath.size() )
+            return false;
+
+        final MultiDeBruijnVertex danglingSource = danglingHeadMergeResult.danglingPath.remove(indexOfLastDanglingNode);
+        final StringBuilder sb = new StringBuilder();
+        final byte[] refSourceSequence = danglingHeadMergeResult.referencePath.get(indexOfRefNodeToUse).getSequence();
+        for ( int i = 0; i < numNodesToExtend; i++ )
+            sb.append((char)refSourceSequence[i]);
+        sb.append(danglingSource.getSequenceString());
+        final byte[] sequenceToExtend = sb.toString().getBytes();
+
+        // clean up the source and edge
+        final MultiSampleEdge sourceEdge = outgoingEdgeOf(danglingSource);
+        MultiDeBruijnVertex prevV = getEdgeTarget(sourceEdge);
+        removeEdge(danglingSource, prevV);
+
+        // extend the path
+        for ( int i = numNodesToExtend; i > 0; i-- ) {
+            final MultiDeBruijnVertex newV = new MultiDeBruijnVertex(Arrays.copyOfRange(sequenceToExtend, i, i+kmerSize));
+            addVertex(newV);
+            final MultiSampleEdge newE = addEdge(newV, prevV);
+            newE.setMultiplicity(sourceEdge.getMultiplicity());
+            danglingHeadMergeResult.danglingPath.add(newV);
+            prevV = newV;
+        }
+
+        return true;
+    }
+}
\ No newline at end of file
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/HaplotypeGraph.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/HaplotypeGraph.java
index 6574e8295..150cdc826 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/HaplotypeGraph.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/HaplotypeGraph.java
@@ -391,10 +391,9 @@ public class HaplotypeGraph extends ReadThreadingGraph {
             graphWriter.println("}");
     }
 
-
     @Override
-    public Pair<MultiDeBruijnVertex,Integer> findStart(final SequenceForKmers seqForKmers) {
-        return getOrCreateKmerVertex(seqForKmers.sequence, 0, true);
+    protected int findStart(final SequenceForKmers seqForKmers) {
+        return 0;
     }
 
     /**
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssembler.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssembler.java
index e158ef613..a932f8a96 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssembler.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssembler.java
@@ -186,9 +186,10 @@ public class ReadThreadingAssembler extends LocalAssemblyEngine {
         // tails that we'll ultimately just trim away anyway, as the dangling tail edges have weight of 1
         rtgraph.pruneLowWeightChains(pruneFactor);
 
-        // look at all chains in the graph that terminate in a non-ref node (dangling sinks) and see if
+        // look at all chains in the graph that terminate in a non-ref node (dangling sources and sinks) and see if
         // we can recover them by merging some N bases from the chain back into the reference
         if ( recoverDanglingTails ) rtgraph.recoverDanglingTails(pruneFactor);
+        if ( recoverDanglingHeads ) rtgraph.recoverDanglingHeads(pruneFactor);
 
         // remove all heading and trailing paths
         if ( removePathsNotConnectedToRef ) rtgraph.removePathsNotConnectedToRef();
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraph.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraph.java
index 7fdfa4301..a7989ac2c 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraph.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraph.java
@@ -46,21 +46,12 @@
 
 package org.broadinstitute.sting.gatk.walkers.haplotypecaller.readthreading;
 
-import net.sf.samtools.Cigar;
-import net.sf.samtools.CigarElement;
-import net.sf.samtools.CigarOperator;
 import org.apache.log4j.Logger;
 import org.broadinstitute.sting.gatk.walkers.haplotypecaller.KMerCounter;
 import org.broadinstitute.sting.gatk.walkers.haplotypecaller.Kmer;
 import org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs.*;
 import org.broadinstitute.sting.utils.BaseUtils;
-import org.broadinstitute.sting.utils.collections.Pair;
-import org.broadinstitute.sting.utils.sam.AlignmentUtils;
 import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
-import org.broadinstitute.sting.utils.smithwaterman.SWPairwiseAlignment;
-import org.broadinstitute.sting.utils.smithwaterman.SWParameterSet;
-import org.broadinstitute.sting.utils.smithwaterman.SmithWaterman;
-import org.jgrapht.EdgeFactory;
 import org.jgrapht.alg.CycleDetector;
 
 import java.io.File;
@@ -68,28 +59,7 @@ import java.util.*;
 import java.util.regex.Matcher;
 import java.util.regex.Pattern;
 
-public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSampleEdge> implements KmerSearchableGraph<MultiDeBruijnVertex,MultiSampleEdge> {
-
-    /**
-     * Edge factory that encapsulates the numPruningSamples assembly parameter
-     */
-    private static class MyEdgeFactory implements EdgeFactory<MultiDeBruijnVertex, MultiSampleEdge> {
-        final int numPruningSamples;
-
-        public MyEdgeFactory(int numPruningSamples) {
-            this.numPruningSamples = numPruningSamples;
-        }
-
-        @Override
-        public MultiSampleEdge createEdge(final MultiDeBruijnVertex sourceVertex, final MultiDeBruijnVertex targetVertex) {
-            return new MultiSampleEdge(false, 1, numPruningSamples);
-        }
-
-        public MultiSampleEdge createEdge(final boolean isRef, final int multiplicity) {
-            return new MultiSampleEdge(isRef, multiplicity, numPruningSamples);
-        }
-
-    }
+public class ReadThreadingGraph extends DanglingChainMergingGraph implements KmerSearchableGraph<MultiDeBruijnVertex,MultiSampleEdge> {
 
     private final static Logger logger = Logger.getLogger(ReadThreadingGraph.class);
 
@@ -97,9 +67,6 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
     private final static boolean WRITE_GRAPH = false;
     private final static boolean DEBUG_NON_UNIQUE_CALC = false;
 
-    private final static int MAX_CIGAR_COMPLEXITY = 3;
-    private final static int MIN_DANGLING_TAIL_LENGTH = 5;  // SNP + 3 stabilizing nodes + the LCA
-
     /** for debugging info printing */
     private static int counter = 0;
 
@@ -132,13 +99,12 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
     // state variables, initialized in resetToInitialState()
     // --------------------------------------------------------------------------------
     private Kmer refSource;
-    protected boolean alreadyBuilt;
 
     /**
      * Constructs an empty read-threading-grpah provided the kmerSize.
      * @param kmerSize 1 or greater.
      *
-     * @throw IllegalArgumentException if (@code kmerSize) < 1.
+     * @throws IllegalArgumentException if (@code kmerSize) < 1.
      */
     public ReadThreadingGraph(final int kmerSize) {
         this(kmerSize, false, (byte)6, 1);
@@ -250,12 +216,11 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
      * @param seqForKmers a non-null sequence
      */
     private void threadSequence(final SequenceForKmers seqForKmers) {
-        final Pair<MultiDeBruijnVertex,Integer> startingInfo = findStart(seqForKmers);
-        if ( startingInfo == null )
+        final int uniqueStartPos = findStart(seqForKmers);
+        if ( uniqueStartPos == -1 )
             return;
 
-        final MultiDeBruijnVertex startingVertex = startingInfo.getFirst();
-        final int uniqueStartPos = startingInfo.getSecond();
+        final MultiDeBruijnVertex startingVertex = getOrCreateKmerVertex(seqForKmers.sequence, uniqueStartPos);
 
         // increase the counts of all edges incoming into the starting vertex supported by going back in sequence
         if ( increaseCountsBackwards )
@@ -278,177 +243,22 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
     }
 
     /**
-     * Class to keep track of the important dangling tail merging data
-     */
-    protected final class DanglingTailMergeResult {
-        final List<MultiDeBruijnVertex> danglingPath, referencePath;
-        final byte[] danglingPathString, referencePathString;
-        final Cigar cigar;
-
-        public DanglingTailMergeResult(final List<MultiDeBruijnVertex> danglingPath,
-                                       final List<MultiDeBruijnVertex> referencePath,
-                                       final byte[] danglingPathString,
-                                       final byte[] referencePathString,
-                                       final Cigar cigar) {
-            this.danglingPath = danglingPath;
-            this.referencePath = referencePath;
-            this.danglingPathString = danglingPathString;
-            this.referencePathString = referencePathString;
-            this.cigar = cigar;
-        }
-    }
-
-    /**
-     * Attempt to attach vertex with out-degree == 0 to the graph
+     * Find vertex and its position in seqForKmers where we should start assembling seqForKmers
      *
-     * @param vertex the vertex to recover
-     * @param pruneFactor  the prune factor to use in ignoring chain pieces
-     * @return 1 if we successfully recovered the vertex and 0 otherwise
+     * @param seqForKmers the sequence we want to thread into the graph
+     * @return the position of the starting vertex in seqForKmer, or -1 if it cannot find one
      */
-    protected int recoverDanglingChain(final MultiDeBruijnVertex vertex, final int pruneFactor) {
-        if ( outDegreeOf(vertex) != 0 ) throw new IllegalStateException("Attempting to recover a dangling tail for " + vertex + " but it has out-degree > 0");
-
-        // generate the CIGAR string from Smith-Waterman between the dangling tail and reference paths
-        final DanglingTailMergeResult danglingTailMergeResult = generateCigarAgainstReferencePath(vertex, pruneFactor);
-
-        // if the CIGAR is too complex (or couldn't be computed) then we do not allow the merge into the reference path
-        if ( danglingTailMergeResult == null || ! cigarIsOkayToMerge(danglingTailMergeResult.cigar) )
+    protected int findStart(final SequenceForKmers seqForKmers) {
+        if ( seqForKmers.isRef )
             return 0;
 
-        // merge
-        return mergeDanglingTail(danglingTailMergeResult);
-    }
-
-    /**
-     * Determine whether the provided cigar is okay to merge into the reference path
-     *
-     * @param cigar    the cigar to analyze
-     * @return true if it's okay to merge, false otherwise
-     */
-    protected boolean cigarIsOkayToMerge(final Cigar cigar) {
-
-        final List<CigarElement> elements = cigar.getCigarElements();
-        final int numElements = elements.size();
-
-        // don't allow more than a couple of different ops
-        if ( numElements > MAX_CIGAR_COMPLEXITY )
-            return false;
-
-        // the last element must be an M
-        if ( elements.get(numElements - 1).getOperator() != CigarOperator.M )
-            return false;
-
-        // TODO -- do we want to check whether the Ms mismatch too much also?
-
-        return true;
-    }
-
-    /**
-     * Actually merge the dangling tail if possible
-     *
-     * @param danglingTailMergeResult   the result from generating a Cigar for the dangling tail against the reference
-     * @return 1 if merge was successful, 0 otherwise
-     */
-    protected int mergeDanglingTail(final DanglingTailMergeResult danglingTailMergeResult) {
-
-        final List<CigarElement> elements = danglingTailMergeResult.cigar.getCigarElements();
-        final CigarElement lastElement = elements.get(elements.size() - 1);
-        if ( lastElement.getOperator() != CigarOperator.M )
-            throw new IllegalArgumentException("The last Cigar element must be an M");
-
-        final int lastRefIndex = danglingTailMergeResult.cigar.getReferenceLength() - 1;
-        final int matchingSuffix = Math.min(GraphUtils.longestSuffixMatch(danglingTailMergeResult.referencePathString, danglingTailMergeResult.danglingPathString, lastRefIndex), lastElement.getLength());
-        if ( matchingSuffix == 0 )
-            return 0;
-
-        final int altIndexToMerge = Math.max(danglingTailMergeResult.cigar.getReadLength() - matchingSuffix - 1, 0);
-
-        // there is an important edge condition that we need to handle here: Smith-Waterman correctly calculates that there is a
-        // deletion, that deletion is left-aligned such that the LCA node is part of that deletion, and the rest of the dangling
-        // tail is a perfect match to the suffix of the reference path.  In this case we need to push the reference index to merge
-        // down one position so that we don't incorrectly cut a base off of the deletion.
-        final boolean firstElementIsDeletion = elements.get(0).getOperator() == CigarOperator.D;
-        final boolean mustHandleLeadingDeletionCase =  firstElementIsDeletion && (elements.get(0).getLength() + matchingSuffix == lastRefIndex + 1);
-        final int refIndexToMerge = lastRefIndex - matchingSuffix + 1 + (mustHandleLeadingDeletionCase ? 1 : 0);
-
-        addEdge(danglingTailMergeResult.danglingPath.get(altIndexToMerge), danglingTailMergeResult.referencePath.get(refIndexToMerge), ((MyEdgeFactory)getEdgeFactory()).createEdge(false, 1));
-
-        return 1;
-    }
-
-    /**
-     * Generates the CIGAR string from the Smith-Waterman alignment of the dangling path (where the
-     * provided vertex is the sink) and the reference path.
-     *
-     * @param vertex   the sink of the dangling tail
-     * @param pruneFactor  the prune factor to use in ignoring chain pieces
-     * @return a SmithWaterman object which can be null if no proper alignment could be generated
-     */
-    protected DanglingTailMergeResult generateCigarAgainstReferencePath(final MultiDeBruijnVertex vertex, final int pruneFactor) {
-
-        // find the lowest common ancestor path between vertex and the reference sink if available
-        final List<MultiDeBruijnVertex> altPath = findPathToLowestCommonAncestorOfReference(vertex, pruneFactor);
-        if ( altPath == null || isRefSource(altPath.get(0)) || altPath.size() < MIN_DANGLING_TAIL_LENGTH )
-            return null;
-
-        // now get the reference path from the LCA
-        final List<MultiDeBruijnVertex> refPath = getReferencePath(altPath.get(0));
-
-        // create the Smith-Waterman strings to use
-        final byte[] refBases = getBasesForPath(refPath);
-        final byte[] altBases = getBasesForPath(altPath);
-
-        // run Smith-Waterman to determine the best alignment (and remove trailing deletions since they aren't interesting)
-        final SmithWaterman alignment = new SWPairwiseAlignment(refBases, altBases, SWParameterSet.STANDARD_NGS, SWPairwiseAlignment.OVERHANG_STRATEGY.LEADING_INDEL);
-        return new DanglingTailMergeResult(altPath, refPath, altBases, refBases, AlignmentUtils.removeTrailingDeletions(alignment.getCigar()));
-    }
-
-    /**
-     * Finds the path upwards in the graph from this vertex to the reference sequence, including the lowest common ancestor vertex.
-     * Note that nodes are excluded if their pruning weight is less than the pruning factor.
-     *
-     * @param vertex   the original vertex
-     * @param pruneFactor  the prune factor to use in ignoring chain pieces
-     * @return the path if it can be determined or null if this vertex either doesn't merge onto the reference path or
-     *  has an ancestor with multiple incoming edges before hitting the reference path
-     */
-    protected List<MultiDeBruijnVertex> findPathToLowestCommonAncestorOfReference(final MultiDeBruijnVertex vertex, final int pruneFactor) {
-        final LinkedList<MultiDeBruijnVertex> path = new LinkedList<>();
-
-        MultiDeBruijnVertex v = vertex;
-        while ( ! isReferenceNode(v) && inDegreeOf(v) == 1 ) {
-            final MultiSampleEdge edge = incomingEdgeOf(v);
-            // if it has too low a weight, don't use it (or previous vertexes) for the path
-            if ( edge.getPruningMultiplicity() < pruneFactor )
-                path.clear();
-            // otherwise it is safe to use
-            else
-                path.addFirst(v);
-            v = getEdgeSource(edge);
-        }
-        path.addFirst(v);
-
-        return isReferenceNode(v) ? path : null;
-    }
-
-    /**
-     * Finds the path downwards in the graph from this vertex to the reference sink, including this vertex
-     *
-     * @param start   the reference vertex to start from
-     * @return the path (non-null, non-empty)
-     */
-    protected List<MultiDeBruijnVertex> getReferencePath(final MultiDeBruijnVertex start) {
-        if ( ! isReferenceNode(start) ) throw new IllegalArgumentException("Cannot construct the reference path from a vertex that is not on that path");
-
-        final List<MultiDeBruijnVertex> path = new ArrayList<>();
-
-        MultiDeBruijnVertex v = start;
-        while ( v != null ) {
-            path.add(v);
-            v = getNextReferenceVertex(v);
+        for ( int i = seqForKmers.start; i < seqForKmers.stop - kmerSize; i++ ) {
+            final Kmer kmer1 = new Kmer(seqForKmers.sequence, i, kmerSize);
+            if ( !nonUniqueKmers.contains(kmer1) )
+                return i;
         }
 
-        return path;
+        return -1;
     }
 
     /**
@@ -526,26 +336,6 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
         return nonUniqueKmers.size() * 4 > uniqueKmers.size();
     }
 
-    /**
-     * Try to recover dangling tails
-     *
-     * @param pruneFactor  the prune factor to use in ignoring chain pieces
-     */
-    public void recoverDanglingTails(final int pruneFactor) {
-        if ( ! alreadyBuilt )  throw new IllegalStateException("recoverDanglingTails requires the graph be already built");
-
-        int attempted = 0;
-        int nRecovered = 0;
-        for ( final MultiDeBruijnVertex v : vertexSet() ) {
-            if ( outDegreeOf(v) == 0 && ! isRefSink(v) ) {
-                attempted++;
-                nRecovered += recoverDanglingChain(v, pruneFactor);
-            }
-        }
-
-        if ( debugGraphTransformations ) logger.info("Recovered " + nRecovered + " of " + attempted + " dangling tails");
-    }
-
     /** structure that keeps track of the non-unique kmers for a given kmer size */
     private static class NonUniqueResult {
         final Set<Kmer> nonUniques;
@@ -568,7 +358,7 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
      */
     protected NonUniqueResult determineKmerSizeAndNonUniques(final int minKmerSize, final int maxKmerSize) {
         final Collection<SequenceForKmers> withNonUniques = getAllPendingSequences();
-        final Set<Kmer> nonUniqueKmers = new HashSet<Kmer>();
+        final Set<Kmer> nonUniqueKmers = new HashSet<>();
 
         // go through the sequences and determine which kmers aren't unique within each read
         int kmerSize = minKmerSize;
@@ -606,7 +396,7 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
      * @return non-null Collection
      */
     private Collection<SequenceForKmers> getAllPendingSequences() {
-        final LinkedList<SequenceForKmers> result = new LinkedList<SequenceForKmers>();
+        final LinkedList<SequenceForKmers> result = new LinkedList<>();
         for ( final List<SequenceForKmers> oneSampleWorth : pending.values() ) result.addAll(oneSampleWorth);
         return result;
     }
@@ -642,7 +432,7 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
         buildGraphIfNecessary();
 
         final SeqGraph seqGraph = new SeqGraph(kmerSize);
-        final Map<MultiDeBruijnVertex, SeqVertex> vertexMap = new HashMap<MultiDeBruijnVertex, SeqVertex>();
+        final Map<MultiDeBruijnVertex, SeqVertex> vertexMap = new HashMap<>();
 
 
         // create all of the equivalent seq graph vertices
@@ -683,52 +473,16 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
         }
     }
 
-    /**
-     * Find vertex and its position in seqForKmers where we should start assembling seqForKmers
-     *
-     * @param seqForKmers the sequence we want to thread into the graph
-     * @return a pair of the starting vertex and its position in seqForKmer
-     */
-    protected Pair<MultiDeBruijnVertex, Integer> findStart(final SequenceForKmers seqForKmers) {
-        final int uniqueStartPos = seqForKmers.isRef ? 0 : findUniqueStartPosition(seqForKmers.sequence, seqForKmers.start, seqForKmers.stop);
-
-        if ( uniqueStartPos == -1 )
-            return null;
-
-        return getOrCreateKmerVertex(seqForKmers.sequence, uniqueStartPos, true);
-    }
-
-    /**
-     * Find a starting point in sequence that begins a unique kmer among all kmers in the graph
-     * @param sequence the sequence of bases
-     * @param start the first base to use in sequence
-     * @param stop the last base to use in sequence
-     * @return the index into sequence that begins a unique kmer of size kmerSize, or -1 if none could be found
-     */
-    private int findUniqueStartPosition(final byte[] sequence, final int start, final int stop) {
-        for ( int i = start; i < stop - kmerSize; i++ ) {
-            final Kmer kmer1 = new Kmer(sequence, i, kmerSize);
-            if ( uniqueKmers.containsKey(kmer1) )
-                return i;
-        }
-        return -1;
-    }
-
     /**
      * Get the vertex for the kmer in sequence starting at start
      * @param sequence the sequence
      * @param start the position of the kmer start
-     * @param allowRefSource if true, we will allow matches to the kmer that represents the reference starting kmer
      * @return a non-null vertex
      */
-    protected Pair<MultiDeBruijnVertex, Integer> getOrCreateKmerVertex(final byte[] sequence, final int start, final boolean allowRefSource) {
+    private MultiDeBruijnVertex getOrCreateKmerVertex(final byte[] sequence, final int start) {
         final Kmer kmer = new Kmer(sequence, start, kmerSize);
-        final MultiDeBruijnVertex vertex = getUniqueKmerVertex(kmer, allowRefSource);
-        if ( vertex != null ) {
-            return new Pair<>(vertex, start);
-        } else {
-            return new Pair<>(createVertex(kmer), start);
-        }
+        final MultiDeBruijnVertex vertex = getUniqueKmerVertex(kmer, true);
+        return ( vertex != null ) ? vertex : createVertex(kmer);
     }
 
     /**
@@ -878,11 +632,11 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
 
 
     /**
-     * Constructs a read-threadingg-graph for a string representation.
+     * Constructs a read-threading-graph for a string representation.
      *
      * <p>
      *     Note: only used for testing.
-     *     Checkout {@link HaplotypeGraphUnitTest} for examples.
+     *     Checkout {@see HaplotypeGraphUnitTest} for examples.
      * </p>
      * @param s the string representation of the graph {@code null}.
      */
@@ -913,7 +667,7 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
      *
      * <p>
      *     Note: this is done just for testing purposes.
-     *     Checkout {@link HaplotypeGraphUnitTest} for examples.
+     *     Checkout {@see HaplotypeGraphUnitTest} for examples.
      * </p>
      * @param str the string representation.
      */
@@ -934,9 +688,9 @@ public class ReadThreadingGraph extends BaseGraph<MultiDeBruijnVertex, MultiSamp
             if (referenceFound) {
                 if (isReference)
                     throw new IllegalArgumentException("there are two reference paths");
-
-            } else
-                referenceFound |= isReference;
+            } else if ( isReference ) {
+                referenceFound = true;
+            }
 
             // Divide each path into its elements getting a list of sequences and labels if applies:
             final String elementsString = pathMatcher.group(3);
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/annotator/VariantAnnotatorIntegrationTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/annotator/VariantAnnotatorIntegrationTest.java
index 287cd45d0..0ed7eb2e8 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/annotator/VariantAnnotatorIntegrationTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/annotator/VariantAnnotatorIntegrationTest.java
@@ -358,7 +358,7 @@ public class VariantAnnotatorIntegrationTest extends WalkerTest {
         final File outputVCFNoQD = executeTest("testQualByDepth calling without QD", specNoQD).getFirst().get(0);
 
         final String baseAnn = String.format("-T VariantAnnotator -R %s -V %s", REF, outputVCFNoQD.getAbsolutePath()) + " --no_cmdline_in_header -o %s -L 20:10130000-10134800 -A QualByDepth";
-        final WalkerTestSpec specAnn = new WalkerTestSpec(baseAnn, 1, Arrays.asList("4ccdbebcfd02be87ae5b4ad94666f011"));
+        final WalkerTestSpec specAnn = new WalkerTestSpec(baseAnn, 1, Arrays.asList("388200d107fb47326df78a971a52698f"));
         specAnn.disableShadowBCF();
         final File outputVCFAnn = executeTest("testQualByDepth re-annotation of QD", specAnn).getFirst().get(0);
 
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCallerComplexAndSymbolicVariantsIntegrationTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCallerComplexAndSymbolicVariantsIntegrationTest.java
index f547e12cc..2838648d5 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCallerComplexAndSymbolicVariantsIntegrationTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCallerComplexAndSymbolicVariantsIntegrationTest.java
@@ -64,7 +64,7 @@ public class HaplotypeCallerComplexAndSymbolicVariantsIntegrationTest extends Wa
 
     @Test
     public void testHaplotypeCallerMultiSampleComplex1() {
-        HCTestComplexVariants(privateTestDir + "AFR.complex.variants.bam", "", "65c316f1f3987d7bc94e887999920d45");
+        HCTestComplexVariants(privateTestDir + "AFR.complex.variants.bam", "", "7278afd47e5851c954359441cac2f0b8");
     }
 
     private void HCTestSymbolicVariants(String bam, String args, String md5) {
@@ -88,7 +88,7 @@ public class HaplotypeCallerComplexAndSymbolicVariantsIntegrationTest extends Wa
     @Test
     public void testHaplotypeCallerMultiSampleGGAComplex() {
         HCTestComplexGGA(NA12878_CHR20_BAM, "-L 20:119673-119823 -L 20:121408-121538",
-                "724a05b7df716647014f29c0fe86e071");
+                "cbdd34c454d69b266e3681ddfc33c7a3");
     }
 
     @Test
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCallerIntegrationTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCallerIntegrationTest.java
index c95a3a839..386fc3800 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCallerIntegrationTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCallerIntegrationTest.java
@@ -89,7 +89,7 @@ public class HaplotypeCallerIntegrationTest extends WalkerTest {
 
     @Test
     public void testHaplotypeCallerSingleSample() {
-        HCTest(NA12878_BAM, "", "96f299a5cf411900b8eda3845c3ce465");
+        HCTest(NA12878_BAM, "", "c208ef58d464465c68b5c26501122ad7");
     }
 
     @Test
@@ -99,7 +99,7 @@ public class HaplotypeCallerIntegrationTest extends WalkerTest {
 
     @Test
     public void testHaplotypeCallerGraphBasedSingleSample() {
-        HCTest(NA12878_BAM, "-likelihoodEngine GraphBased", "83fe0694621bc1e0240f6f79eb6d6999");
+        HCTest(NA12878_BAM, "-likelihoodEngine GraphBased", "049ba1794a1ce2b15566bb1e9431fccf");
     }
 
     @Test
@@ -227,7 +227,7 @@ public class HaplotypeCallerIntegrationTest extends WalkerTest {
     public void HCTestDBSNPAnnotationWGS() {
         WalkerTest.WalkerTestSpec spec = new WalkerTest.WalkerTestSpec(
                 "-T HaplotypeCaller --disableDithering --pcr_indel_model NONE -R " + b37KGReference + " --no_cmdline_in_header -I " + NA12878_PCRFREE + " -o %s -L 20:10,000,000-10,100,000 -D " + b37dbSNP132, 1,
-                Arrays.asList("0864904254b2fa757991f8c2dac4932d"));
+                Arrays.asList("0998be22d7af4372247f5a0338f9446b"));
         executeTest("HC calling with dbSNP ID annotation on WGS intervals", spec);
     }
 
@@ -244,7 +244,7 @@ public class HaplotypeCallerIntegrationTest extends WalkerTest {
     public void HCTestDBSNPAnnotationWGSGraphBased() {
         WalkerTest.WalkerTestSpec spec = new WalkerTest.WalkerTestSpec(
                 "-T HaplotypeCaller -likelihoodEngine GraphBased --disableDithering --pcr_indel_model NONE -R " + b37KGReference + " --no_cmdline_in_header -I " + NA12878_PCRFREE + " -o %s -L 20:10,000,000-10,100,000 -D " + b37dbSNP132, 1,
-                Arrays.asList("df1f9410d23a550a143531ac0891f1dc"));
+                Arrays.asList("1aeed297a3cb41940d83eac499a2ce07"));
         executeTest("HC calling with dbSNP ID annotation on WGS intervals", spec);
     }
 
@@ -284,7 +284,7 @@ public class HaplotypeCallerIntegrationTest extends WalkerTest {
     public void HCTestConservativePcrIndelModelWGS() {
         WalkerTest.WalkerTestSpec spec = new WalkerTest.WalkerTestSpec(
                 "-T HaplotypeCaller --disableDithering --pcr_indel_model CONSERVATIVE -R " + b37KGReference + " --no_cmdline_in_header -I " + NA12878_BAM + " -o %s -L 20:10,000,000-10,300,000", 1,
-                Arrays.asList("616cc63d5a78765145914457dec475b0"));
+                Arrays.asList("dcb38cb9280f2c3059a09d323db1c633"));
         executeTest("HC calling with conservative indel error modeling on WGS intervals", spec);
     }
 
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/BaseGraphUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/BaseGraphUnitTest.java
index 5e91ad4f7..44512824a 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/BaseGraphUnitTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/BaseGraphUnitTest.java
@@ -292,19 +292,4 @@ public class BaseGraphUnitTest extends BaseTest {
         final Set<SeqVertex> expectedSet = expected == null ? Collections.<SeqVertex>emptySet() : new HashSet<SeqVertex>(Arrays.asList(expected));
         Assert.assertEquals(actualSet, expectedSet);
     }
-
-    @Test(enabled = true)
-    public void testGetBases() {
-
-        final int kmerSize = 4;
-        final String testString = "AATGGGGGCAATACTA";
-
-        final List<DeBruijnVertex> vertexes = new ArrayList<>();
-        for ( int i = 0; i <= testString.length() - kmerSize; i++ ) {
-            vertexes.add(new DeBruijnVertex(testString.substring(i, i + kmerSize)));
-        }
-
-        final String result = new String(new TestGraph().getBasesForPath(vertexes));
-        Assert.assertEquals(result, testString.substring(kmerSize - 1));
-    }
 }
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraphUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraphUnitTest.java
new file mode 100644
index 000000000..f45dbd093
--- /dev/null
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraphUnitTest.java
@@ -0,0 +1,230 @@
+/*
+*  By downloading the PROGRAM you agree to the following terms of use:
+*  
+*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
+*  
+*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
+*  
+*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
+*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
+*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
+*  
+*  1. DEFINITIONS
+*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
+*  
+*  2. LICENSE
+*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
+*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
+*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
+*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
+*  
+*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
+*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
+*  Copyright 2012 Broad Institute, Inc.
+*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
+*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
+*  
+*  4. INDEMNIFICATION
+*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
+*  
+*  5. NO REPRESENTATIONS OR WARRANTIES
+*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
+*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
+*  
+*  6. ASSIGNMENT
+*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
+*  
+*  7. MISCELLANEOUS
+*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
+*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
+*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
+*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
+*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
+*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
+*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
+*/
+
+package org.broadinstitute.sting.gatk.walkers.haplotypecaller.readthreading;
+
+import org.broadinstitute.sting.BaseTest;
+import org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs.*;
+import org.broadinstitute.sting.utils.Utils;
+import org.broadinstitute.sting.utils.sam.ArtificialSAMUtils;
+import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
+import org.testng.Assert;
+import org.testng.annotations.DataProvider;
+import org.testng.annotations.Test;
+
+import java.util.*;
+
+public class DanglingChainMergingGraphUnitTest extends BaseTest {
+
+    public static byte[] getBytes(final String alignment) {
+        return alignment.replace("-","").getBytes();
+    }
+
+    @DataProvider(name = "DanglingTails")
+    public Object[][] makeDanglingTailsData() {
+        List<Object[]> tests = new ArrayList<>();
+
+        // add 1M to the expected CIGAR because it includes the previous (common) base too
+        tests.add(new Object[]{"AAAAAAAAAA", "CAAA", "5M", true, 3});                  // incomplete haplotype
+        tests.add(new Object[]{"AAAAAAAAAA", "CAAAAAAAAAA", "1M1I10M", true, 10});     // insertion
+        tests.add(new Object[]{"CCAAAAAAAAAA", "AAAAAAAAAA", "1M2D10M", true, 10});    // deletion
+        tests.add(new Object[]{"AAAAAAAA", "CAAAAAAA", "9M", true, 7});                // 1 snp
+        tests.add(new Object[]{"AAAAAAAA", "CAAGATAA", "9M", true, 2});                // several snps
+        tests.add(new Object[]{"AAAAA", "C", "1M4D1M", false, -1});                    // funky SW alignment
+        tests.add(new Object[]{"AAAAA", "CA", "1M3D2M", false, 1});                    // very little data
+        tests.add(new Object[]{"AAAAAAA", "CAAAAAC", "8M", true, -1});                 // ends in mismatch
+        tests.add(new Object[]{"AAAAAA", "CGAAAACGAA", "1M2I4M2I2M", false, 0});       // alignment is too complex
+
+        return tests.toArray(new Object[][]{});
+    }
+
+    @Test(dataProvider = "DanglingTails")
+    public void testDanglingTails(final String refEnd,
+                                  final String altEnd,
+                                  final String cigar,
+                                  final boolean cigarIsGood,
+                                  final int mergePointDistanceFromSink) {
+
+        final int kmerSize = 15;
+
+        // construct the haplotypes
+        final String commonPrefix = "AAAAAAAAAACCCCCCCCCCGGGGGGGGGGTTTTTTTTTT";
+        final String ref = commonPrefix + refEnd;
+        final String alt = commonPrefix + altEnd;
+
+        // create the graph and populate it
+        final ReadThreadingGraph rtgraph = new ReadThreadingGraph(kmerSize);
+        rtgraph.addSequence("ref", ref.getBytes(), true);
+        final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(alt.getBytes(), Utils.dupBytes((byte) 30, alt.length()), alt.length() + "M");
+        rtgraph.addRead(read);
+        rtgraph.buildGraphIfNecessary();
+
+        // confirm that we have just a single dangling tail
+        MultiDeBruijnVertex altSink = null;
+        for ( final MultiDeBruijnVertex v : rtgraph.vertexSet() ) {
+            if ( rtgraph.isSink(v) && !rtgraph.isReferenceNode(v) ) {
+                Assert.assertTrue(altSink == null, "We found more than one non-reference sink");
+                altSink = v;
+            }
+        }
+
+        Assert.assertTrue(altSink != null, "We did not find a non-reference sink");
+
+        // confirm that the SW alignment agrees with our expectations
+        final ReadThreadingGraph.DanglingChainMergeHelper result = rtgraph.generateCigarAgainstDownwardsReferencePath(altSink, 0);
+
+        if ( result == null ) {
+            Assert.assertFalse(cigarIsGood);
+            return;
+        }
+
+        Assert.assertTrue(cigar.equals(result.cigar.toString()), "SW generated cigar = " + result.cigar.toString());
+
+        // confirm that the goodness of the cigar agrees with our expectations
+        Assert.assertEquals(rtgraph.cigarIsOkayToMerge(result.cigar, false, true), cigarIsGood);
+
+        // confirm that the tail merging works as expected
+        if ( cigarIsGood ) {
+            final int mergeResult = rtgraph.mergeDanglingTail(result);
+            Assert.assertTrue(mergeResult == 1 || mergePointDistanceFromSink == -1);
+
+            // confirm that we created the appropriate edge
+            if ( mergePointDistanceFromSink >= 0 ) {
+                MultiDeBruijnVertex v = altSink;
+                for ( int i = 0; i < mergePointDistanceFromSink; i++ ) {
+                    if ( rtgraph.inDegreeOf(v) != 1 )
+                        Assert.fail("Encountered vertex with multiple edges");
+                    v = rtgraph.getEdgeSource(rtgraph.incomingEdgeOf(v));
+                }
+                Assert.assertTrue(rtgraph.outDegreeOf(v) > 1);
+            }
+        }
+    }
+
+    @Test(enabled = true)
+    public void testGetBasesForPath() {
+
+        final int kmerSize = 4;
+        final String testString = "AATGGGGCAATACTA";
+
+        final ReadThreadingGraph graph = new ReadThreadingGraph(kmerSize);
+        graph.addSequence(testString.getBytes(), true);
+        graph.buildGraphIfNecessary();
+
+        final List<MultiDeBruijnVertex> vertexes = new ArrayList<>();
+        MultiDeBruijnVertex v = graph.getReferenceSourceVertex();
+        while ( v != null ) {
+            vertexes.add(v);
+            v = graph.getNextReferenceVertex(v);
+        }
+
+        final String result = new String(graph.getBasesForPath(vertexes, false));
+        Assert.assertEquals(result, testString);
+    }
+
+    @DataProvider(name = "DanglingHeads")
+    public Object[][] makeDanglingHeadsData() {
+        List<Object[]> tests = new ArrayList<>();
+
+        // add 1M to the expected CIGAR because it includes the last (common) base too
+        tests.add(new Object[]{"XXXXXXXAACCGGTTACGT", "AAYCGGTTACGT", "8M", true});        // 1 snp
+        tests.add(new Object[]{"XXXAACCGGTTACGT", "XAAACCGGTTACGT", "7M", false});         // 1 snp
+        tests.add(new Object[]{"XXXXXXXAACCGGTTACGT", "XAACGGTTACGT", "4M1D4M", false});   // deletion
+        tests.add(new Object[]{"XXXXXXXAACCGGTTACGT", "AYYCGGTTACGT", "8M", true});        // 2 snps
+        tests.add(new Object[]{"XXXXXXXAACCGGTTACGTAA", "AYCYGGTTACGTAA", "9M", true});    // 2 snps
+        tests.add(new Object[]{"XXXXXXXAACCGGTTACGT", "AYCGGTTACGT", "7M", true});         // very little data
+        tests.add(new Object[]{"XXXXXXXAACCGGTTACGT", "YCCGGTTACGT", "6M", true});         // begins in mismatch
+
+        return tests.toArray(new Object[][]{});
+    }
+
+    @Test(dataProvider = "DanglingHeads")
+    public void testDanglingHeads(final String ref,
+                                  final String alt,
+                                  final String cigar,
+                                  final boolean shouldBeMerged) {
+
+        final int kmerSize = 5;
+
+        // create the graph and populate it
+        final ReadThreadingGraph rtgraph = new ReadThreadingGraph(kmerSize);
+        rtgraph.addSequence("ref", ref.getBytes(), true);
+        final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(alt.getBytes(), Utils.dupBytes((byte) 30, alt.length()), alt.length() + "M");
+        rtgraph.addRead(read);
+        rtgraph.buildGraphIfNecessary();
+
+        // confirm that we have just a single dangling head
+        MultiDeBruijnVertex altSource = null;
+        for ( final MultiDeBruijnVertex v : rtgraph.vertexSet() ) {
+            if ( rtgraph.isSource(v) && !rtgraph.isReferenceNode(v) ) {
+                Assert.assertTrue(altSource == null, "We found more than one non-reference source");
+                altSource = v;
+            }
+        }
+
+        Assert.assertTrue(altSource != null, "We did not find a non-reference source");
+
+        // confirm that the SW alignment agrees with our expectations
+        final ReadThreadingGraph.DanglingChainMergeHelper result = rtgraph.generateCigarAgainstUpwardsReferencePath(altSource, 0);
+
+        if ( result == null ) {
+            Assert.assertFalse(shouldBeMerged);
+            return;
+        }
+
+        Assert.assertTrue(cigar.equals(result.cigar.toString()), "SW generated cigar = " + result.cigar.toString());
+
+        // confirm that the tail merging works as expected
+        final int mergeResult = rtgraph.mergeDanglingHead(result);
+        Assert.assertTrue(mergeResult > 0 || !shouldBeMerged);
+
+        // confirm that we created the appropriate bubble in the graph only if expected
+        rtgraph.cleanNonRefPaths();
+        final SeqGraph seqGraph = rtgraph.convertToSequenceGraph();
+        List<Path<SeqVertex,BaseEdge>> paths = new KBestPaths<SeqVertex,BaseEdge>().getKBestPaths(seqGraph, seqGraph.getReferenceSourceVertex(), seqGraph.getReferenceSinkVertex());
+        Assert.assertEquals(paths.size(), shouldBeMerged ? 2 : 1);
+    }
+}
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssemblerUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssemblerUnitTest.java
index 9172b6454..5b01a1d85 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssemblerUnitTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssemblerUnitTest.java
@@ -150,6 +150,29 @@ public class ReadThreadingAssemblerUnitTest extends BaseTest {
         assertSingleBubble(assembler, ref, "ACAGCTGA");
     }
 
+    @Test(enabled = ! DEBUG)
+    public void testMismatchInFirstKmer() {
+        final TestAssembler assembler = new TestAssembler(3);
+        final String ref = "ACAACTGA";
+        final String alt =   "AGCTGA";
+        assembler.addSequence(ref.getBytes(), true);
+        assembler.addSequence(alt.getBytes(), false);
+
+        final SeqGraph graph = assembler.assemble();
+        graph.simplifyGraph();
+        graph.removeSingletonOrphanVertices();
+        final Set<SeqVertex> sources = graph.getSources();
+        final Set<SeqVertex> sinks = graph.getSinks();
+
+        Assert.assertEquals(sources.size(), 1);
+        Assert.assertEquals(sinks.size(), 1);
+        Assert.assertNotNull(graph.getReferenceSourceVertex());
+        Assert.assertNotNull(graph.getReferenceSinkVertex());
+
+        final List<Path<SeqVertex,BaseEdge>> paths = new KBestPaths<SeqVertex,BaseEdge>().getKBestPaths(graph);
+        Assert.assertEquals(paths.size(), 2);
+    }
+
     @Test(enabled = ! DEBUG)
     public void testStartInMiddle() {
         final TestAssembler assembler = new TestAssembler(3);
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraphUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraphUnitTest.java
index f6e2a106f..8535c186a 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraphUnitTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraphUnitTest.java
@@ -216,88 +216,6 @@ public class ReadThreadingGraphUnitTest extends BaseTest {
         Assert.assertEquals(pathFinder.getKBestPaths(graph, length, graph.getReferenceSourceVertex(), graph.getReferenceSinkVertex()).size(), 1);
     }
 
-    @DataProvider(name = "DanglingTails")
-    public Object[][] makeDanglingTailsData() {
-        List<Object[]> tests = new ArrayList<Object[]>();
-
-        // add 1M to the expected CIGAR because it includes the previous (common) base too
-        tests.add(new Object[]{"AAAAAAAAAA", "CAAA", "5M", true, 3});                  // incomplete haplotype
-        tests.add(new Object[]{"AAAAAAAAAA", "CAAAAAAAAAA", "1M1I10M", true, 10});     // insertion
-        tests.add(new Object[]{"CCAAAAAAAAAA", "AAAAAAAAAA", "1M2D10M", true, 10});    // deletion
-        tests.add(new Object[]{"AAAAAAAA", "CAAAAAAA", "9M", true, 7});                // 1 snp
-        tests.add(new Object[]{"AAAAAAAA", "CAAGATAA", "9M", true, 2});                // several snps
-        tests.add(new Object[]{"AAAAA", "C", "1M4D1M", false, -1});                    // funky SW alignment
-        tests.add(new Object[]{"AAAAA", "CA", "1M3D2M", false, 1});                    // very little data
-        tests.add(new Object[]{"AAAAAAA", "CAAAAAC", "8M", true, -1});                 // ends in mismatch
-        tests.add(new Object[]{"AAAAAA", "CGAAAACGAA", "1M2I4M2I2M", false, 0});       // alignment is too complex
-
-        return tests.toArray(new Object[][]{});
-    }
-
-    @Test(dataProvider = "DanglingTails", enabled = !DEBUG)
-    public void testDanglingTails(final String refEnd,
-                                  final String altEnd,
-                                  final String cigar,
-                                  final boolean cigarIsGood,
-                                  final int mergePointDistanceFromSink) {
-
-        final int kmerSize = 15;
-
-        // construct the haplotypes
-        final String commonPrefix = "AAAAAAAAAACCCCCCCCCCGGGGGGGGGGTTTTTTTTTT";
-        final String ref = commonPrefix + refEnd;
-        final String alt = commonPrefix + altEnd;
-
-        // create the graph and populate it
-        final ReadThreadingGraph rtgraph = new ReadThreadingGraph(kmerSize);
-        rtgraph.addSequence("ref", ref.getBytes(), true);
-        final GATKSAMRecord read = ArtificialSAMUtils.createArtificialRead(alt.getBytes(), Utils.dupBytes((byte) 30, alt.length()), alt.length() + "M");
-        rtgraph.addRead(read);
-        rtgraph.buildGraphIfNecessary();
-
-        // confirm that we have just a single dangling tail
-        MultiDeBruijnVertex altSink = null;
-        for ( final MultiDeBruijnVertex v : rtgraph.vertexSet() ) {
-            if ( rtgraph.isSink(v) && !rtgraph.isReferenceNode(v) ) {
-                Assert.assertTrue(altSink == null, "We found more than one non-reference sink");
-                altSink = v;
-            }
-        }
-
-        Assert.assertTrue(altSink != null, "We did not find a non-reference sink");
-
-        // confirm that the SW alignment agrees with our expectations
-        final ReadThreadingGraph.DanglingTailMergeResult result = rtgraph.generateCigarAgainstReferencePath(altSink, 0);
-
-        if ( result == null ) {
-            Assert.assertFalse(cigarIsGood);
-            return;
-        }
-
-        Assert.assertTrue(cigar.equals(result.cigar.toString()), "SW generated cigar = " + result.cigar.toString());
-
-        // confirm that the goodness of the cigar agrees with our expectations
-        Assert.assertEquals(rtgraph.cigarIsOkayToMerge(result.cigar), cigarIsGood);
-
-        // confirm that the tail merging works as expected
-        if ( cigarIsGood ) {
-            final int mergeResult = rtgraph.mergeDanglingTail(result);
-            Assert.assertTrue(mergeResult == 1 || mergePointDistanceFromSink == -1);
-
-            // confirm that we created the appropriate edge
-            if ( mergePointDistanceFromSink >= 0 ) {
-                MultiDeBruijnVertex v = altSink;
-                for ( int i = 0; i < mergePointDistanceFromSink; i++ ) {
-                    if ( rtgraph.inDegreeOf(v) != 1 )
-                        Assert.fail("Encountered vertex with multiple sources");
-                    v = rtgraph.getEdgeSource(rtgraph.incomingEdgeOf(v));
-                }
-                Assert.assertTrue(rtgraph.outDegreeOf(v) > 1);
-            }
-        }
-    }
-
-
 // TODO -- update to use determineKmerSizeAndNonUniques directly
 //    @DataProvider(name = "KmerSizeData")
 //    public Object[][] makeKmerSizeDataProvider() {
@@ -340,5 +258,4 @@ public class ReadThreadingGraphUnitTest extends BaseTest {
 //        assertNonUniques(assembler, expectedNonUniques.toArray(new String[]{}));
 //    }
 
-
 }

From 4d69af189e69d084991f84442ff9adb3301561a2 Mon Sep 17 00:00:00 2001
From: Eric Banks <ebanks@broadinstitute.org>
Date: Thu, 27 Feb 2014 13:29:10 -0500
Subject: [PATCH 09/18] Minor change: make the --dontUseSoftClippedBases
 @Advanced instead of @Hidden

---
 .../sting/gatk/walkers/haplotypecaller/HaplotypeCaller.java     | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCaller.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCaller.java
index 13403c0ac..91e763a0d 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCaller.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCaller.java
@@ -459,7 +459,7 @@ public class HaplotypeCaller extends ActiveRegionWalker<List<VariantContext>, In
     @Argument(fullName="debugGraphTransformations", shortName="debugGraphTransformations", doc="If specified, we will write DOT formatted graph files out of the assembler for only this graph size", required = false)
     protected boolean debugGraphTransformations = false;
 
-    @Hidden
+    @Advanced
     @Argument(fullName="dontUseSoftClippedBases", shortName="dontUseSoftClippedBases", doc="If specified, we will not analyze soft clipped bases in the reads", required = false)
     protected boolean dontUseSoftClippedBases = false;
 

From b99bf85ec8ec56e8a420e69c5cb8983968bfb196 Mon Sep 17 00:00:00 2001
From: Eric Banks <ebanks@broadinstitute.org>
Date: Mon, 3 Mar 2014 22:42:56 -0500
Subject: [PATCH 10/18] Fixed bug where dangling tail merging occasionally
 created a cycle in the graph.

Added unit tests to cover this case.  Delivers PT#66690470.
---
 .../readthreading/DanglingChainMergingGraph.java    | 10 ++++++++--
 .../DanglingChainMergingGraphUnitTest.java          | 13 ++++++++++++-
 2 files changed, 20 insertions(+), 3 deletions(-)

diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraph.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraph.java
index e59d39a97..c696c50ae 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraph.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraph.java
@@ -97,7 +97,7 @@ public abstract class DanglingChainMergingGraph extends BaseGraph<MultiDeBruijnV
     /**
      * Class to keep track of the important dangling chain merging data
      */
-    protected final class DanglingChainMergeHelper {
+    protected static final class DanglingChainMergeHelper {
         final List<MultiDeBruijnVertex> danglingPath, referencePath;
         final byte[] danglingPathString, referencePathString;
         final Cigar cigar;
@@ -222,7 +222,7 @@ public abstract class DanglingChainMergingGraph extends BaseGraph<MultiDeBruijnV
         if ( numElements == 0 || numElements > MAX_CIGAR_COMPLEXITY )
             return false;
 
-        // the last element must be an M
+        // the first element must be an M
         if ( requireFirstElementM && elements.get(0).getOperator() != CigarOperator.M )
             return false;
 
@@ -263,6 +263,12 @@ public abstract class DanglingChainMergingGraph extends BaseGraph<MultiDeBruijnV
         final boolean mustHandleLeadingDeletionCase =  firstElementIsDeletion && (elements.get(0).getLength() + matchingSuffix == lastRefIndex + 1);
         final int refIndexToMerge = lastRefIndex - matchingSuffix + 1 + (mustHandleLeadingDeletionCase ? 1 : 0);
 
+        // another edge condition occurs here: if Smith-Waterman places the whole tail into an insertion then it will try to
+        // merge back to the LCA, which results in a cycle in the graph.  So we do not want to merge in such a case.
+        if ( refIndexToMerge == 0 )
+            return 0;
+
+        // it's safe to merge now
         addEdge(danglingTailMergeResult.danglingPath.get(altIndexToMerge), danglingTailMergeResult.referencePath.get(refIndexToMerge), ((MyEdgeFactory)getEdgeFactory()).createEdge(false, 1));
 
         return 1;
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraphUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraphUnitTest.java
index f45dbd093..bab952e2a 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraphUnitTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraphUnitTest.java
@@ -46,6 +46,8 @@
 
 package org.broadinstitute.sting.gatk.walkers.haplotypecaller.readthreading;
 
+import net.sf.samtools.Cigar;
+import net.sf.samtools.TextCigarCodec;
 import org.broadinstitute.sting.BaseTest;
 import org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs.*;
 import org.broadinstitute.sting.utils.Utils;
@@ -77,6 +79,7 @@ public class DanglingChainMergingGraphUnitTest extends BaseTest {
         tests.add(new Object[]{"AAAAA", "CA", "1M3D2M", false, 1});                    // very little data
         tests.add(new Object[]{"AAAAAAA", "CAAAAAC", "8M", true, -1});                 // ends in mismatch
         tests.add(new Object[]{"AAAAAA", "CGAAAACGAA", "1M2I4M2I2M", false, 0});       // alignment is too complex
+        tests.add(new Object[]{"AAAAA", "XXXXX", "1M5I", false, -1});                  // insertion
 
         return tests.toArray(new Object[][]{});
     }
@@ -144,7 +147,15 @@ public class DanglingChainMergingGraphUnitTest extends BaseTest {
         }
     }
 
-    @Test(enabled = true)
+    @Test
+    public void testWholeTailIsInsertion() {
+        final ReadThreadingGraph rtgraph = new ReadThreadingGraph(10);
+        final ReadThreadingGraph.DanglingChainMergeHelper result = new ReadThreadingGraph.DanglingChainMergeHelper(null, null, "AXXXXX".getBytes(), "AAAAAA".getBytes(), new TextCigarCodec().decode("5I1M"));
+        final int mergeResult = rtgraph.mergeDanglingTail(result);
+        Assert.assertEquals(mergeResult, 0);
+    }
+
+    @Test
     public void testGetBasesForPath() {
 
         final int kmerSize = 4;

From 7acf2eb0e74f8bbb87600213268b5395e1770eba Mon Sep 17 00:00:00 2001
From: Valentin Ruano-Rubio <valentin@broadinstitute.org>
Date: Thu, 27 Feb 2014 03:04:41 -0500
Subject: [PATCH 11/18] Added a more efficient implementation of the KBest
 haplotype finder code.

Story:

  https://www.pivotaltracker.com/story/show/66238286

Changes:

  1. Created a new k-best haplotype search implementation in class KBestHaplotypeFinder.
  2. Changed HC code to use the new implementation.
  This seems to fix the original problem without causing significant changes in outputs using some empirical data test cases
  3. Moved haplotype's cigar calculation code from Path to CigarUtils; need that in order to gain independence from Path in some parts of the code.
     In any case that seems like a more natural location for that functionality.
---
 .../haplotypecaller/LocalAssemblyEngine.java  |  17 +-
 .../DeadEndKBestSubHaplotypeFinder.java       |  80 ++++++
 .../graphs/EmptyPathHaplotypeFinder.java      | 125 +++++++++
 .../graphs/KBestHaplotype.java                | 161 ++++++++++++
 .../graphs/KBestHaplotypeFinder.java          | 245 ++++++++++++++++++
 .../graphs/KBestSubHaplotypeFinder.java       |  72 +++++
 .../walkers/haplotypecaller/graphs/Path.java  | 103 +-------
 .../graphs/RecursiveSubHaplotypeFinder.java   | 242 +++++++++++++++++
 .../HaplotypeBAMWriter.java                   |   9 +-
 .../graphs/KBestPathsUnitTest.java            |   9 +-
 .../sting/utils/sam/CigarUtils.java           | 105 ++++++++
 11 files changed, 1054 insertions(+), 114 deletions(-)
 create mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/DeadEndKBestSubHaplotypeFinder.java
 create mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/EmptyPathHaplotypeFinder.java
 create mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotype.java
 create mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotypeFinder.java
 create mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestSubHaplotypeFinder.java
 create mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/RecursiveSubHaplotypeFinder.java

diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/LocalAssemblyEngine.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/LocalAssemblyEngine.java
index d49827405..8dfeed987 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/LocalAssemblyEngine.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/LocalAssemblyEngine.java
@@ -54,8 +54,9 @@ import net.sf.samtools.CigarOperator;
 import org.apache.log4j.Logger;
 import org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs.*;
 import org.broadinstitute.sting.utils.GenomeLoc;
-import org.broadinstitute.sting.utils.haplotype.Haplotype;
 import org.broadinstitute.sting.utils.activeregion.ActiveRegion;
+import org.broadinstitute.sting.utils.haplotype.Haplotype;
+import org.broadinstitute.sting.utils.sam.CigarUtils;
 import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
 import org.broadinstitute.variant.variantcontext.Allele;
 import org.broadinstitute.variant.variantcontext.VariantContext;
@@ -220,12 +221,13 @@ public abstract class LocalAssemblyEngine {
             final SeqVertex source = graph.getReferenceSourceVertex();
             final SeqVertex sink = graph.getReferenceSinkVertex();
             if ( source == null || sink == null ) throw new IllegalArgumentException("Both source and sink cannot be null but got " + source + " and sink " + sink + " for graph "+ graph);
-
-            final KBestPaths<SeqVertex,BaseEdge> pathFinder = new KBestPaths<>(allowCyclesInKmerGraphToGeneratePaths);
-            for ( final Path<SeqVertex,BaseEdge> path : pathFinder.getKBestPaths(graph, numBestHaplotypesPerGraph, source, sink) ) {
-                Haplotype h = new Haplotype( path.getBases() );
+            final KBestHaplotypeFinder haplotypeFinder = new KBestHaplotypeFinder(graph,source,sink);
+            final Iterator<KBestHaplotype> bestHaplotypes = haplotypeFinder.iterator(numBestHaplotypesPerGraph);
+            while (bestHaplotypes.hasNext()) {
+                final KBestHaplotype kBestHaplotype = bestHaplotypes.next();
+                final Haplotype h = kBestHaplotype.haplotype();
                 if( !returnHaplotypes.contains(h) ) {
-                    final Cigar cigar = path.calculateCigar(refHaplotype.getBases());
+                    final Cigar cigar = CigarUtils.calculateCigar(refHaplotype.getBases(),h.getBases());
 
                     if ( cigar == null ) {
                         // couldn't produce a meaningful alignment of haplotype to reference, fail quietly
@@ -239,12 +241,11 @@ public abstract class LocalAssemblyEngine {
                     } else if( cigar.getReferenceLength() != refHaplotype.getCigar().getReferenceLength() ) { // SW failure
                         throw new IllegalStateException("Smith-Waterman alignment failure. Cigar = " + cigar + " with reference length "
                                 + cigar.getReferenceLength() + " but expecting reference length of " + refHaplotype.getCigar().getReferenceLength()
-                                + " ref = " + refHaplotype + " path " + new String(path.getBases()));
+                                + " ref = " + refHaplotype + " path " + new String(h.getBases()));
                     }
 
                     h.setCigar(cigar);
                     h.setAlignmentStartHapwrtRef(activeRegionStart);
-                    h.setScore(path.getScore());
                     h.setGenomeLocation(activeRegionWindow);
                     returnHaplotypes.add(h);
                     assemblyResultSet.add(h, assemblyResultByGraph.get(graph));
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/DeadEndKBestSubHaplotypeFinder.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/DeadEndKBestSubHaplotypeFinder.java
new file mode 100644
index 000000000..0a29bd08b
--- /dev/null
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/DeadEndKBestSubHaplotypeFinder.java
@@ -0,0 +1,80 @@
+/*
+*  By downloading the PROGRAM you agree to the following terms of use:
+*
+*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
+*
+*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
+*
+*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
+*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
+*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
+*
+*  1. DEFINITIONS
+*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
+*
+*  2. LICENSE
+*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM.
+*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
+*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
+*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.
+*
+*  3. OWNERSHIP OF INTELLECTUAL PROPERTY
+*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
+*  Copyright 2012 Broad Institute, Inc.
+*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
+*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
+*
+*  4. INDEMNIFICATION
+*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
+*
+*  5. NO REPRESENTATIONS OR WARRANTIES
+*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
+*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
+*
+*  6. ASSIGNMENT
+*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
+*
+*  7. MISCELLANEOUS
+*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
+*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
+*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
+*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt.
+*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter.
+*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
+*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
+*/
+package org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs;
+
+/**
+ * Represent a trivial k-best sub haplotype finder with no solutions.
+ *
+ * <p>To be used at vertices that do not have any valid path to the requested sink node</p>
+ *
+ * @author Valentin Ruano-Rubio &lt;valentin@broadinstitute.org&gt;
+ */
+final class DeadEndKBestSubHaplotypeFinder implements KBestSubHaplotypeFinder {
+
+    /**
+     * Sole instance of this class.
+     */
+    public static DeadEndKBestSubHaplotypeFinder INSTANCE = new DeadEndKBestSubHaplotypeFinder();
+
+    /**
+     * Prevents instantiation of more than one instance; please use {@link #INSTANCE}.
+     */
+    protected DeadEndKBestSubHaplotypeFinder() {
+    }
+
+    @Override
+    public int getCount() {
+        return 0;
+    }
+
+    @Override
+    public KBestHaplotype getKBest(int k) {
+        if (k < 0)
+            throw new IllegalArgumentException("k cannot be negative");
+        else
+            throw new IllegalArgumentException("k cannot be equal or greater to the haplotype count");
+    }
+}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/EmptyPathHaplotypeFinder.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/EmptyPathHaplotypeFinder.java
new file mode 100644
index 000000000..aa1f213fe
--- /dev/null
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/EmptyPathHaplotypeFinder.java
@@ -0,0 +1,125 @@
+/*
+*  By downloading the PROGRAM you agree to the following terms of use:
+*
+*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
+*
+*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
+*
+*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
+*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
+*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
+*
+*  1. DEFINITIONS
+*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
+*
+*  2. LICENSE
+*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM.
+*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
+*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
+*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.
+*
+*  3. OWNERSHIP OF INTELLECTUAL PROPERTY
+*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
+*  Copyright 2012 Broad Institute, Inc.
+*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
+*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
+*
+*  4. INDEMNIFICATION
+*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
+*
+*  5. NO REPRESENTATIONS OR WARRANTIES
+*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
+*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
+*
+*  6. ASSIGNMENT
+*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
+*
+*  7. MISCELLANEOUS
+*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
+*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
+*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
+*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt.
+*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter.
+*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
+*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
+*/
+package org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs;
+
+/**
+ * Trivial k-best sub-haplotype finder where the source and sink vertex are the same one.
+ *
+ * @author Valentin Ruano-Rubio &lt;valentin@broadinstitute.org&gt;
+ */
+class EmptyPathHaplotypeFinderNode implements KBestSubHaplotypeFinder {
+
+
+    /**
+     * Caches the only solution returned by this finder.
+     */
+    private final KBestHaplotype singleHaplotypePath;
+
+    public EmptyPathHaplotypeFinderNode(final SeqGraph graph, final SeqVertex sink) {
+        singleHaplotypePath = new MyBestHaplotypePath(graph,sink);
+    }
+
+    @Override
+    public int getCount() {
+        return 1;
+    }
+
+    @Override
+    public KBestHaplotype getKBest(int k) {
+        if (k < 0)
+            throw new IllegalArgumentException("k cannot be negative");
+        if (k > 0)
+            throw new IllegalArgumentException("k cannot greater than the possible haplotype count");
+        return singleHaplotypePath;
+    }
+
+    /**
+     * Custom extension of {@link KBestHaplotype} that implements the single solution behaviour.
+     */
+    private class MyBestHaplotypePath extends KBestHaplotype {
+
+        private final SeqVertex vertex;
+
+        private final SeqGraph graph;
+
+        private Boolean isReference;
+
+        public MyBestHaplotypePath(final SeqGraph graph, final SeqVertex vertex) {
+            this.vertex = vertex;
+            this.graph = graph;
+        }
+
+        @Override
+        public SeqGraph graph() {
+            return graph;
+        }
+
+        @Override
+        public int score() {
+            return 0;
+        }
+
+        @Override
+        public int rank() {
+            return 0;
+        }
+
+        @Override
+        protected SeqVertex head() {
+            return vertex;
+        }
+
+        @Override
+        protected KBestHaplotype tail() {
+            return null;
+        }
+
+        @Override
+        public boolean isReference() {
+            return (isReference != null) ? isReference: (isReference = graph.isReferenceNode(vertex));
+        }
+    }
+}
\ No newline at end of file
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotype.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotype.java
new file mode 100644
index 000000000..d88c17cbf
--- /dev/null
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotype.java
@@ -0,0 +1,161 @@
+/*
+*  By downloading the PROGRAM you agree to the following terms of use:
+*
+*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
+*
+*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
+*
+*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
+*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
+*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
+*
+*  1. DEFINITIONS
+*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
+*
+*  2. LICENSE
+*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM.
+*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
+*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
+*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.
+*
+*  3. OWNERSHIP OF INTELLECTUAL PROPERTY
+*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
+*  Copyright 2012 Broad Institute, Inc.
+*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
+*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
+*
+*  4. INDEMNIFICATION
+*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
+*
+*  5. NO REPRESENTATIONS OR WARRANTIES
+*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
+*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
+*
+*  6. ASSIGNMENT
+*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
+*
+*  7. MISCELLANEOUS
+*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
+*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
+*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
+*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt.
+*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter.
+*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
+*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
+*/
+package org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs;
+
+import org.broadinstitute.sting.utils.haplotype.Haplotype;
+
+/**
+ * Represents a result from a K-best haplotype search.
+ *
+ * @author Valentin Ruano-Rubio &lt;valentin@broadinstitute.org&gt;
+ */
+public abstract class KBestHaplotype {
+
+    /**
+     * Returns the original graph searched.
+     *
+     * @return never {@code null}
+     */
+    public abstract SeqGraph graph();
+
+    /**
+     * Returns the result haplotype score.
+     *
+     * <p>Currently, the score is the multiplicity total sum of edges along the haplotype path</p>
+     *
+     * @return 0 or greater.
+     */
+    public abstract int score();
+
+    /**
+     * Indicates whether this result is the reference haplotype.
+     *
+     * @return {@code true} if it is the reference haplotype, {@code false} otherwise.
+     */
+    public abstract boolean isReference();
+
+    /**
+     * The rank of this solution within the list of solutions that resulted from the same search.
+     *
+     * <p>0 would correspond to the best solution, 1 with the second best and so on</p>
+     *
+     * @return 0 or greater.
+     */
+    public abstract int rank();
+
+    private byte[] bases;
+
+    private Haplotype haplotype;
+
+    private Path<SeqVertex,BaseEdge> path;
+
+    /**
+     * Returns the result haplotype bases.
+     *
+     * @return never {@code null}.
+     */
+    public byte[] bases() {
+        if (bases != null) return bases;
+        final KBestHaplotype tail = tail();
+        final SeqVertex head = head();
+        if (tail == null)
+            bases = head.getSequence();
+        else {
+            final byte[] tailBases = tail.bases();
+            final byte[] headBases = head.getSequence();
+            final int length = tailBases.length + headBases.length;
+            bases = new byte[length];
+            System.arraycopy(headBases,0,bases,0,headBases.length);
+            System.arraycopy(tailBases,0,bases,headBases.length,tailBases.length);
+        }
+        return bases;
+    }
+
+    /**
+     * Returns the solution haplotype.
+     *
+     * @return never {@code null}.
+     */
+    public Haplotype haplotype() {
+        if (haplotype != null) return haplotype;
+        haplotype = new Haplotype(bases(),isReference());
+        haplotype.setScore(score());
+        return haplotype;
+    }
+
+    /**
+     * Returns the path across the original graph that correspond to the solution haplotype.
+     *
+     * @return never {@code null}, although perhaps a zero-length path (only one vertex).
+     */
+    public Path<SeqVertex,BaseEdge> path() {
+        if (path != null) return path;
+        final KBestHaplotype tail = tail();
+        if (tail == null)
+            path = new Path<>(head(),graph());
+        else {
+            final Path<SeqVertex,BaseEdge> tailPath = tail.path();
+            path = new Path<>(graph().getEdge(head(),tailPath.getFirstVertex()),tailPath);
+        }
+        return path;
+    }
+
+    /**
+     * The first vertex on the haplotype path.
+     *
+     * @return never {@code null}.
+     */
+    protected abstract SeqVertex head();
+
+    /**
+     * Returns the sub-haplotype from the second vertex involved in the haplotype until the end.
+     *
+     * @return {@code null} if there are no more vertices in the solution path a part from the one returned by {@link #head}.
+     */
+    protected abstract KBestHaplotype tail();
+
+
+}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotypeFinder.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotypeFinder.java
new file mode 100644
index 000000000..725fcae1a
--- /dev/null
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotypeFinder.java
@@ -0,0 +1,245 @@
+/*
+*  By downloading the PROGRAM you agree to the following terms of use:
+*
+*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
+*
+*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
+*
+*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
+*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
+*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
+*
+*  1. DEFINITIONS
+*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
+*
+*  2. LICENSE
+*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM.
+*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
+*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
+*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.
+*
+*  3. OWNERSHIP OF INTELLECTUAL PROPERTY
+*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
+*  Copyright 2012 Broad Institute, Inc.
+*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
+*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
+*
+*  4. INDEMNIFICATION
+*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
+*
+*  5. NO REPRESENTATIONS OR WARRANTIES
+*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
+*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
+*
+*  6. ASSIGNMENT
+*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
+*
+*  7. MISCELLANEOUS
+*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
+*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
+*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
+*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt.
+*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter.
+*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
+*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
+*/
+package org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs;
+
+import org.jgrapht.alg.CycleDetector;
+
+import java.util.*;
+
+/**
+ * Efficient algorithm to obtain the list of best haplotypes given the {@link SeqGraph instace}.
+ *
+ * @author Valentin Ruano-Rubio &lt;valentin@broadinstitute.org&gt;
+ */
+public class KBestHaplotypeFinder extends AbstractList<KBestHaplotype> implements Iterable<KBestHaplotype>  {
+
+
+    private final SeqGraph graph;
+    protected Map<SeqVertex,KBestSubHaplotypeFinder> nodeBySource;
+
+    protected SeqVertex sink;
+    protected SeqVertex source;
+
+    /**
+     * Constructs a new best haplotypes finder.
+     *
+     * @param graph the seq-graph to search.
+     * @param source the source vertex for all haplotypes.
+     * @param sink the sink vertex for all haplotypes.
+     *
+     * @throws IllegalArgumentException if <ul>
+     *     <li>any of {@code graph}, {@code source} or {@code sink} is {@code null} or</li>
+     *     <li>either {@code source} or {@code sink} is not a vertex of {@code graph}'s.</li>
+     * </ul>
+     */
+    public KBestHaplotypeFinder(final SeqGraph graph, final SeqVertex source, final SeqVertex sink) {
+        if (graph == null) throw new IllegalArgumentException("graph cannot be null");
+        if (source == null) throw new IllegalArgumentException("source cannot be null");
+        if (sink == null) throw new IllegalArgumentException("sink cannot be null");
+        if (!graph.containsVertex(source)) throw new IllegalArgumentException("source does not belong to the graph");
+        if (!graph.containsVertex(sink)) throw new IllegalArgumentException("sink does not belong to the graph");
+        //TODO dealing with cycles here due to a bug in some of the graph transformations that produces cycles.
+        //TODO Once that is solve, the conditional above should be removed in order the save time:
+        //this.graph = graph;
+        if (new CycleDetector<>(graph).detectCycles())
+            this.graph = removeCycles(graph,source,sink);
+        else
+            this.graph = graph;
+        nodeBySource = new HashMap<>(graph.vertexSet().size());
+        this.sink = sink;
+        this.source = source;
+    }
+
+    private static SeqGraph removeCycles(final SeqGraph original, final SeqVertex source, final SeqVertex sink) {
+        final Set<BaseEdge> edgesToRemove = new HashSet<>(original.edgeSet().size());
+        final Set<SeqVertex> vertexToRemove = new HashSet<>(original.vertexSet().size());
+
+        if (!findGuiltyVerticesAndEdgesToRemoveCycles(original, source, sink, edgesToRemove, vertexToRemove, new HashSet<SeqVertex>(original.vertexSet().size())))
+            throw new IllegalStateException("could not find any path from the source vertex to the sink vertex: " + source + " -> " + sink);
+
+        if (edgesToRemove.isEmpty() && vertexToRemove.isEmpty())
+            throw new IllegalStateException("cannot find a way to remove the cycles");
+
+        final SeqGraph result = (SeqGraph) original.clone();
+        result.removeAllEdges(edgesToRemove);
+        result.removeAllVertices(vertexToRemove);
+        return result;
+    }
+
+    private static boolean findGuiltyVerticesAndEdgesToRemoveCycles(final SeqGraph graph, final SeqVertex currentVertex, final SeqVertex sink,
+                                                                    final Set<BaseEdge> edgesToRemove, final Set<SeqVertex> verticesToRemove,
+                                                                    final Set<SeqVertex> parentVertices) {
+        if (currentVertex.equals(sink)) return true;
+
+        final Set<BaseEdge> outgoingEdges = graph.outgoingEdgesOf(currentVertex);
+        boolean reachsSink = false;
+        parentVertices.add(currentVertex);
+
+        for (final BaseEdge edge : outgoingEdges) {
+            final SeqVertex child = graph.getEdgeTarget(edge);
+            if (parentVertices.contains(child))
+                edgesToRemove.add(edge);
+            else {
+              final boolean childReachSink = findGuiltyVerticesAndEdgesToRemoveCycles(graph, child, sink, edgesToRemove, verticesToRemove, parentVertices);
+              reachsSink = reachsSink || childReachSink;
+            }
+        }
+        parentVertices.remove(currentVertex);
+        if (!reachsSink) verticesToRemove.add(currentVertex);
+        return reachsSink;
+    }
+
+
+    @Override
+    public KBestHaplotype get(int index) {
+        final KBestSubHaplotypeFinder sourceNode = createNode(source);
+        if (index < 0 || index >= size())
+            throw new IndexOutOfBoundsException();
+        return sourceNode.getKBest(index);
+    }
+
+    @Override
+    public Iterator<KBestHaplotype> iterator() {
+        final KBestSubHaplotypeFinder sourceFinder = createNode(source);
+
+        return new Iterator<KBestHaplotype>() {
+            private int nextK = 0;
+            private final int maxK = sourceFinder.getCount();
+
+
+            @Override
+            public boolean hasNext() {
+                return nextK < maxK;
+            }
+
+            @Override
+            public KBestHaplotype next() {
+                if (nextK >= maxK) throw new NoSuchElementException();
+                return sourceFinder.getKBest(nextK++);
+            }
+
+            @Override
+            public void remove() {
+                throw new UnsupportedOperationException();
+            }
+        };
+    }
+
+    @Override
+    public int size() {
+        return createNode(source).getCount();
+    }
+
+    /**
+     * Returns an iterator on the first k best haplotypes.
+     * <p>
+     *     It might return less than k haplotypes if the total number of possible haplotypes is smaller.
+     * </p>
+     *
+     * @param k the maximum number of haplotypes to return.
+     * @return never {@code null}, but perhaps a iterator that return no haplotype.
+     */
+    public Iterator<KBestHaplotype> iterator(final int k) {
+        final KBestSubHaplotypeFinder sourceFinder = createNode(source);
+
+        return new Iterator<KBestHaplotype>() {
+            private int nextK = 0;
+            private final int maxK = Math.min(sourceFinder.getCount(), k);
+
+
+            @Override
+            public boolean hasNext() {
+                return nextK < maxK;
+            }
+
+            @Override
+            public KBestHaplotype next() {
+                if (nextK >= maxK) throw new NoSuchElementException();
+                return sourceFinder.getKBest(nextK++);
+            }
+
+            @Override
+            public void remove() {
+                throw new UnsupportedOperationException();
+            }
+        };
+    }
+
+    protected KBestSubHaplotypeFinder createNode(final SeqVertex source) {
+        KBestSubHaplotypeFinder node = nodeBySource.get(source);
+        if (node == null) {
+            if (source.equals(sink))
+                node = new EmptyPathHaplotypeFinderNode(graph,sink);
+            else {
+                final Set<BaseEdge> outgoingEdges = graph.outgoingEdgesOf(source);
+                if (outgoingEdges.isEmpty())
+                    node = DeadEndKBestSubHaplotypeFinder.INSTANCE;
+                else {
+                    final Map<BaseEdge,KBestSubHaplotypeFinder> undeadChildren = createChildrenNodes(outgoingEdges);
+                    if (undeadChildren.isEmpty())
+                        node = DeadEndKBestSubHaplotypeFinder.INSTANCE;
+                    else
+                        node = new RecursiveSubHaplotypeFinder(graph,source,undeadChildren);
+
+                }
+            }
+            nodeBySource.put(source,node);
+        }
+        return node;
+    }
+
+    private Map<BaseEdge, KBestSubHaplotypeFinder> createChildrenNodes(Set<BaseEdge> baseEdges) {
+        final Map<BaseEdge,KBestSubHaplotypeFinder> result = new LinkedHashMap<>(baseEdges.size());
+        for (final BaseEdge edge : baseEdges)
+            result.put(edge,createNode(graph.getEdgeTarget(edge)));
+        final Iterator<Map.Entry<BaseEdge,KBestSubHaplotypeFinder>> childrenIterator = result.entrySet().iterator();
+        while (childrenIterator.hasNext())
+            if (childrenIterator.next().getValue().getCount() == 0)
+                childrenIterator.remove();
+        return result;
+    }
+
+}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestSubHaplotypeFinder.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestSubHaplotypeFinder.java
new file mode 100644
index 000000000..a637ff2b6
--- /dev/null
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestSubHaplotypeFinder.java
@@ -0,0 +1,72 @@
+/*
+*  By downloading the PROGRAM you agree to the following terms of use:
+*
+*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
+*
+*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
+*
+*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
+*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
+*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
+*
+*  1. DEFINITIONS
+*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
+*
+*  2. LICENSE
+*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM.
+*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
+*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
+*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.
+*
+*  3. OWNERSHIP OF INTELLECTUAL PROPERTY
+*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
+*  Copyright 2012 Broad Institute, Inc.
+*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
+*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
+*
+*  4. INDEMNIFICATION
+*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
+*
+*  5. NO REPRESENTATIONS OR WARRANTIES
+*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
+*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
+*
+*  6. ASSIGNMENT
+*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
+*
+*  7. MISCELLANEOUS
+*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
+*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
+*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
+*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt.
+*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter.
+*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
+*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
+*/
+package org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs;
+
+/**
+ * Common interface for K-Best sub-haplotype finders.
+ *
+ * @author Valentin Ruano-Rubio &lt;valentin@broadinstitute.org&gt;
+ */
+interface KBestSubHaplotypeFinder {
+
+    /**
+     * Returns the total number of possible sub-haplotypes.
+     * @return 0 or greater.
+     */
+    public abstract int getCount();
+
+    /**
+     * Return the k-best sub-haplotype solution.
+     *
+     *
+     * @param k the requested solution rank.
+     * @throws IllegalArgumentException if {@code k} is outside bounds [0 .. {@link #getCount()}).
+     *
+     * @return never {@code null}.
+     */
+    public abstract KBestHaplotype getKBest(int k);
+
+}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/Path.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/Path.java
index 6901d16ef..e6f460d1a 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/Path.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/Path.java
@@ -48,12 +48,8 @@ package org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs;
 
 import com.google.java.contract.Ensures;
 import net.sf.samtools.Cigar;
-import net.sf.samtools.CigarElement;
-import net.sf.samtools.CigarOperator;
 import org.apache.commons.lang.ArrayUtils;
-import org.apache.log4j.Logger;
-import org.broadinstitute.sting.utils.smithwaterman.*;
-import org.broadinstitute.sting.utils.sam.AlignmentUtils;
+import org.broadinstitute.sting.utils.sam.CigarUtils;
 
 import java.util.*;
 
@@ -68,8 +64,6 @@ import java.util.*;
  *
  */
 public class Path<T extends BaseVertex, E extends BaseEdge> {
-    private final static String SW_PAD = "NNNNNNNNNN";
-    private final static Logger logger = Logger.getLogger(Path.class);
 
     // the last vertex seen in the path
     protected final T lastVertex;
@@ -84,10 +78,6 @@ public class Path<T extends BaseVertex, E extends BaseEdge> {
     // the graph from which this path originated
     protected final BaseGraph<T, E> graph;
 
-    // used in the bubble state machine to apply Smith-Waterman to the bubble sequence
-    // these values were chosen via optimization against the NA12878 knowledge base
-    public static final Parameters NEW_SW_PARAMETERS = new Parameters(20.0, -15.0, -26.0, -1.1);
-
     /**
      * Create a new Path containing no edges and starting at initialVertex
      * @param initialVertex the starting vertex of the path
@@ -348,96 +338,10 @@ public class Path<T extends BaseVertex, E extends BaseEdge> {
      * @param refSeq the reference sequence that all of the bases in this path should align to
      * @return a Cigar mapping this path to refSeq, or null if no reasonable alignment could be found
      */
-    public Cigar calculateCigar(final byte[] refSeq) {
-        if ( getBases().length == 0 ) {
-            // horrible edge case from the unit tests, where this path has no bases
-            return new Cigar(Arrays.asList(new CigarElement(refSeq.length, CigarOperator.D)));
-        }
-
-        final byte[] bases = getBases();
-        final Cigar nonStandard;
-
-        final String paddedRef = SW_PAD + new String(refSeq) + SW_PAD;
-        final String paddedPath = SW_PAD + new String(bases) + SW_PAD;
-        final SmithWaterman alignment = new SWPairwiseAlignment( paddedRef.getBytes(), paddedPath.getBytes(), NEW_SW_PARAMETERS );
-
-        if ( isSWFailure(alignment) )
-            return null;
-
-        // cut off the padding bases
-        final int baseStart = SW_PAD.length();
-        final int baseEnd = paddedPath.length() - SW_PAD.length() - 1; // -1 because it's inclusive
-        nonStandard = AlignmentUtils.trimCigarByBases(alignment.getCigar(), baseStart, baseEnd);
-
-        if ( nonStandard.getReferenceLength() != refSeq.length ) {
-            nonStandard.add(new CigarElement(refSeq.length - nonStandard.getReferenceLength(), CigarOperator.D));
-        }
-
-        // finally, return the cigar with all indels left aligned
-        return leftAlignCigarSequentially(nonStandard, refSeq, getBases(), 0, 0);
+    public  Cigar calculateCigar(final byte[] refSeq) {
+        return CigarUtils.calculateCigar(refSeq,getBases());
     }
 
-    /**
-     * Make sure that the SW didn't fail in some terrible way, and throw exception if it did
-     */
-    private boolean isSWFailure(final SmithWaterman alignment) {
-        // check that the alignment starts at the first base, which it should given the padding
-        if ( alignment.getAlignmentStart2wrt1() > 0 ) {
-            return true;
-//            throw new IllegalStateException("SW failure ref " + paddedRef + " vs. " + paddedPath + " should always start at 0, but got " + alignment.getAlignmentStart2wrt1() + " with cigar " + alignment.getCigar());
-        }
-
-        // check that we aren't getting any S operators (which would be very bad downstream)
-        for ( final CigarElement ce : alignment.getCigar().getCigarElements() ) {
-            if ( ce.getOperator() == CigarOperator.S )
-                return true;
-                // soft clips at the end of the alignment are really insertions
-//                throw new IllegalStateException("SW failure ref " + paddedRef + " vs. " + paddedPath + " should never contain S operators but got cigar " + alignment.getCigar());
-        }
-
-        return false;
-    }
-
-    /**
-     * Left align the given cigar sequentially. This is needed because AlignmentUtils doesn't accept cigars with more than one indel in them.
-     * This is a target of future work to incorporate and generalize into AlignmentUtils for use by others.
-     * @param cigar     the cigar to left align
-     * @param refSeq    the reference byte array
-     * @param readSeq   the read byte array
-     * @param refIndex  0-based alignment start position on ref
-     * @param readIndex 0-based alignment start position on read
-     * @return          the left-aligned cigar
-     */
-    @Ensures({"cigar != null", "refSeq != null", "readSeq != null", "refIndex >= 0", "readIndex >= 0"})
-    protected static Cigar leftAlignCigarSequentially(final Cigar cigar, final byte[] refSeq, final byte[] readSeq, int refIndex, int readIndex) {
-        final Cigar cigarToReturn = new Cigar();
-        Cigar cigarToAlign = new Cigar();
-        for (int i = 0; i < cigar.numCigarElements(); i++) {
-            final CigarElement ce = cigar.getCigarElement(i);
-            if (ce.getOperator() == CigarOperator.D || ce.getOperator() == CigarOperator.I) {
-                cigarToAlign.add(ce);
-                final Cigar leftAligned = AlignmentUtils.leftAlignSingleIndel(cigarToAlign, refSeq, readSeq, refIndex, readIndex, false);
-                for ( final CigarElement toAdd : leftAligned.getCigarElements() ) { cigarToReturn.add(toAdd); }
-                refIndex += cigarToAlign.getReferenceLength();
-                readIndex += cigarToAlign.getReadLength();
-                cigarToAlign = new Cigar();
-            } else {
-                cigarToAlign.add(ce);
-            }
-        }
-        if( !cigarToAlign.isEmpty() ) {
-            for( final CigarElement toAdd : cigarToAlign.getCigarElements() ) {
-                cigarToReturn.add(toAdd);
-            }
-        }
-
-        final Cigar result = AlignmentUtils.consolidateCigar(cigarToReturn);
-        if( result.getReferenceLength() != cigar.getReferenceLength() )
-            throw new IllegalStateException("leftAlignCigarSequentially failed to produce a valid CIGAR.  Reference lengths differ.  Initial cigar " + cigar + " left aligned into " + result);
-        return result;
-    }
-
-
     /**
      * Tests that this and other have the same score and vertices in the same order with the same seq
      * @param other the other path to consider.  Cannot be null
@@ -463,4 +367,5 @@ public class Path<T extends BaseVertex, E extends BaseEdge> {
         }
         return true;
     }
+
 }
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/RecursiveSubHaplotypeFinder.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/RecursiveSubHaplotypeFinder.java
new file mode 100644
index 000000000..f2106ffb9
--- /dev/null
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/RecursiveSubHaplotypeFinder.java
@@ -0,0 +1,242 @@
+/*
+*  By downloading the PROGRAM you agree to the following terms of use:
+*
+*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
+*
+*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
+*
+*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
+*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
+*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
+*
+*  1. DEFINITIONS
+*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
+*
+*  2. LICENSE
+*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM.
+*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
+*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
+*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.
+*
+*  3. OWNERSHIP OF INTELLECTUAL PROPERTY
+*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
+*  Copyright 2012 Broad Institute, Inc.
+*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
+*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
+*
+*  4. INDEMNIFICATION
+*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
+*
+*  5. NO REPRESENTATIONS OR WARRANTIES
+*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
+*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
+*
+*  6. ASSIGNMENT
+*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
+*
+*  7. MISCELLANEOUS
+*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
+*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
+*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
+*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt.
+*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter.
+*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
+*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
+*/
+package org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs;
+
+import java.util.ArrayList;
+import java.util.Map;
+import java.util.PriorityQueue;
+
+/**
+* General recursive sub-haplotype finder.
+* <p>
+*   Provides the k-best sub-haplotypes looking into the outgoing set of vertices (that contain at least one solution).
+* </p>
+* <p>
+*  This is done efficiently by keeping an priority-queue on best subhaplotype solutions and pulling them on demand
+*  as needed.
+*  </p>
+* <p>
+*  Solutions are cached for repeated retrieval so that we save compute at vertices that share sub-haplotypes
+*     (share descendant vertices). This aspect is controlled by {@link KBestSubHaplotypeFinder} that instantiate
+*     a unique {@link KBestSubHaplotypeFinder} for each vertex in the graph that belongs to a valid path
+*     between the source and sink node.
+* </p>
+*
+* @author Valentin Ruano-Rubio &lt;valentin@broadinstitute.org&gt;
+*/
+class RecursiveSubHaplotypeFinder implements KBestSubHaplotypeFinder {
+
+    private final SeqGraph graph;
+
+    private final SeqVertex vertex;
+
+    private final Map<BaseEdge,KBestSubHaplotypeFinder> children;
+
+    private boolean childrenWereProcessed = false;
+
+    /**
+     * Holds the number of possible paths from this source node vertex to the sink vertex.
+     *
+     * <p>Updated by {@link #processChildrenIfNeeded()}</p>
+     */
+    private int possibleHaplotypeCount;
+
+    /**
+     * Holds the best {@code i} paths to the sink so far calculated where {@code i+1} is the length of rankedResults.
+     *
+     * <p>As more results are requested the array will grow. All positions and solutions are calculated up to {@code i}</p>.
+     */
+    private ArrayList<KBestHaplotype> rankedResults;
+
+    /**
+     * Priority queue with best sub-haplotype solutions that haven't been calculated and cached on {@link #rankedResults} yet.
+     */
+    private PriorityQueue<ChildKBestSubHaplotype> nextChildrenKBestHaplotypePath;
+
+    /**
+     * Creates a recursive sub-haplotype finder give the target graph, first vertex and all possible outgoing edges
+     *  with the corresponding sub-sub-haplotype finders.
+     *
+     * <p>For efficiency shake, it will not verify the content of {@code children} map; i.e. that indeed all keys
+     * are outgoing edges from {@code vertex} on {@code graph} and that the value sub-haplotype resolver have as
+     * the first vertex the adjacent vertex through that key edge.</p>
+     *
+     * @param graph the search graph.
+     * @param vertex first vertex for all sub-haplotype solutions provided by this finder
+     * @param children map from outgoing edge to the corresponding sub-sub-haplotype finder.
+     */
+    public RecursiveSubHaplotypeFinder(final SeqGraph graph, final SeqVertex vertex,
+                                       final Map<BaseEdge, KBestSubHaplotypeFinder> children) {
+        if (vertex == null) throw new IllegalArgumentException("the vertex provided cannot be null");
+        if (graph == null) throw new IllegalArgumentException("the graph provided cannot be null");
+        this.vertex = vertex;
+        this.children = children;
+        this.graph = graph;
+    }
+
+    @Override
+    public int getCount() {
+        processChildrenIfNeeded();
+        return possibleHaplotypeCount;
+    }
+
+    /**
+     * Process children and initialize structures if not done before.
+     */
+    private void processChildrenIfNeeded() {
+        if (childrenWereProcessed) return;
+        long possibleHaplotypeCount = 0;
+
+        nextChildrenKBestHaplotypePath = new PriorityQueue<>(children.size());
+
+        for (final Map.Entry<BaseEdge,KBestSubHaplotypeFinder> entry : children.entrySet()) {
+            final KBestSubHaplotypeFinder child = entry.getValue();
+            final BaseEdge edge = entry.getKey();
+            final int childPossibleHaplotypePathCount = child.getCount();
+            if (childPossibleHaplotypePathCount != 0) // paranoia check, should not happen at this point.
+                nextChildrenKBestHaplotypePath.add(new ChildKBestSubHaplotype(-1,edge,child,0));
+            possibleHaplotypeCount += childPossibleHaplotypePathCount;
+        }
+
+        // Just make sure we won't incur in overflow here for very large graphs; who is ever going to ask for more than 2G paths!!!)
+        this.possibleHaplotypeCount = (int) Math.min(Integer.MAX_VALUE,possibleHaplotypeCount);
+
+        // 10 is a bit arbitrary as it is difficult to anticipate what would be the number of requested
+        // best sub-haplotypes for any node. It shouldn't be too large so that it does not waste space
+        // but not too small so that there is no need to resize when just a few best solutions are requested.
+        rankedResults = new ArrayList<>(Math.min(this.possibleHaplotypeCount,10));
+
+        childrenWereProcessed = true;
+    }
+
+    @Override
+    public KBestHaplotype getKBest(int k) {
+        if (k < 0)
+            throw new IllegalArgumentException("the rank requested cannot be negative");
+        processChildrenIfNeeded();
+        if (k >= possibleHaplotypeCount)
+            throw new IllegalArgumentException("the rank requested cannot be equal or greater to the number of possible haplotypes");
+        if (rankedResults.size() > k)
+            return rankedResults.get(k);
+
+        rankedResults.ensureCapacity(k+1);
+        for (int i = rankedResults.size(); i <= k; i++) {
+            // since k < possibleHaplotypeCount is guarantee no to be empty.
+            if (nextChildrenKBestHaplotypePath.isEmpty())
+                throw new IllegalStateException("what the heck " + k + " " + possibleHaplotypeCount);
+            final ChildKBestSubHaplotype nextResult = nextChildrenKBestHaplotypePath.remove();
+            nextResult.rank = i;
+            rankedResults.add(nextResult);
+            final int childRank = nextResult.subpath.rank();
+            final KBestSubHaplotypeFinder child = nextResult.child;
+
+            // if there is no further solution from the same child we cannot add another solution from that child.
+            if (childRank + 1 >= nextResult.child.getCount())
+                continue;
+            nextChildrenKBestHaplotypePath.add(new ChildKBestSubHaplotype(-1,nextResult.edge, child, childRank + 1));
+        }
+        return rankedResults.get(k);
+    }
+
+    /**
+     * Custom extension of the {@link KBestHaplotype} used for solutions generated by this class.
+     */
+    private class ChildKBestSubHaplotype extends KBestHaplotype implements Comparable<ChildKBestSubHaplotype>{
+        private final int score;
+        private int rank;
+        private final KBestSubHaplotypeFinder child;
+        private final BaseEdge edge;
+        private final KBestHaplotype subpath;
+        private final boolean isReference;
+
+        public ChildKBestSubHaplotype(final int rank, final BaseEdge edge,
+                                      final KBestSubHaplotypeFinder child, final int childRank) {
+            this.child = child;
+            this.edge = edge;
+            this.rank = rank;
+            this.subpath = child.getKBest(childRank);
+            this.score = edge.getMultiplicity() + subpath.score();
+            this.isReference = edge.isRef() && subpath.isReference();
+        }
+
+        @Override
+        public SeqGraph graph() {
+            return graph;
+        }
+
+        @Override
+        public int compareTo(final ChildKBestSubHaplotype other) {
+            if (other == null) throw new IllegalArgumentException("the other object cannot be null");
+            return - Integer.compare(this.score,other.score);
+        }
+
+        @Override
+        public int score() {
+            return score;
+        }
+
+        @Override
+        public int rank() {
+            return rank;
+        }
+
+
+        @Override
+        protected SeqVertex head() {
+            return vertex;
+        }
+
+        @Override
+        protected KBestHaplotype tail() {
+            return subpath;
+        }
+
+        @Override
+        public boolean isReference() {
+            return isReference;
+        }
+    }
+}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/haplotypeBAMWriter/HaplotypeBAMWriter.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/haplotypeBAMWriter/HaplotypeBAMWriter.java
index 6d839a832..2a7ead6c2 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/haplotypeBAMWriter/HaplotypeBAMWriter.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/haplotypeBAMWriter/HaplotypeBAMWriter.java
@@ -50,16 +50,19 @@ import net.sf.samtools.Cigar;
 import net.sf.samtools.SAMFileHeader;
 import net.sf.samtools.SAMTag;
 import org.broadinstitute.sting.gatk.io.StingSAMFileWriter;
-import org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs.Path;
 import org.broadinstitute.sting.utils.GenomeLoc;
 import org.broadinstitute.sting.utils.Utils;
 import org.broadinstitute.sting.utils.genotyper.PerReadAlleleLikelihoodMap;
 import org.broadinstitute.sting.utils.haplotype.Haplotype;
 import org.broadinstitute.sting.utils.sam.AlignmentUtils;
+import org.broadinstitute.sting.utils.sam.CigarUtils;
 import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
 import org.broadinstitute.sting.utils.smithwaterman.SWPairwiseAlignment;
 
-import java.util.*;
+import java.util.Collection;
+import java.util.HashSet;
+import java.util.Map;
+import java.util.Set;
 
 /**
  * A BAMWriter that aligns reads to haplotypes and emits their best alignments to a BAM file
@@ -220,7 +223,7 @@ public abstract class HaplotypeBAMWriter {
 
         try {
             // compute the smith-waterman alignment of read -> haplotype
-            final SWPairwiseAlignment swPairwiseAlignment = new SWPairwiseAlignment(haplotype.getBases(), originalRead.getReadBases(), Path.NEW_SW_PARAMETERS);
+            final SWPairwiseAlignment swPairwiseAlignment = new SWPairwiseAlignment(haplotype.getBases(), originalRead.getReadBases(), CigarUtils.NEW_SW_PARAMETERS);
             //swPairwiseAlignment.printAlignment(haplotype.getBases(), originalRead.getReadBases());
             if ( swPairwiseAlignment.getAlignmentStart2wrt1() == -1 )
                 // sw can fail (reasons not clear) so if it happens just don't write the read
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestPathsUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestPathsUnitTest.java
index fa7ad9a3d..f117f5750 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestPathsUnitTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestPathsUnitTest.java
@@ -53,6 +53,7 @@ import net.sf.samtools.TextCigarCodec;
 import org.broadinstitute.sting.BaseTest;
 import org.broadinstitute.sting.utils.Utils;
 import org.broadinstitute.sting.utils.sam.AlignmentUtils;
+import org.broadinstitute.sting.utils.sam.CigarUtils;
 import org.testng.Assert;
 import org.testng.annotations.DataProvider;
 import org.testng.annotations.Test;
@@ -132,7 +133,7 @@ public class KBestPathsUnitTest extends BaseTest {
         Assert.assertTrue(justOne.get(0).pathsAreTheSame(best), "Best path from complete enumerate " + best + " not the same as from k = 1 search " + justOne.get(0));
     }
 
-    @Test(enabled = !DEBUG)
+    @Test(enabled = false) // No longer supported, but no longer needed.
     public void testPathFindingComplexCycle() {
         SeqGraph graph = new SeqGraph(11);
 
@@ -152,7 +153,7 @@ public class KBestPathsUnitTest extends BaseTest {
         Assert.assertEquals(paths.size(), 1, "Didn't find the expected number of paths");
     }
 
-    @Test(enabled = !DEBUG)
+    @Test(enabled = false) // No longer supported, but no longer needed.
     public void testPathFindingCycleLastNode() {
         SeqGraph graph = new SeqGraph(11);
 
@@ -539,7 +540,7 @@ public class KBestPathsUnitTest extends BaseTest {
                         String theRef = preRefString + refString + Utils.dupString(indelString1, refIndel1) + refString + Utils.dupString(indelString2, refIndel2) + refString + postRefString;
                         String theRead = refString + Utils.dupString(indelString1, refIndel1 + indelOp1 * indelSize1) + refString + Utils.dupString(indelString2, refIndel2 + indelOp2 * indelSize2) + refString;
 
-                        Cigar calculatedCigar = Path.leftAlignCigarSequentially(AlignmentUtils.consolidateCigar(givenCigar), theRef.getBytes(), theRead.getBytes(), preRefString.length(), 0);
+                        Cigar calculatedCigar = CigarUtils.leftAlignCigarSequentially(AlignmentUtils.consolidateCigar(givenCigar), theRef.getBytes(), theRead.getBytes(), preRefString.length(), 0);
                         Assert.assertEquals(AlignmentUtils.consolidateCigar(calculatedCigar).toString(), AlignmentUtils.consolidateCigar(expectedCigar).toString(), "Cigar strings do not match!");
                     }
                 }
@@ -553,7 +554,7 @@ public class KBestPathsUnitTest extends BaseTest {
         final String hap = "GTCTCTCTCTCTCTCTCTCTCTATATATATATATTT";
         final Cigar originalCigar = TextCigarCodec.getSingleton().decode("18M4I12M4D2M");
 
-        final Cigar result = Path.leftAlignCigarSequentially(originalCigar, ref.getBytes(), hap.getBytes(), 0, 0);
+        final Cigar result = CigarUtils.leftAlignCigarSequentially(originalCigar, ref.getBytes(), hap.getBytes(), 0, 0);
         logger.warn("Result is " + result);
         Assert.assertEquals(originalCigar.getReferenceLength(), result.getReferenceLength(), "Reference lengths are different");
     }
diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/sam/CigarUtils.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/sam/CigarUtils.java
index a516ec11e..70ce68a5b 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/sam/CigarUtils.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/utils/sam/CigarUtils.java
@@ -25,12 +25,17 @@
 
 package org.broadinstitute.sting.utils.sam;
 
+import com.google.java.contract.Ensures;
 import net.sf.samtools.Cigar;
 import net.sf.samtools.CigarElement;
 import net.sf.samtools.CigarOperator;
 import net.sf.samtools.TextCigarCodec;
 import org.broadinstitute.sting.utils.exceptions.ReviewedStingException;
+import org.broadinstitute.sting.utils.smithwaterman.Parameters;
+import org.broadinstitute.sting.utils.smithwaterman.SWPairwiseAlignment;
+import org.broadinstitute.sting.utils.smithwaterman.SmithWaterman;
 
+import java.util.Arrays;
 import java.util.Stack;
 
 /**
@@ -164,4 +169,104 @@ public class CigarUtils {
         }
         return result;
     }
+
+    // used in the bubble state machine to apply Smith-Waterman to the bubble sequence
+    // these values were chosen via optimization against the NA12878 knowledge base
+    public static final Parameters NEW_SW_PARAMETERS = new Parameters(20.0, -15.0, -26.0, -1.1);
+
+    private final static String SW_PAD = "NNNNNNNNNN";
+
+    /**
+     * Calculate the cigar elements for this path against the reference sequence
+     *
+     * @param refSeq the reference sequence that all of the bases in this path should align to
+     * @return a Cigar mapping this path to refSeq, or null if no reasonable alignment could be found
+     */
+    public static Cigar calculateCigar(final byte[] refSeq, final byte[] altSeq) {
+        if ( altSeq.length == 0 ) {
+            // horrible edge case from the unit tests, where this path has no bases
+            return new Cigar(Arrays.asList(new CigarElement(refSeq.length, CigarOperator.D)));
+        }
+
+        final Cigar nonStandard;
+
+        final String paddedRef = SW_PAD + new String(refSeq) + SW_PAD;
+        final String paddedPath = SW_PAD + new String(altSeq) + SW_PAD;
+        final SmithWaterman alignment = new SWPairwiseAlignment( paddedRef.getBytes(), paddedPath.getBytes(), NEW_SW_PARAMETERS );
+
+        if ( isSWFailure(alignment) )
+            return null;
+
+        // cut off the padding bases
+        final int baseStart = SW_PAD.length();
+        final int baseEnd = paddedPath.length() - SW_PAD.length() - 1; // -1 because it's inclusive
+        nonStandard = AlignmentUtils.trimCigarByBases(alignment.getCigar(), baseStart, baseEnd);
+
+        if ( nonStandard.getReferenceLength() != refSeq.length ) {
+            nonStandard.add(new CigarElement(refSeq.length - nonStandard.getReferenceLength(), CigarOperator.D));
+        }
+
+        // finally, return the cigar with all indels left aligned
+        return leftAlignCigarSequentially(nonStandard, refSeq, altSeq, 0, 0);
+    }
+
+    /**
+     * Make sure that the SW didn't fail in some terrible way, and throw exception if it did
+     */
+    private static boolean isSWFailure(final SmithWaterman alignment) {
+        // check that the alignment starts at the first base, which it should given the padding
+        if ( alignment.getAlignmentStart2wrt1() > 0 ) {
+            return true;
+//            throw new IllegalStateException("SW failure ref " + paddedRef + " vs. " + paddedPath + " should always start at 0, but got " + alignment.getAlignmentStart2wrt1() + " with cigar " + alignment.getCigar());
+        }
+
+        // check that we aren't getting any S operators (which would be very bad downstream)
+        for ( final CigarElement ce : alignment.getCigar().getCigarElements() ) {
+            if ( ce.getOperator() == CigarOperator.S )
+                return true;
+            // soft clips at the end of the alignment are really insertions
+//                throw new IllegalStateException("SW failure ref " + paddedRef + " vs. " + paddedPath + " should never contain S operators but got cigar " + alignment.getCigar());
+        }
+
+        return false;
+    }
+
+    /**
+     * Left align the given cigar sequentially. This is needed because AlignmentUtils doesn't accept cigars with more than one indel in them.
+     * This is a target of future work to incorporate and generalize into AlignmentUtils for use by others.
+     * @param cigar     the cigar to left align
+     * @param refSeq    the reference byte array
+     * @param readSeq   the read byte array
+     * @param refIndex  0-based alignment start position on ref
+     * @param readIndex 0-based alignment start position on read
+     * @return          the left-aligned cigar
+     */
+    @Ensures({"cigar != null", "refSeq != null", "readSeq != null", "refIndex >= 0", "readIndex >= 0"})
+    public static Cigar leftAlignCigarSequentially(final Cigar cigar, final byte[] refSeq, final byte[] readSeq, int refIndex, int readIndex) {
+        final Cigar cigarToReturn = new Cigar();
+        Cigar cigarToAlign = new Cigar();
+        for (int i = 0; i < cigar.numCigarElements(); i++) {
+            final CigarElement ce = cigar.getCigarElement(i);
+            if (ce.getOperator() == CigarOperator.D || ce.getOperator() == CigarOperator.I) {
+                cigarToAlign.add(ce);
+                final Cigar leftAligned = AlignmentUtils.leftAlignSingleIndel(cigarToAlign, refSeq, readSeq, refIndex, readIndex, false);
+                for ( final CigarElement toAdd : leftAligned.getCigarElements() ) { cigarToReturn.add(toAdd); }
+                refIndex += cigarToAlign.getReferenceLength();
+                readIndex += cigarToAlign.getReadLength();
+                cigarToAlign = new Cigar();
+            } else {
+                cigarToAlign.add(ce);
+            }
+        }
+        if( !cigarToAlign.isEmpty() ) {
+            for( final CigarElement toAdd : cigarToAlign.getCigarElements() ) {
+                cigarToReturn.add(toAdd);
+            }
+        }
+
+        final Cigar result = AlignmentUtils.consolidateCigar(cigarToReturn);
+        if( result.getReferenceLength() != cigar.getReferenceLength() )
+            throw new IllegalStateException("leftAlignCigarSequentially failed to produce a valid CIGAR.  Reference lengths differ.  Initial cigar " + cigar + " left aligned into " + result);
+        return result;
+    }
 }

From 69bf2b32470fc3565d89cae656f60124ffd3f766 Mon Sep 17 00:00:00 2001
From: Valentin Ruano-Rubio <valentin@broadinstitute.org>
Date: Mon, 3 Mar 2014 16:33:05 -0500
Subject: [PATCH 12/18] Added a more efficient implementation of the KBest
 haplotype finder code (CONT.)

Changes:

  1. Addressed review comments on new K-best haplotype assembly graph finder.
  2. Generalize KBestHaplotypeFinder to deal with multiple source and sink vertices.
  3. Updated test to use KBestHaplotypeFinder instead of KBestPaths
  4. Retired KBestPaths to the archive.
  5. Small improvements to the code and documentation.
---
 ...java => AggregatedSubHaplotypeFinder.java} | 275 +++++++++---------
 .../haplotypecaller/graphs/BaseGraph.java     |  17 ++
 .../DeadEndKBestSubHaplotypeFinder.java       |   4 +-
 .../graphs/EmptyPathHaplotypeFinder.java      |  28 +-
 .../graphs/KBestHaplotype.java                |  16 +-
 .../graphs/KBestHaplotypeFinder.java          | 233 +++++++++++----
 .../graphs/KBestSubHaplotypeFinder.java       |   1 -
 .../graphs/RecursiveSubHaplotypeFinder.java   | 164 +++--------
 .../readthreading/ReadThreadingAssembler.java |  15 +-
 .../graphs/CommonSuffixMergerUnitTest.java    |  19 +-
 ...java => KBestHaplotypeFinderUnitTest.java} | 161 ++++------
 .../SharedVertexSequenceSplitterUnitTest.java |  39 ++-
 .../DanglingChainMergingGraphUnitTest.java    |  10 +-
 .../ReadThreadingAssemblerUnitTest.java       |  20 +-
 .../ReadThreadingGraphUnitTest.java           |   3 +-
 .../gatk/refdata/tracks/RMDTrackBuilder.java  |   5 +-
 16 files changed, 525 insertions(+), 485 deletions(-)
 rename protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/{KBestPaths.java => AggregatedSubHaplotypeFinder.java} (59%)
 rename protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/{KBestPathsUnitTest.java => KBestHaplotypeFinderUnitTest.java} (82%)

diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestPaths.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/AggregatedSubHaplotypeFinder.java
similarity index 59%
rename from protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestPaths.java
rename to protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/AggregatedSubHaplotypeFinder.java
index 3ba85dd92..8fba6c9d5 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestPaths.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/AggregatedSubHaplotypeFinder.java
@@ -1,185 +1,194 @@
 /*
 *  By downloading the PROGRAM you agree to the following terms of use:
-*  
+*
 *  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
-*  
+*
 *  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
-*  
+*
 *  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
 *  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
 *  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
-*  
+*
 *  1. DEFINITIONS
 *  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
-*  
+*
 *  2. LICENSE
-*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
+*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM.
 *  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
 *  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
-*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
-*  
-*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
+*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.
+*
+*  3. OWNERSHIP OF INTELLECTUAL PROPERTY
 *  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
 *  Copyright 2012 Broad Institute, Inc.
 *  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
 *  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
-*  
+*
 *  4. INDEMNIFICATION
 *  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
-*  
+*
 *  5. NO REPRESENTATIONS OR WARRANTIES
 *  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
 *  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
-*  
+*
 *  6. ASSIGNMENT
 *  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
-*  
+*
 *  7. MISCELLANEOUS
 *  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
 *  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
 *  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
-*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
-*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
+*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt.
+*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter.
 *  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
 *  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
 */
-
 package org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs;
 
-import com.google.common.collect.MinMaxPriorityQueue;
-import com.google.java.contract.Ensures;
-
-import java.io.Serializable;
-import java.util.*;
+import java.util.ArrayList;
+import java.util.Collection;
+import java.util.PriorityQueue;
 
 /**
- * Class for finding the K best paths (as determined by the sum of multiplicities of the edges) in a graph.
- * This is different from most graph traversals because we want to test paths from any source node to any sink node.
+ * K-best sub-haplotype finder that selects the best solutions out of a collection of sub-haplotype finders.
  *
- * User: ebanks, rpoplin, mdepristo
- * Date: Mar 23, 2011
+ * @author Valentin Ruano-Rubio &lt;valentin@broadinstitute.org&gt;
  */
-public class KBestPaths<T extends BaseVertex, E extends BaseEdge> {
-    private final boolean allowCycles;
+class AggregatedSubHaplotypeFinder implements KBestSubHaplotypeFinder {
 
     /**
-     * Create a new KBestPaths finder that follows cycles in the graph
+     * Collection of subFinders that provided the actual solutions.
      */
-    public KBestPaths() {
-        this(true);
-    }
+    private final Collection<? extends KBestSubHaplotypeFinder> subFinders;
 
     /**
-     * Create a new KBestPaths finder
+     *  Flag indicating whether the sub-finders have been processed or not.
+     */
+    private boolean processedSubFinders = false;
+
+    /**
+     * Holds the number of k-best solution that this finder would ever return.
+     */
+    private int count = 0;
+
+    /**
+     * Holds the best {@code i} paths to the sink so far calculated where {@code i+1} is the length of this list.
      *
-     * @param allowCycles should we allow paths that follow cycles in the graph?
+     * <p>As more results are requested the array will grow. All positions and solutions are
+     * calculated up to {@code i}</p>.
      */
-    public KBestPaths(final boolean allowCycles) {
-        this.allowCycles = allowCycles;
-    }
-
-    protected static class MyInt { public int val = 0; }
+    private ArrayList<KBestHaplotype> rankedSubHaplotype;
 
     /**
-     * Compare paths such that paths with greater weight are earlier in a list
+     * Priority queue with next best haplotype solution from each sub-finder; previous ones are
+     * already part {@link #rankedSubHaplotype}.
      */
-    protected static class PathComparatorTotalScore implements Comparator<Path>, Serializable {
+    private PriorityQueue<MyKBestHaplotypeResult> nextBestSubHaplotypes;
+
+    /**
+     * Creates a new aggregated sub-haplotype finder given its sub-finders.
+     * @param finders set of sub-finders.
+     */
+    public AggregatedSubHaplotypeFinder(final Collection<? extends KBestSubHaplotypeFinder> finders) {
+        if (finders == null) throw new IllegalArgumentException("finder collection cannot be null");
+        this.subFinders = finders;
+    }
+
+    @Override
+    public int getCount() {
+        processSubFindersIfNeeded();
+        return count;
+    }
+
+    private void processSubFindersIfNeeded() {
+        if (processedSubFinders) return;
+
+        long count = 0;
+        nextBestSubHaplotypes = new PriorityQueue<>(subFinders.size());
+        for (final KBestSubHaplotypeFinder finder : subFinders) {
+            final int finderCount = finder.getCount();
+            if (finderCount == 0) continue;
+            count += finderCount;
+            nextBestSubHaplotypes.add(new MyKBestHaplotypeResult(finder,0));
+        }
+
+        this.count = (int) Math.min(Integer.MAX_VALUE,count);
+
+        rankedSubHaplotype = new ArrayList<>(10);
+        processedSubFinders = true;
+    }
+
+    @Override
+    public KBestHaplotype getKBest(int k) {
+        if (k < 0) throw new IllegalArgumentException("k cannot be negative");
+        processSubFindersIfNeeded();
+        if (k >= count) throw new IllegalArgumentException("k cannot be equal or greater than the count");
+        if (k < rankedSubHaplotype.size())
+            return rankedSubHaplotype.get(k);
+
+        rankedSubHaplotype.ensureCapacity(k+1);
+        for (int i = rankedSubHaplotype.size(); i <= k; i++) {
+            // since k < possibleHaplotypeCount is guarantee no to be empty.
+            if (nextBestSubHaplotypes.isEmpty())
+                throw new IllegalStateException("what the heck " + k + " " + count);
+            final MyKBestHaplotypeResult nextResult = nextBestSubHaplotypes.remove();
+            nextResult.rank = i;
+            rankedSubHaplotype.add(nextResult);
+            final int subRank = nextResult.result.rank();
+
+            // if there is no further solution from the same child we cannot add another solution from that child.
+            if (subRank + 1 >= nextResult.subFinder.getCount())
+                continue;
+            nextBestSubHaplotypes.add(new MyKBestHaplotypeResult(nextResult.subFinder, subRank + 1));
+        }
+        return rankedSubHaplotype.get(k);
+    }
+
+    /**
+     * Custom implementation of {@link KBestHaplotype} to encapsulate sub-finder results.
+     */
+    private class MyKBestHaplotypeResult extends KBestHaplotype {
+
+        private KBestSubHaplotypeFinder subFinder;
+
+        private final KBestHaplotype result;
+
+        private int rank;
+
+        private MyKBestHaplotypeResult(final KBestSubHaplotypeFinder finder, final int rank) {
+            this.subFinder = finder;
+            this.result = finder.getKBest(rank);
+            this.rank = -1;
+        }
+
         @Override
-        public int compare(final Path path1, final Path path2) {
-            return path2.getScore() - path1.getScore();
-        }
-    }
-
-    /**
-     * @see #getKBestPaths(BaseGraph, int) retriving the best 1000 paths
-     */
-    public List<Path<T,E>> getKBestPaths( final BaseGraph<T, E> graph ) {
-        return getKBestPaths(graph, 1000);
-    }
-
-    /**
-     * @see #getKBestPaths(BaseGraph, int, java.util.Set, java.util.Set) retriving the first 1000 paths
-     * starting from all source vertices and ending with all sink vertices
-     */
-    public List<Path<T,E>> getKBestPaths( final BaseGraph<T,E> graph, final int k ) {
-        return getKBestPaths(graph, k, graph.getSources(), graph.getSinks());
-    }
-
-    /**
-     * @see #getKBestPaths(BaseGraph, int, java.util.Set, java.util.Set) with k=1000
-     */
-    public List<Path<T,E>> getKBestPaths( final BaseGraph<T,E> graph, final Set<T> sources, final Set<T> sinks ) {
-        return getKBestPaths(graph, 1000, sources, sinks);
-    }
-
-    /**
-     * @see #getKBestPaths(BaseGraph, int, java.util.Set, java.util.Set) with k=1000
-     */
-    public List<Path<T,E>> getKBestPaths( final BaseGraph<T,E> graph, final T source, final T sink ) {
-        return getKBestPaths(graph, 1000, source, sink);
-    }
-
-    /**
-     * @see #getKBestPaths(BaseGraph, int, java.util.Set, java.util.Set) with singleton source and sink sets
-     */
-    public List<Path<T,E>> getKBestPaths( final BaseGraph<T,E> graph, final int k, final T source, final T sink ) {
-        return getKBestPaths(graph, k, Collections.singleton(source), Collections.singleton(sink));
-    }
-
-        /**
-         * Traverse the graph and pull out the best k paths.
-         * Paths are scored via their comparator function. The default being PathComparatorTotalScore()
-         * @param graph the graph from which to pull paths
-         * @param k     the number of paths to find
-         * @param sources a set of vertices we want to start paths with
-         * @param sinks   a set of vertices we want to end paths with
-         * @return      a list with at most k top-scoring paths from the graph
-         */
-    @Ensures({"result != null", "result.size() <= k"})
-    public List<Path<T,E>> getKBestPaths( final BaseGraph<T,E> graph, final int k, final Set<T> sources, final Set<T> sinks ) {
-        if( graph == null ) { throw  new IllegalArgumentException("Attempting to traverse a null graph."); }
-
-        // a min max queue that will collect the best k paths
-        final MinMaxPriorityQueue<Path<T,E>> bestPaths = MinMaxPriorityQueue.orderedBy(new PathComparatorTotalScore()).maximumSize(k).create();
-
-        // run a DFS for best paths
-        for ( final T source : sources ) {
-            final Path<T,E> startingPath = new Path<T,E>(source, graph);
-            findBestPaths(startingPath, sinks, bestPaths, new MyInt());
+        public SeqGraph graph() {
+            return result.graph();
         }
 
-        // the MinMaxPriorityQueue iterator returns items in an arbitrary order, so we need to sort the final result
-        final List<Path<T,E>> toReturn = new ArrayList<Path<T,E>>(bestPaths);
-        Collections.sort(toReturn, new PathComparatorTotalScore());
-        return toReturn;
-    }
+        @Override
+        public int score() {
+            return result.score();
+        }
 
-    /**
-     * Recursive algorithm to find the K best paths in the graph from the current path to any of the sinks
-     * @param path the current path progress
-     * @param sinks a set of nodes that are sinks.  Will terminate and add a path if the last vertex of path is in this set
-     * @param bestPaths a path to collect completed paths.
-     * @param n used to limit the search by tracking the number of vertices visited across all paths
-     */
-    private void findBestPaths( final Path<T,E> path, final Set<T> sinks, final Collection<Path<T,E>> bestPaths, final MyInt n ) {
-        if ( sinks.contains(path.getLastVertex())) {
-            bestPaths.add(path);
-        } else if( n.val > 10000 ) {
-            // do nothing, just return, as we've done too much work already
-        } else {
-            // recursively run DFS
-            final ArrayList<E> edgeArrayList = new ArrayList<E>(path.getOutgoingEdgesOfLastVertex());
-            Collections.sort(edgeArrayList, new BaseEdge.EdgeWeightComparator());
-            for ( final E edge : edgeArrayList ) {
-                final T target = path.getGraph().getEdgeTarget(edge);
-                // make sure the edge is not already in the path
-                final boolean alreadyVisited = allowCycles ? path.containsEdge(edge) : path.containsVertex(target);
-                if ( ! alreadyVisited ) {
-                    final Path<T,E> newPath = new Path<T,E>(path, edge);
-                    n.val++;
-                    findBestPaths(newPath, sinks, bestPaths, n);
-                }
-            }
+        @Override
+        public boolean isReference() {
+            return result.isReference();
+        }
+
+        @Override
+        public int rank() {
+            return rank;
+        }
+
+        @Override
+        protected SeqVertex head() {
+            return result.head();
+        }
+
+        @Override
+        protected KBestHaplotype tail() {
+            return result.tail();
         }
     }
-}
\ No newline at end of file
+}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/BaseGraph.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/BaseGraph.java
index c9d51b81b..36216bdd2 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/BaseGraph.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/BaseGraph.java
@@ -695,4 +695,21 @@ public class BaseGraph<V extends BaseVertex, E extends BaseEdge> extends Default
     public BaseGraph<V,E> subsetToRefSource() {
         return subsetToNeighbors(getReferenceSourceVertex(), 10);
     }
+
+    /**
+     * Checks whether the graph contains all the vertices in a collection.
+     *
+     * @param vertices the vertices to check.
+     *
+     * @throws IllegalArgumentException if {@code vertices} is {@code null}.
+     *
+     * @return {@code true} if all the vertices in the input collection are present in this graph.
+     * Also if the input collection is empty. Otherwise it returns {@code false}.
+     */
+    public boolean containsAllVertices(final Collection<? extends V> vertices) {
+        if (vertices == null) throw new IllegalArgumentException("the input vertices collection cannot be null");
+        for (final V vertex : vertices)
+            if (!containsVertex(vertex)) return false;
+        return true;
+    }
 }
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/DeadEndKBestSubHaplotypeFinder.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/DeadEndKBestSubHaplotypeFinder.java
index 0a29bd08b..ae270ed7b 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/DeadEndKBestSubHaplotypeFinder.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/DeadEndKBestSubHaplotypeFinder.java
@@ -46,9 +46,9 @@
 package org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs;
 
 /**
- * Represent a trivial k-best sub haplotype finder with no solutions.
+ * Represents a trivial k-best sub haplotype finder with no solutions.
  *
- * <p>To be used at vertices that do not have any valid path to the requested sink node</p>
+ * <p>To be used at vertices that do not have any valid path to the requested sink vertices</p>
  *
  * @author Valentin Ruano-Rubio &lt;valentin@broadinstitute.org&gt;
  */
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/EmptyPathHaplotypeFinder.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/EmptyPathHaplotypeFinder.java
index aa1f213fe..0e50ec02b 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/EmptyPathHaplotypeFinder.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/EmptyPathHaplotypeFinder.java
@@ -52,14 +52,19 @@ package org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs;
  */
 class EmptyPathHaplotypeFinderNode implements KBestSubHaplotypeFinder {
 
-
     /**
      * Caches the only solution returned by this finder.
      */
     private final KBestHaplotype singleHaplotypePath;
 
-    public EmptyPathHaplotypeFinderNode(final SeqGraph graph, final SeqVertex sink) {
-        singleHaplotypePath = new MyBestHaplotypePath(graph,sink);
+    /**
+     * Constructs a new empty k-best haplotype finder.
+     *
+     * @param graph the search graph.
+     * @param vertex the source and sink vertex of the only solution returned by this finder.
+     */
+    public EmptyPathHaplotypeFinderNode(final SeqGraph graph, final SeqVertex vertex) {
+        singleHaplotypePath = new MyBestHaplotypePath(graph,vertex);
     }
 
     @Override
@@ -81,12 +86,29 @@ class EmptyPathHaplotypeFinderNode implements KBestSubHaplotypeFinder {
      */
     private class MyBestHaplotypePath extends KBestHaplotype {
 
+        /**
+         * The solution's only vertex.
+         */
         private final SeqVertex vertex;
 
+        /**
+         * The search graph.
+         */
         private final SeqGraph graph;
 
+        /**
+         * Whether the vertex is a reference vertex.
+         *
+         * <p>Initialize lazily.</p>
+         */
         private Boolean isReference;
 
+        /**
+         * Constructs a new empty k-best haplotype solution.
+         *
+         * @param graph the search graph.
+         * @param vertex the source and sink vertex of the only solution returned by the outer finder.
+         */
         public MyBestHaplotypePath(final SeqGraph graph, final SeqVertex vertex) {
             this.vertex = vertex;
             this.graph = graph;
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotype.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotype.java
index d88c17cbf..ca22f17ec 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotype.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotype.java
@@ -52,7 +52,7 @@ import org.broadinstitute.sting.utils.haplotype.Haplotype;
  *
  * @author Valentin Ruano-Rubio &lt;valentin@broadinstitute.org&gt;
  */
-public abstract class KBestHaplotype {
+public abstract class KBestHaplotype implements Comparable<KBestHaplotype> {
 
     /**
      * Returns the original graph searched.
@@ -143,6 +143,18 @@ public abstract class KBestHaplotype {
         return path;
     }
 
+    /**
+     * Compares k-best haplotypes based on the score where the one with larger score comes first (descending orther).
+     *
+     * @param other the other haplotype to compare to.
+     * @return {@code -1} if the current score is larger than {@code other}'s, {@code 0} if they are the same, {@code 1}
+     * if {@code other}'s score is larger.
+     */
+    public int compareTo(final KBestHaplotype other) {
+        if (other == null) throw new IllegalArgumentException("the other object cannot be null");
+        return - 1 * (score() - other.score());
+    }
+
     /**
      * The first vertex on the haplotype path.
      *
@@ -156,6 +168,4 @@ public abstract class KBestHaplotype {
      * @return {@code null} if there are no more vertices in the solution path a part from the one returned by {@link #head}.
      */
     protected abstract KBestHaplotype tail();
-
-
 }
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotypeFinder.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotypeFinder.java
index 725fcae1a..f27cca12c 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotypeFinder.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotypeFinder.java
@@ -56,49 +56,131 @@ import java.util.*;
  */
 public class KBestHaplotypeFinder extends AbstractList<KBestHaplotype> implements Iterable<KBestHaplotype>  {
 
-
+    /**
+     * The search graph.
+     */
     private final SeqGraph graph;
-    protected Map<SeqVertex,KBestSubHaplotypeFinder> nodeBySource;
 
-    protected SeqVertex sink;
-    protected SeqVertex source;
+    /**
+     * Map of sub-haplotype finder by their source vertex.
+     */
+    protected Map<SeqVertex,KBestSubHaplotypeFinder> finderByVertex;
+
+    /**
+     * Possible haplotype sink vertices.
+     */
+    protected Set<SeqVertex> sinks;
+
+    /**
+     * Possible haplotype source vertices.
+     */
+    protected Set<SeqVertex> sources;
+
+    /**
+     * The top finder.
+     *
+     * <p>If there is only a single source vertex, its finder is the top finder. However whent there
+     * is more than one possible source, we create a composite finder that alternates between individual source vertices
+     * for their best haplotypes.</p>
+     */
+    private final KBestSubHaplotypeFinder topFinder;
 
     /**
      * Constructs a new best haplotypes finder.
      *
      * @param graph the seq-graph to search.
      * @param source the source vertex for all haplotypes.
-     * @param sink the sink vertex for all haplotypes.
+     * @param sink sink vertices for all haplotypes.
      *
      * @throws IllegalArgumentException if <ul>
      *     <li>any of {@code graph}, {@code source} or {@code sink} is {@code null} or</li>
-     *     <li>either {@code source} or {@code sink} is not a vertex of {@code graph}'s.</li>
+     *     <li>either {@code source} or {@code sink} is not a vertex in {@code graph}.</li>
      * </ul>
      */
     public KBestHaplotypeFinder(final SeqGraph graph, final SeqVertex source, final SeqVertex sink) {
-        if (graph == null) throw new IllegalArgumentException("graph cannot be null");
-        if (source == null) throw new IllegalArgumentException("source cannot be null");
-        if (sink == null) throw new IllegalArgumentException("sink cannot be null");
-        if (!graph.containsVertex(source)) throw new IllegalArgumentException("source does not belong to the graph");
-        if (!graph.containsVertex(sink)) throw new IllegalArgumentException("sink does not belong to the graph");
-        //TODO dealing with cycles here due to a bug in some of the graph transformations that produces cycles.
-        //TODO Once that is solve, the conditional above should be removed in order the save time:
-        //this.graph = graph;
-        if (new CycleDetector<>(graph).detectCycles())
-            this.graph = removeCycles(graph,source,sink);
-        else
-            this.graph = graph;
-        nodeBySource = new HashMap<>(graph.vertexSet().size());
-        this.sink = sink;
-        this.source = source;
+        this(graph,Collections.singleton(source),Collections.singleton(sink));
     }
 
-    private static SeqGraph removeCycles(final SeqGraph original, final SeqVertex source, final SeqVertex sink) {
+    /**
+     * Constructs a new best haplotypes finder.
+     *
+     * @param graph the seq-graph to search.
+     * @param sources source vertices for all haplotypes.
+     * @param sinks sink vertices for all haplotypes.
+     *
+     * @throws IllegalArgumentException if <ul>
+     *     <li>any of {@code graph}, {@code sources} or {@code sinks} is {@code null} or</li>
+     *     <li>any of {@code sources}' or any {@code sinks}' member is not a vertex in {@code graph}.</li>
+     * </ul>
+     */
+    public KBestHaplotypeFinder(final SeqGraph graph, final Set<SeqVertex> sources, final Set<SeqVertex> sinks) {
+        if (graph == null) throw new IllegalArgumentException("graph cannot be null");
+        if (sources == null) throw new IllegalArgumentException("source cannot be null");
+        if (sinks == null) throw new IllegalArgumentException("sink cannot be null");
+        if (!graph.containsAllVertices(sources)) throw new IllegalArgumentException("source does not belong to the graph");
+        if (!graph.containsAllVertices(sinks)) throw new IllegalArgumentException("sink does not belong to the graph");
+
+        //TODO dealing with cycles here due to a bug in some of the graph transformations that produces cycles.
+        //TODO Once that is solve, the if-else below should be substituted by a throw if there is any cycles,
+        //TODO just the line commented out below if you want to trade early-bug-fail for speed.
+        //this.graph = graph;
+        this.graph = new CycleDetector<>(graph).detectCycles() ? removeCycles(graph,sources,sinks) : graph;
+
+        finderByVertex = new HashMap<>(this.graph.vertexSet().size());
+        this.sinks = sinks;
+        this.sources = sources;
+        if (sinks.size() == 0 || sources.size() == 0)
+            topFinder = DeadEndKBestSubHaplotypeFinder.INSTANCE;
+        else if (sources.size() == 1)
+            topFinder = createVertexFinder(sources.iterator().next());
+        else
+            topFinder = createAggregatedFinder();
+    }
+
+    /**
+     * Constructs a new best haplotype finder.
+     * <p>
+     *     It will consider all source and sink vertex when looking for haplotypes.
+     * </p>
+     *
+     * @param graph the seq-graph to search for the best haplotypes.
+     */
+    public KBestHaplotypeFinder(SeqGraph graph) {
+        this(graph,graph.getSources(),graph.getSinks());
+    }
+
+    /**
+     * Creates an aggregated recursive finder to try all possible source vertices.
+     *
+     * @return never {@code null}.
+     */
+    private KBestSubHaplotypeFinder createAggregatedFinder() {
+        final List<KBestSubHaplotypeFinder> sourceFinders = new ArrayList<>(sources.size());
+        for (final SeqVertex source : sources)
+            sourceFinders.add(createVertexFinder(source));
+        return new AggregatedSubHaplotypeFinder(sourceFinders);
+    }
+
+    /**
+     * Removes edges that produces cycles and also dead vertices that do not lead to any sink vertex.
+     *
+     * @param original graph to modify.
+     * @param sources considered source vertices.
+     * @param sinks considered sink vertices.
+     * @return never {@code null}.
+     */
+    private static SeqGraph removeCycles(final SeqGraph original, final Set<SeqVertex> sources, final Set<SeqVertex> sinks) {
         final Set<BaseEdge> edgesToRemove = new HashSet<>(original.edgeSet().size());
         final Set<SeqVertex> vertexToRemove = new HashSet<>(original.vertexSet().size());
 
-        if (!findGuiltyVerticesAndEdgesToRemoveCycles(original, source, sink, edgesToRemove, vertexToRemove, new HashSet<SeqVertex>(original.vertexSet().size())))
-            throw new IllegalStateException("could not find any path from the source vertex to the sink vertex: " + source + " -> " + sink);
+        boolean foundSomePath = false;
+        for (final SeqVertex source : sources)
+            foundSomePath = findGuiltyVerticesAndEdgesToRemoveCycles(original, source, sinks, edgesToRemove,
+                    vertexToRemove, new HashSet<SeqVertex>(original.vertexSet().size())) | foundSomePath;
+
+        if (!foundSomePath)
+            throw new IllegalStateException("could not find any path from the source vertex to the sink vertex after removing cycles: "
+                    + Arrays.toString(sources.toArray()) + " => " + Arrays.toString(sinks.toArray()));
 
         if (edgesToRemove.isEmpty() && vertexToRemove.isEmpty())
             throw new IllegalStateException("cannot find a way to remove the cycles");
@@ -109,13 +191,30 @@ public class KBestHaplotypeFinder extends AbstractList<KBestHaplotype> implement
         return result;
     }
 
-    private static boolean findGuiltyVerticesAndEdgesToRemoveCycles(final SeqGraph graph, final SeqVertex currentVertex, final SeqVertex sink,
-                                                                    final Set<BaseEdge> edgesToRemove, final Set<SeqVertex> verticesToRemove,
+    /**
+     * Recursive call that looks for edges and vertices that need to be removed to get rid of cycles.
+     *
+     * @param graph the original graph.
+     * @param currentVertex current search vertex.
+     * @param sinks considered sink vertices.
+     * @param edgesToRemove collection  of edges that need to be removed in order to get rid of cycles.
+     * @param verticesToRemove collection of vertices that can be removed.
+     * @param parentVertices collection of vertices that preceded the {@code currentVertex}; i.e. the it can be
+     *                       reached from those vertices using edges existing in {@code graph}.
+     *
+     * @return {@code true} to indicate that the some sink vertex is reachable by {@code currentVertex},
+     *  {@code false} otherwise.
+     */
+    private static boolean findGuiltyVerticesAndEdgesToRemoveCycles(final SeqGraph graph,
+                                                                    final SeqVertex currentVertex,
+                                                                    final Set<SeqVertex> sinks,
+                                                                    final Set<BaseEdge> edgesToRemove,
+                                                                    final Set<SeqVertex> verticesToRemove,
                                                                     final Set<SeqVertex> parentVertices) {
-        if (currentVertex.equals(sink)) return true;
+        if (sinks.contains(currentVertex)) return true;
 
         final Set<BaseEdge> outgoingEdges = graph.outgoingEdgesOf(currentVertex);
-        boolean reachsSink = false;
+        boolean reachesSink = false;
         parentVertices.add(currentVertex);
 
         for (final BaseEdge edge : outgoingEdges) {
@@ -123,31 +222,28 @@ public class KBestHaplotypeFinder extends AbstractList<KBestHaplotype> implement
             if (parentVertices.contains(child))
                 edgesToRemove.add(edge);
             else {
-              final boolean childReachSink = findGuiltyVerticesAndEdgesToRemoveCycles(graph, child, sink, edgesToRemove, verticesToRemove, parentVertices);
-              reachsSink = reachsSink || childReachSink;
+              final boolean childReachSink = findGuiltyVerticesAndEdgesToRemoveCycles(graph, child, sinks,
+                      edgesToRemove, verticesToRemove, parentVertices);
+              reachesSink = reachesSink || childReachSink;
             }
         }
         parentVertices.remove(currentVertex);
-        if (!reachsSink) verticesToRemove.add(currentVertex);
-        return reachsSink;
+        if (!reachesSink) verticesToRemove.add(currentVertex);
+        return reachesSink;
     }
 
-
     @Override
     public KBestHaplotype get(int index) {
-        final KBestSubHaplotypeFinder sourceNode = createNode(source);
         if (index < 0 || index >= size())
             throw new IndexOutOfBoundsException();
-        return sourceNode.getKBest(index);
+        return topFinder.getKBest(index);
     }
 
     @Override
     public Iterator<KBestHaplotype> iterator() {
-        final KBestSubHaplotypeFinder sourceFinder = createNode(source);
-
         return new Iterator<KBestHaplotype>() {
             private int nextK = 0;
-            private final int maxK = sourceFinder.getCount();
+            private final int maxK = topFinder.getCount();
 
 
             @Override
@@ -158,7 +254,7 @@ public class KBestHaplotypeFinder extends AbstractList<KBestHaplotype> implement
             @Override
             public KBestHaplotype next() {
                 if (nextK >= maxK) throw new NoSuchElementException();
-                return sourceFinder.getKBest(nextK++);
+                return topFinder.getKBest(nextK++);
             }
 
             @Override
@@ -170,7 +266,7 @@ public class KBestHaplotypeFinder extends AbstractList<KBestHaplotype> implement
 
     @Override
     public int size() {
-        return createNode(source).getCount();
+        return topFinder.getCount();
     }
 
     /**
@@ -183,12 +279,10 @@ public class KBestHaplotypeFinder extends AbstractList<KBestHaplotype> implement
      * @return never {@code null}, but perhaps a iterator that return no haplotype.
      */
     public Iterator<KBestHaplotype> iterator(final int k) {
-        final KBestSubHaplotypeFinder sourceFinder = createNode(source);
 
         return new Iterator<KBestHaplotype>() {
             private int nextK = 0;
-            private final int maxK = Math.min(sourceFinder.getCount(), k);
-
+            private final int maxK = Math.min(size(), k);
 
             @Override
             public boolean hasNext() {
@@ -198,7 +292,7 @@ public class KBestHaplotypeFinder extends AbstractList<KBestHaplotype> implement
             @Override
             public KBestHaplotype next() {
                 if (nextK >= maxK) throw new NoSuchElementException();
-                return sourceFinder.getKBest(nextK++);
+                return topFinder.getKBest(nextK++);
             }
 
             @Override
@@ -208,38 +302,51 @@ public class KBestHaplotypeFinder extends AbstractList<KBestHaplotype> implement
         };
     }
 
-    protected KBestSubHaplotypeFinder createNode(final SeqVertex source) {
-        KBestSubHaplotypeFinder node = nodeBySource.get(source);
+    /**
+     * Creates a finder from a vertex.
+     *
+     * @param source the source vertex for the finder.
+     *
+     * @return never {@code null}, perhaps a finder that returns no haplotypes though.
+     */
+    protected KBestSubHaplotypeFinder createVertexFinder(final SeqVertex source) {
+        KBestSubHaplotypeFinder node = finderByVertex.get(source);
         if (node == null) {
-            if (source.equals(sink))
-                node = new EmptyPathHaplotypeFinderNode(graph,sink);
+            if (sinks.contains(source))
+                node = new EmptyPathHaplotypeFinderNode(graph,source);
             else {
                 final Set<BaseEdge> outgoingEdges = graph.outgoingEdgesOf(source);
                 if (outgoingEdges.isEmpty())
                     node = DeadEndKBestSubHaplotypeFinder.INSTANCE;
                 else {
-                    final Map<BaseEdge,KBestSubHaplotypeFinder> undeadChildren = createChildrenNodes(outgoingEdges);
-                    if (undeadChildren.isEmpty())
-                        node = DeadEndKBestSubHaplotypeFinder.INSTANCE;
-                    else
-                        node = new RecursiveSubHaplotypeFinder(graph,source,undeadChildren);
-
+                    final Map<BaseEdge,KBestSubHaplotypeFinder> undeadChildren = createChildrenFinders(outgoingEdges);
+                    node = undeadChildren.isEmpty() ? DeadEndKBestSubHaplotypeFinder.INSTANCE :
+                            new RecursiveSubHaplotypeFinder(source,undeadChildren);
                 }
             }
-            nodeBySource.put(source,node);
+            finderByVertex.put(source, node);
         }
         return node;
     }
 
-    private Map<BaseEdge, KBestSubHaplotypeFinder> createChildrenNodes(Set<BaseEdge> baseEdges) {
+    /**
+     * Creates finder for target vertices of a collection of edges.
+     * <p>
+     *     This peculiar signature is convenient for when we want to create finders for the children of a vertex.
+     * </p>
+     *
+     * @param baseEdges target collection of edges.
+     *
+     * @return never {@code null}, perhaps an empty map if there is no children with valid paths to any sink for this
+     *  finder.
+     */
+    private Map<BaseEdge, KBestSubHaplotypeFinder> createChildrenFinders(Set<BaseEdge> baseEdges) {
         final Map<BaseEdge,KBestSubHaplotypeFinder> result = new LinkedHashMap<>(baseEdges.size());
-        for (final BaseEdge edge : baseEdges)
-            result.put(edge,createNode(graph.getEdgeTarget(edge)));
-        final Iterator<Map.Entry<BaseEdge,KBestSubHaplotypeFinder>> childrenIterator = result.entrySet().iterator();
-        while (childrenIterator.hasNext())
-            if (childrenIterator.next().getValue().getCount() == 0)
-                childrenIterator.remove();
+        for (final BaseEdge edge : baseEdges) {
+            final KBestSubHaplotypeFinder targetFinder = createVertexFinder(graph.getEdgeTarget(edge));
+            if (targetFinder.getCount() == 0) continue;
+            result.put(edge, targetFinder);
+        }
         return result;
     }
-
 }
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestSubHaplotypeFinder.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestSubHaplotypeFinder.java
index a637ff2b6..9c185b52c 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestSubHaplotypeFinder.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestSubHaplotypeFinder.java
@@ -68,5 +68,4 @@ interface KBestSubHaplotypeFinder {
      * @return never {@code null}.
      */
     public abstract KBestHaplotype getKBest(int k);
-
 }
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/RecursiveSubHaplotypeFinder.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/RecursiveSubHaplotypeFinder.java
index f2106ffb9..0fbbfdc64 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/RecursiveSubHaplotypeFinder.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/RecursiveSubHaplotypeFinder.java
@@ -46,18 +46,18 @@
 package org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs;
 
 import java.util.ArrayList;
+import java.util.Collection;
 import java.util.Map;
-import java.util.PriorityQueue;
 
 /**
 * General recursive sub-haplotype finder.
 * <p>
-*   Provides the k-best sub-haplotypes looking into the outgoing set of vertices (that contain at least one solution).
+*   Provides the k-best sub-haplotypes from a vertex provided map between outgoing edges and its target finders
 * </p>
 * <p>
-*  This is done efficiently by keeping an priority-queue on best subhaplotype solutions and pulling them on demand
+*  This is done efficiently by keeping an priority-queue on best sub-haplotype solutions and pulling them on demand
 *  as needed.
-*  </p>
+* </p>
 * <p>
 *  Solutions are cached for repeated retrieval so that we save compute at vertices that share sub-haplotypes
 *     (share descendant vertices). This aspect is controlled by {@link KBestSubHaplotypeFinder} that instantiate
@@ -67,34 +67,7 @@ import java.util.PriorityQueue;
 *
 * @author Valentin Ruano-Rubio &lt;valentin@broadinstitute.org&gt;
 */
-class RecursiveSubHaplotypeFinder implements KBestSubHaplotypeFinder {
-
-    private final SeqGraph graph;
-
-    private final SeqVertex vertex;
-
-    private final Map<BaseEdge,KBestSubHaplotypeFinder> children;
-
-    private boolean childrenWereProcessed = false;
-
-    /**
-     * Holds the number of possible paths from this source node vertex to the sink vertex.
-     *
-     * <p>Updated by {@link #processChildrenIfNeeded()}</p>
-     */
-    private int possibleHaplotypeCount;
-
-    /**
-     * Holds the best {@code i} paths to the sink so far calculated where {@code i+1} is the length of rankedResults.
-     *
-     * <p>As more results are requested the array will grow. All positions and solutions are calculated up to {@code i}</p>.
-     */
-    private ArrayList<KBestHaplotype> rankedResults;
-
-    /**
-     * Priority queue with best sub-haplotype solutions that haven't been calculated and cached on {@link #rankedResults} yet.
-     */
-    private PriorityQueue<ChildKBestSubHaplotype> nextChildrenKBestHaplotypePath;
+class RecursiveSubHaplotypeFinder extends AggregatedSubHaplotypeFinder {
 
     /**
      * Creates a recursive sub-haplotype finder give the target graph, first vertex and all possible outgoing edges
@@ -104,113 +77,73 @@ class RecursiveSubHaplotypeFinder implements KBestSubHaplotypeFinder {
      * are outgoing edges from {@code vertex} on {@code graph} and that the value sub-haplotype resolver have as
      * the first vertex the adjacent vertex through that key edge.</p>
      *
-     * @param graph the search graph.
      * @param vertex first vertex for all sub-haplotype solutions provided by this finder
      * @param children map from outgoing edge to the corresponding sub-sub-haplotype finder.
      */
-    public RecursiveSubHaplotypeFinder(final SeqGraph graph, final SeqVertex vertex,
+    public RecursiveSubHaplotypeFinder(final SeqVertex vertex,
                                        final Map<BaseEdge, KBestSubHaplotypeFinder> children) {
-        if (vertex == null) throw new IllegalArgumentException("the vertex provided cannot be null");
-        if (graph == null) throw new IllegalArgumentException("the graph provided cannot be null");
-        this.vertex = vertex;
-        this.children = children;
-        this.graph = graph;
+        super(createChildFinderCollection(vertex, children));
     }
 
-    @Override
-    public int getCount() {
-        processChildrenIfNeeded();
-        return possibleHaplotypeCount;
+    private static Collection<EdgeSubHaplotypeFinder> createChildFinderCollection(final SeqVertex vertex, final Map<BaseEdge,KBestSubHaplotypeFinder> finders) {
+        if (finders == null) throw new IllegalArgumentException("the edge to child map cannot be null");
+        final Collection<EdgeSubHaplotypeFinder> result = new ArrayList<>(finders.size());
+        for (final Map.Entry<BaseEdge,KBestSubHaplotypeFinder> e : finders.entrySet())
+            result.add(new EdgeSubHaplotypeFinder(vertex,e.getKey(), e.getValue()));
+        return result;
     }
 
-    /**
-     * Process children and initialize structures if not done before.
-     */
-    private void processChildrenIfNeeded() {
-        if (childrenWereProcessed) return;
-        long possibleHaplotypeCount = 0;
+    private static class EdgeSubHaplotypeFinder implements KBestSubHaplotypeFinder {
 
-        nextChildrenKBestHaplotypePath = new PriorityQueue<>(children.size());
+        private final KBestSubHaplotypeFinder childFinder;
 
-        for (final Map.Entry<BaseEdge,KBestSubHaplotypeFinder> entry : children.entrySet()) {
-            final KBestSubHaplotypeFinder child = entry.getValue();
-            final BaseEdge edge = entry.getKey();
-            final int childPossibleHaplotypePathCount = child.getCount();
-            if (childPossibleHaplotypePathCount != 0) // paranoia check, should not happen at this point.
-                nextChildrenKBestHaplotypePath.add(new ChildKBestSubHaplotype(-1,edge,child,0));
-            possibleHaplotypeCount += childPossibleHaplotypePathCount;
+        private final SeqVertex vertex;
+
+        private final BaseEdge edge;
+
+        private EdgeSubHaplotypeFinder(final SeqVertex vertex, final BaseEdge edge, final KBestSubHaplotypeFinder childFinder) {
+            this.childFinder = childFinder;
+            this.edge = edge;
+            this.vertex = vertex;
         }
 
-        // Just make sure we won't incur in overflow here for very large graphs; who is ever going to ask for more than 2G paths!!!)
-        this.possibleHaplotypeCount = (int) Math.min(Integer.MAX_VALUE,possibleHaplotypeCount);
-
-        // 10 is a bit arbitrary as it is difficult to anticipate what would be the number of requested
-        // best sub-haplotypes for any node. It shouldn't be too large so that it does not waste space
-        // but not too small so that there is no need to resize when just a few best solutions are requested.
-        rankedResults = new ArrayList<>(Math.min(this.possibleHaplotypeCount,10));
-
-        childrenWereProcessed = true;
-    }
-
-    @Override
-    public KBestHaplotype getKBest(int k) {
-        if (k < 0)
-            throw new IllegalArgumentException("the rank requested cannot be negative");
-        processChildrenIfNeeded();
-        if (k >= possibleHaplotypeCount)
-            throw new IllegalArgumentException("the rank requested cannot be equal or greater to the number of possible haplotypes");
-        if (rankedResults.size() > k)
-            return rankedResults.get(k);
-
-        rankedResults.ensureCapacity(k+1);
-        for (int i = rankedResults.size(); i <= k; i++) {
-            // since k < possibleHaplotypeCount is guarantee no to be empty.
-            if (nextChildrenKBestHaplotypePath.isEmpty())
-                throw new IllegalStateException("what the heck " + k + " " + possibleHaplotypeCount);
-            final ChildKBestSubHaplotype nextResult = nextChildrenKBestHaplotypePath.remove();
-            nextResult.rank = i;
-            rankedResults.add(nextResult);
-            final int childRank = nextResult.subpath.rank();
-            final KBestSubHaplotypeFinder child = nextResult.child;
-
-            // if there is no further solution from the same child we cannot add another solution from that child.
-            if (childRank + 1 >= nextResult.child.getCount())
-                continue;
-            nextChildrenKBestHaplotypePath.add(new ChildKBestSubHaplotype(-1,nextResult.edge, child, childRank + 1));
+        @Override
+        public int getCount() {
+            return childFinder.getCount();
+        }
+
+        @Override
+        public KBestHaplotype getKBest(int k) {
+            return new ChildKBestSubHaplotype(vertex,edge,childFinder.getKBest(k));
         }
-        return rankedResults.get(k);
     }
 
     /**
      * Custom extension of the {@link KBestHaplotype} used for solutions generated by this class.
+     *
+     * <p>
+     *     These by delegating on the encapsulated solution from outgoing edge's finder by adding
+     *     the edge score and prefixing this outer finder
+     *     source vertex.
+     * </p>
      */
-    private class ChildKBestSubHaplotype extends KBestHaplotype implements Comparable<ChildKBestSubHaplotype>{
+    private static class ChildKBestSubHaplotype extends KBestHaplotype {
+
         private final int score;
-        private int rank;
-        private final KBestSubHaplotypeFinder child;
-        private final BaseEdge edge;
-        private final KBestHaplotype subpath;
+        private final KBestHaplotype child;
+        private final SeqVertex vertex;
         private final boolean isReference;
 
-        public ChildKBestSubHaplotype(final int rank, final BaseEdge edge,
-                                      final KBestSubHaplotypeFinder child, final int childRank) {
+        public ChildKBestSubHaplotype(final SeqVertex vertex, final BaseEdge edge, final KBestHaplotype child) {
+            this.score = edge.getMultiplicity() + child.score();
+            this.vertex = vertex;
             this.child = child;
-            this.edge = edge;
-            this.rank = rank;
-            this.subpath = child.getKBest(childRank);
-            this.score = edge.getMultiplicity() + subpath.score();
-            this.isReference = edge.isRef() && subpath.isReference();
+            this.isReference = edge.isRef() && child.isReference();
         }
 
         @Override
         public SeqGraph graph() {
-            return graph;
-        }
-
-        @Override
-        public int compareTo(final ChildKBestSubHaplotype other) {
-            if (other == null) throw new IllegalArgumentException("the other object cannot be null");
-            return - Integer.compare(this.score,other.score);
+            return child.graph();
         }
 
         @Override
@@ -220,10 +153,9 @@ class RecursiveSubHaplotypeFinder implements KBestSubHaplotypeFinder {
 
         @Override
         public int rank() {
-            return rank;
+            return child.rank();
         }
 
-
         @Override
         protected SeqVertex head() {
             return vertex;
@@ -231,7 +163,7 @@ class RecursiveSubHaplotypeFinder implements KBestSubHaplotypeFinder {
 
         @Override
         protected KBestHaplotype tail() {
-            return subpath;
+            return child;
         }
 
         @Override
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssembler.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssembler.java
index a932f8a96..30b677fe9 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssembler.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssembler.java
@@ -73,7 +73,6 @@ public class ReadThreadingAssembler extends LocalAssemblyEngine {
 
     private final boolean dontIncreaseKmerSizesForCycles;
     private final int numPruningSamples;
-    private boolean requireReasonableNumberOfPaths = false;
     protected boolean removePathsNotConnectedToRef = true;
     private boolean justReturnRawGraph = false;
 
@@ -207,24 +206,12 @@ public class ReadThreadingAssembler extends LocalAssemblyEngine {
         initialSeqGraph.cleanNonRefPaths(); // TODO -- I don't this is possible by construction
 
         final AssemblyResult cleaned = cleanupSeqGraph(initialSeqGraph);
-        final AssemblyResult.Status status = cleaned.getStatus() == AssemblyResult.Status.ASSEMBLED_SOME_VARIATION && requireReasonableNumberOfPaths && !reasonableNumberOfPaths(cleaned.getGraph()) ? AssemblyResult.Status.FAILED : cleaned.getStatus();
+        final AssemblyResult.Status status = cleaned.getStatus();
         final AssemblyResult result = new AssemblyResult(status, cleaned.getGraph());
         result.setThreadingGraph(rtgraph);
         return result;
     }
 
-    /**
-     * Did we find a reasonable number of paths in this graph?
-     * @param graph
-     * @return
-     */
-    private boolean reasonableNumberOfPaths(final SeqGraph graph) {
-        final KBestPaths<SeqVertex,BaseEdge> pathFinder = new KBestPaths<>(false);
-        final List<Path<SeqVertex,BaseEdge>> allPaths = pathFinder.getKBestPaths(graph, 100000);
-        logger.info("Found " + allPaths.size() + " paths through " + graph + " with maximum " + maxAllowedPathsForReadThreadingAssembler);
-        return allPaths.size() <= maxAllowedPathsForReadThreadingAssembler;
-    }
-
     @Override
     public String toString() {
         return "ReadThreadingAssembler{" +
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/CommonSuffixMergerUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/CommonSuffixMergerUnitTest.java
index 63fd21d8f..0ddf7544d 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/CommonSuffixMergerUnitTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/CommonSuffixMergerUnitTest.java
@@ -137,19 +137,20 @@ public class CommonSuffixMergerUnitTest extends BaseTest {
     public static void assertSameHaplotypes(final String name, final SeqGraph actual, final SeqGraph original) {
         try {
             final Set<String> haplotypes = new HashSet<String>();
-            final List<Path<SeqVertex,BaseEdge>> originalPaths = new KBestPaths<SeqVertex,BaseEdge>().getKBestPaths(original);
-            for ( final Path<SeqVertex,BaseEdge> path : originalPaths )
-                haplotypes.add(new String(path.getBases()));
+            final List<KBestHaplotype> originalKBestHaplotypes = new KBestHaplotypeFinder(original,original.getSources(),original.getSinks());
+            final List<KBestHaplotype> actualKBestHaplotypes = new KBestHaplotypeFinder(actual,actual.getSources(),actual.getSinks());
 
-            final List<Path<SeqVertex,BaseEdge>> splitPaths = new KBestPaths<SeqVertex,BaseEdge>().getKBestPaths(actual);
-            for ( final Path<SeqVertex,BaseEdge> path : splitPaths ) {
-                final String h = new String(path.getBases());
+            for (final KBestHaplotype kbh : originalKBestHaplotypes)
+                haplotypes.add(new String(kbh.bases()));
+
+            for ( final KBestHaplotype kbh : actualKBestHaplotypes ) {
+                final String h = new String(kbh.bases());
                 Assert.assertTrue(haplotypes.contains(h), "Failed to find haplotype " + h);
             }
 
-            if ( splitPaths.size() == originalPaths.size() ) {
-                for ( int i = 0; i < originalPaths.size(); i++ ) {
-                    Assert.assertTrue(splitPaths.get(i).equalSequence(originalPaths.get(i)), "Paths not equal " + splitPaths.get(i) + " vs. original " + originalPaths.get(i));
+            if ( actualKBestHaplotypes.size() == originalKBestHaplotypes.size() ) {
+                for ( int i = 0; i < originalKBestHaplotypes.size(); i++ ) {
+                    Assert.assertTrue(actualKBestHaplotypes.get(i).haplotype().getBaseString().equals(originalKBestHaplotypes.get(i).haplotype().getBaseString()), "Paths not equal " + actualKBestHaplotypes.get(i).haplotype() + " vs. original " + originalKBestHaplotypes.get(i).haplotype());
                 }
             }
         } catch ( AssertionError e ) {
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestPathsUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotypeFinderUnitTest.java
similarity index 82%
rename from protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestPathsUnitTest.java
rename to protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotypeFinderUnitTest.java
index f117f5750..6dc3d5d67 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestPathsUnitTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/KBestHaplotypeFinderUnitTest.java
@@ -66,31 +66,25 @@ import java.util.*;
  * Date: 1/31/13
  */
 
-public class KBestPathsUnitTest extends BaseTest {
-    private final static boolean DEBUG = false;
+public class KBestHaplotypeFinderUnitTest extends BaseTest {
 
     @DataProvider(name = "BasicPathFindingData")
     public Object[][] makeBasicPathFindingData() {
-        List<Object[]> tests = new ArrayList<Object[]>();
-        for ( final boolean allowCycles : Arrays.asList(false, true)) {
-            for ( final int nStartNodes : Arrays.asList(1, 2, 3) ) {
-                for ( final int nBranchesPerBubble : Arrays.asList(2, 3) ) {
-                    for ( final int nEndNodes : Arrays.asList(1, 2, 3) ) {
-                        for ( final boolean addCycle : Arrays.asList(true, false) ) {
-                            tests.add(new Object[]{nStartNodes, nBranchesPerBubble, nEndNodes, addCycle, allowCycles});
-                        }
-                    }
+        final List<Object[]> tests = new ArrayList<>();
+        for ( final int nStartNodes : Arrays.asList(1, 2, 3) ) {
+            for ( final int nBranchesPerBubble : Arrays.asList(2, 3) ) {
+                for ( final int nEndNodes : Arrays.asList(1, 2, 3) ) {
+                    tests.add(new Object[]{nStartNodes, nBranchesPerBubble, nEndNodes});
                 }
             }
         }
-
         return tests.toArray(new Object[][]{});
     }
 
     private static int weight = 1;
     final Set<SeqVertex> createVertices(final SeqGraph graph, final int n, final SeqVertex source, final SeqVertex target) {
         final List<String> seqs = Arrays.asList("A", "C", "G", "T");
-        final Set<SeqVertex> vertices = new LinkedHashSet<SeqVertex>();
+        final Set<SeqVertex> vertices = new LinkedHashSet<>();
         for ( int i = 0; i < n; i++ ) {
             final SeqVertex v = new SeqVertex(seqs.get(i));
             graph.addVertex(v);
@@ -101,77 +95,42 @@ public class KBestPathsUnitTest extends BaseTest {
         return vertices;
     }
 
-    @Test(dataProvider = "BasicPathFindingData", enabled = !DEBUG)
-    public void testBasicPathFinding(final int nStartNodes, final int nBranchesPerBubble, final int nEndNodes, final boolean addCycle, final boolean allowCycles) {
-        SeqGraph graph = new SeqGraph(11);
+    @Test(dataProvider = "BasicPathFindingData")
+    public void testBasicPathFinding(final int nStartNodes, final int nBranchesPerBubble, final int nEndNodes) {
+        final SeqGraph graph = new SeqGraph(11);
 
         final SeqVertex middleTop = new SeqVertex("GTAC");
         final SeqVertex middleBottom = new SeqVertex("ACTG");
         graph.addVertices(middleTop, middleBottom);
         final Set<SeqVertex> starts = createVertices(graph, nStartNodes, null, middleTop);
+        @SuppressWarnings("unused")
         final Set<SeqVertex> bubbles = createVertices(graph, nBranchesPerBubble, middleTop, middleBottom);
         final Set<SeqVertex> ends = createVertices(graph, nEndNodes, middleBottom, null);
 
-        if ( addCycle ) graph.addEdge(middleBottom, middleBottom);
-
         // enumerate all possible paths
-        final List<Path<SeqVertex,BaseEdge>> paths = new KBestPaths<SeqVertex,BaseEdge>(allowCycles).getKBestPaths(graph, starts, ends);
+        final List<KBestHaplotype> paths = new KBestHaplotypeFinder(graph, starts, ends);
 
-        final int expectedNumOfPaths = nStartNodes * nBranchesPerBubble * (addCycle && allowCycles ? 2 : 1) * nEndNodes;
+        final int expectedNumOfPaths = nStartNodes * nBranchesPerBubble * nEndNodes;
         Assert.assertEquals(paths.size(), expectedNumOfPaths, "Didn't find the expected number of paths");
 
         int lastScore = Integer.MAX_VALUE;
-        for ( final Path path : paths ) {
+        for ( final KBestHaplotype kbh : paths ) {
+            final Path<SeqVertex,BaseEdge> path = kbh.path();
             Assert.assertTrue(path.getScore() <= lastScore, "Paths out of order.   Path " + path + " has score above previous " + lastScore);
             lastScore = path.getScore();
         }
 
         // get the best path, and make sure it's the same as our optimal path overall
-        final Path best = paths.get(0);
-        final List<Path<SeqVertex,BaseEdge>> justOne = new KBestPaths<SeqVertex,BaseEdge>(allowCycles).getKBestPaths(graph, 1, starts, ends);
+        final Path<SeqVertex,BaseEdge> best = paths.get(0).path();
+        final List<KBestHaplotype> justOne = new KBestHaplotypeFinder(graph,starts, ends).subList(0,1);
         Assert.assertEquals(justOne.size(), 1);
-        Assert.assertTrue(justOne.get(0).pathsAreTheSame(best), "Best path from complete enumerate " + best + " not the same as from k = 1 search " + justOne.get(0));
-    }
 
-    @Test(enabled = false) // No longer supported, but no longer needed.
-    public void testPathFindingComplexCycle() {
-        SeqGraph graph = new SeqGraph(11);
-
-        final SeqVertex v1 = new SeqVertex("A");
-        final SeqVertex v2 = new SeqVertex("C");
-        final SeqVertex v3 = new SeqVertex("G");
-        final SeqVertex v4 = new SeqVertex("T");
-        final SeqVertex v5 = new SeqVertex("AA");
-        graph.addVertices(v1, v2, v3, v4, v5);
-        graph.addEdges(v1, v2, v3, v4, v5);
-        graph.addEdges(v3, v3);
-        graph.addEdges(v4, v2);
-
-        // enumerate all possible paths
-        final List<Path<SeqVertex,BaseEdge>> paths = new KBestPaths<SeqVertex,BaseEdge>(false).getKBestPaths(graph, v1, v5);
-
-        Assert.assertEquals(paths.size(), 1, "Didn't find the expected number of paths");
-    }
-
-    @Test(enabled = false) // No longer supported, but no longer needed.
-    public void testPathFindingCycleLastNode() {
-        SeqGraph graph = new SeqGraph(11);
-
-        final SeqVertex v1 = new SeqVertex("A");
-        final SeqVertex v2 = new SeqVertex("C");
-        final SeqVertex v3 = new SeqVertex("G");
-        graph.addVertices(v1, v2, v3);
-        graph.addEdges(v1, v2, v3, v3);
-
-        // enumerate all possible paths
-        final List<Path<SeqVertex,BaseEdge>> paths = new KBestPaths<SeqVertex,BaseEdge>(false).getKBestPaths(graph, v1, v3);
-
-        Assert.assertEquals(paths.size(), 1, "Didn't find the expected number of paths");
+        Assert.assertTrue(justOne.get(0).path().pathsAreTheSame(best), "Best path from complete enumerate " + best + " not the same as from k = 1 search " + justOne.get(0));
     }
 
     @DataProvider(name = "BasicBubbleDataProvider")
     public Object[][] makeBasicBubbleDataProvider() {
-        List<Object[]> tests = new ArrayList<Object[]>();
+        final List<Object[]> tests = new ArrayList<>();
         for ( final int refBubbleLength : Arrays.asList(1, 5, 10) ) {
             for ( final int altBubbleLength : Arrays.asList(1, 5, 10) ) {
                 tests.add(new Object[]{refBubbleLength, altBubbleLength});
@@ -180,7 +139,7 @@ public class KBestPathsUnitTest extends BaseTest {
         return tests.toArray(new Object[][]{});
     }
 
-    @Test(dataProvider = "BasicBubbleDataProvider", enabled = !DEBUG)
+    @Test(dataProvider = "BasicBubbleDataProvider")
     public void testBasicBubbleData(final int refBubbleLength, final int altBubbleLength) {
         // Construct the assembly graph
         SeqGraph graph = new SeqGraph(3);
@@ -202,9 +161,9 @@ public class KBestPathsUnitTest extends BaseTest {
         graph.addEdge(v2Alt, v3, new BaseEdge(false, 5));
 
         // Construct the test path
-        Path<SeqVertex,BaseEdge> path = new Path<SeqVertex,BaseEdge>(v, graph);
-        path = new Path<SeqVertex,BaseEdge>(path, graph.getEdge(v, v2Alt));
-        path = new Path<SeqVertex,BaseEdge>(path, graph.getEdge(v2Alt, v3));
+        Path<SeqVertex,BaseEdge> path = new Path<>(v, graph);
+        path = new Path<>(path, graph.getEdge(v, v2Alt));
+        path = new Path<>(path, graph.getEdge(v2Alt, v3));
 
         // Construct the actual cigar string implied by the test path
         Cigar expectedCigar = new Cigar();
@@ -226,7 +185,7 @@ public class KBestPathsUnitTest extends BaseTest {
 
     @DataProvider(name = "GetBasesData")
     public Object[][] makeGetBasesData() {
-        List<Object[]> tests = new ArrayList<Object[]>();
+        List<Object[]> tests = new ArrayList<>();
 
         final List<String> frags = Arrays.asList("ACT", "GAC", "CAT");
 
@@ -238,14 +197,14 @@ public class KBestPathsUnitTest extends BaseTest {
         return tests.toArray(new Object[][]{});
     }
 
-    @Test(dataProvider = "GetBasesData", enabled = !DEBUG)
+    @Test(dataProvider = "GetBasesData")
     public void testGetBases(final List<String> frags) {
         // Construct the assembly graph
         SeqGraph graph = new SeqGraph(3);
 
         SeqVertex prev = null;
-        for ( int i = 0; i < frags.size(); i++ ) {
-            SeqVertex v = new SeqVertex(frags.get(i));
+        for (final String s : frags) {
+            SeqVertex v = new SeqVertex(s);
             graph.addVertex(v);
             if ( prev != null )
                 graph.addEdge(prev, v);
@@ -253,15 +212,15 @@ public class KBestPathsUnitTest extends BaseTest {
         }
 
         // enumerate all possible paths
-        final List<Path<SeqVertex,BaseEdge>> paths = new KBestPaths<SeqVertex,BaseEdge>().getKBestPaths(graph);
+        final List<KBestHaplotype> paths = new KBestHaplotypeFinder(graph,graph.getSources(),graph.getSinks());
         Assert.assertEquals(paths.size(), 1);
-        final Path<SeqVertex,BaseEdge> path = paths.get(0);
+        final Path<SeqVertex,BaseEdge> path = paths.get(0).path();
         Assert.assertEquals(new String(path.getBases()), Utils.join("", frags), "Path doesn't have the expected sequence");
     }
 
     @DataProvider(name = "TripleBubbleDataProvider")
     public Object[][] makeTripleBubbleDataProvider() {
-        List<Object[]> tests = new ArrayList<Object[]>();
+        final List<Object[]> tests = new ArrayList<>();
         for ( final int refBubbleLength : Arrays.asList(1, 5, 10) ) {
             for ( final int altBubbleLength : Arrays.asList(1, 5, 10) ) {
                 for ( final boolean offRefEnding : Arrays.asList(true, false) ) {
@@ -274,7 +233,7 @@ public class KBestPathsUnitTest extends BaseTest {
         return tests.toArray(new Object[][]{});
     }
 
-    @Test(dataProvider = "TripleBubbleDataProvider", enabled = !DEBUG)
+    @Test(dataProvider = "TripleBubbleDataProvider")
     public void testTripleBubbleData(final int refBubbleLength, final int altBubbleLength, final boolean offRefBeginning, final boolean offRefEnding) {
         // Construct the assembly graph
         SeqGraph graph = new SeqGraph(11);
@@ -328,19 +287,17 @@ public class KBestPathsUnitTest extends BaseTest {
         graph.addEdge(v7, postV, new BaseEdge(false, 1));
 
         // Construct the test path
-        Path<SeqVertex,BaseEdge> path = new Path<SeqVertex,BaseEdge>( (offRefBeginning ? preV : v), graph);
-        if( offRefBeginning ) {
-            path = new Path<SeqVertex,BaseEdge>(path, graph.getEdge(preV, v));
-        }
-        path = new Path<SeqVertex,BaseEdge>(path, graph.getEdge(v, v2Alt));
-        path = new Path<SeqVertex,BaseEdge>(path, graph.getEdge(v2Alt, v3));
-        path = new Path<SeqVertex,BaseEdge>(path, graph.getEdge(v3, v4Ref));
-        path = new Path<SeqVertex,BaseEdge>(path, graph.getEdge(v4Ref, v5));
-        path = new Path<SeqVertex,BaseEdge>(path, graph.getEdge(v5, v6Alt));
-        path = new Path<SeqVertex,BaseEdge>(path, graph.getEdge(v6Alt, v7));
-        if( offRefEnding ) {
-            path = new Path<SeqVertex,BaseEdge>(path, graph.getEdge(v7,postV));
-        }
+        Path<SeqVertex,BaseEdge> path = new Path<>( (offRefBeginning ? preV : v), graph);
+        if( offRefBeginning )
+            path = new Path<>(path, graph.getEdge(preV, v));
+        path = new Path<>(path, graph.getEdge(v, v2Alt));
+        path = new Path<>(path, graph.getEdge(v2Alt, v3));
+        path = new Path<>(path, graph.getEdge(v3, v4Ref));
+        path = new Path<>(path, graph.getEdge(v4Ref, v5));
+        path = new Path<>(path, graph.getEdge(v5, v6Alt));
+        path = new Path<>(path, graph.getEdge(v6Alt, v7));
+        if( offRefEnding )
+            path = new Path<>(path, graph.getEdge(v7,postV));
 
         // Construct the actual cigar string implied by the test path
         Cigar expectedCigar = new Cigar();
@@ -382,10 +339,10 @@ public class KBestPathsUnitTest extends BaseTest {
                 "Cigar string mismatch: ref = " + ref + " alt " + new String(path.getBases()));
     }
 
-    @Test(enabled = !DEBUG)
+    @Test
     public void testIntraNodeInsertionDeletion() {
         // Construct the assembly graph
-        SeqGraph graph = new SeqGraph(11);
+        final SeqGraph graph = new SeqGraph(11);
         final SeqVertex top = new SeqVertex("T");
         final SeqVertex bot = new SeqVertex("T");
         final SeqVertex alt = new SeqVertex("AAACCCCC");
@@ -395,38 +352,38 @@ public class KBestPathsUnitTest extends BaseTest {
         graph.addEdges(new BaseEdge(true, 1), top, ref, bot);
         graph.addEdges(new BaseEdge(false, 1), top, alt, bot);
 
-        final KBestPaths<SeqVertex,BaseEdge> pathFinder = new KBestPaths<SeqVertex,BaseEdge>();
-        final List<Path<SeqVertex,BaseEdge>> paths = pathFinder.getKBestPaths(graph, top, bot);
+        @SuppressWarnings("all")
+        final KBestHaplotypeFinder bestPathFinder = new KBestHaplotypeFinder(graph,top,bot);
 
-        Assert.assertEquals(paths.size(), 2);
+        Assert.assertEquals(bestPathFinder.size(), 2);
 
-        final Path<SeqVertex,BaseEdge> refPath = paths.get(0);
-        final Path<SeqVertex,BaseEdge> altPath = paths.get(1);
+        final Path<SeqVertex,BaseEdge> refPath = bestPathFinder.get(0).path();
+        final Path<SeqVertex,BaseEdge> altPath = bestPathFinder.get(1).path();
 
         final String refString = top.getSequenceString() + ref.getSequenceString() + bot.getSequenceString();
         Assert.assertEquals(refPath.calculateCigar(refString.getBytes()).toString(), "10M");
         Assert.assertEquals(altPath.calculateCigar(refString.getBytes()).toString(), "1M3I5M3D1M");
     }
 
-    @Test(enabled = !DEBUG)
+    @Test
     public void testHardSWPath() {
         // Construct the assembly graph
-        SeqGraph graph = new SeqGraph(11);
+        final SeqGraph graph = new SeqGraph(11);
         final SeqVertex top = new SeqVertex( "NNN" );
         final SeqVertex bot = new SeqVertex( "NNN" );
-        final SeqVertex alt = new SeqVertex(               "ACAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGA" );
+        final SeqVertex alt = new SeqVertex( "ACAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGAGA" );
         final SeqVertex ref = new SeqVertex( "TGTGTGTGTGTGTGACAGAGAGAGAGAGAGAGAGAGAGAGAGAGA" );
         graph.addVertices(top, bot, alt, ref);
         graph.addEdges(new BaseEdge(true, 1), top, ref, bot);
         graph.addEdges(new BaseEdge(false, 1), top, alt, bot);
 
-        final KBestPaths<SeqVertex,BaseEdge> pathFinder = new KBestPaths<SeqVertex,BaseEdge>();
-        final List<Path<SeqVertex,BaseEdge>> paths = pathFinder.getKBestPaths(graph, top, bot);
+        @SuppressWarnings("all")
+        final List<KBestHaplotype> paths = new KBestHaplotypeFinder(graph, top, bot);
 
         Assert.assertEquals(paths.size(), 2);
 
-        final Path<SeqVertex,BaseEdge> refPath = paths.get(0);
-        final Path<SeqVertex,BaseEdge> altPath = paths.get(1);
+        final Path<SeqVertex,BaseEdge> refPath = paths.get(0).path();
+        final Path<SeqVertex,BaseEdge> altPath = paths.get(1).path();
 
         final String refString = top.getSequenceString() + ref.getSequenceString() + bot.getSequenceString();
 
@@ -446,7 +403,7 @@ public class KBestPathsUnitTest extends BaseTest {
 
     @DataProvider(name = "SystematicRefAltSWTestData")
     public Object[][] makeSystematicRefAltSWTestData() {
-        List<Object[]> tests = new ArrayList<Object[]>();
+        final List<Object[]> tests = new ArrayList<>();
 
         final List<List<String>> allDiffs = Arrays.asList(
                 Arrays.asList("G", "C", "1M"),
@@ -470,7 +427,7 @@ public class KBestPathsUnitTest extends BaseTest {
         return tests.toArray(new Object[][]{});
     }
 
-    @Test(dataProvider = "SystematicRefAltSWTestData", enabled = !DEBUG)
+    @Test(dataProvider = "SystematicRefAltSWTestData")
     public void testRefAltSW(final String prefix, final String end, final String refMid, final String altMid, final String midCigar) {
         // Construct the assembly graph
         SeqGraph graph = new SeqGraph(11);
@@ -506,7 +463,7 @@ public class KBestPathsUnitTest extends BaseTest {
         Assert.assertEquals(pathCigar, expected, "Cigar mismatch: ref = " + refString + " vs alt = " + new String(path.getBases()));
     }
 
-    @Test(enabled = !DEBUG)
+    @Test
     public void testLeftAlignCigarSequentially() {
         String preRefString = "GATCGATCGATC";
         String postRefString = "TTT";
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/SharedVertexSequenceSplitterUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/SharedVertexSequenceSplitterUnitTest.java
index bb504b78c..2f44129d8 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/SharedVertexSequenceSplitterUnitTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/graphs/SharedVertexSequenceSplitterUnitTest.java
@@ -61,7 +61,7 @@ public class SharedVertexSequenceSplitterUnitTest extends BaseTest {
 
     @DataProvider(name = "PrefixSuffixData")
     public Object[][] makePrefixSuffixData() {
-        List<Object[]> tests = new ArrayList<Object[]>();
+        final List<Object[]> tests = new ArrayList<>();
 
         tests.add(new Object[]{Arrays.asList("A", "C"), 0, 0});
         tests.add(new Object[]{Arrays.asList("C", "C"), 1, 0});
@@ -91,7 +91,7 @@ public class SharedVertexSequenceSplitterUnitTest extends BaseTest {
 
     @Test(dataProvider = "PrefixSuffixData")
     public void testPrefixSuffix(final List<String> strings, int expectedPrefixLen, int expectedSuffixLen) {
-        final List<byte[]> bytes = new ArrayList<byte[]>();
+        final List<byte[]> bytes = new ArrayList<>();
         int min = Integer.MAX_VALUE;
         for ( final String s : strings ) {
             bytes.add(s.getBytes());
@@ -107,7 +107,7 @@ public class SharedVertexSequenceSplitterUnitTest extends BaseTest {
 
     @Test(dataProvider = "PrefixSuffixData")
     public void testPrefixSuffixVertices(final List<String> strings, int expectedPrefixLen, int expectedSuffixLen) {
-        final List<SeqVertex> v = new ArrayList<SeqVertex>();
+        final List<SeqVertex> v = new ArrayList<>();
         for ( final String s : strings ) {
             v.add(new SeqVertex(s));
         }
@@ -127,19 +127,18 @@ public class SharedVertexSequenceSplitterUnitTest extends BaseTest {
     public void testSplitter(final List<String> strings, int expectedPrefixLen, int expectedSuffixLen) {
         final SeqGraph graph = new SeqGraph(11);
 
-        final List<SeqVertex> v = new ArrayList<SeqVertex>();
+        final List<SeqVertex> v = new ArrayList<>();
         for ( final String s : strings ) {
             v.add(new SeqVertex(s));
         }
 
-        graph.addVertices(v.toArray(new SeqVertex[]{}));
+        graph.addVertices(v.toArray(new SeqVertex[v.size()]));
 
         final String expectedPrefix = strings.get(0).substring(0, expectedPrefixLen);
         final String expectedSuffix = strings.get(0).substring(strings.get(0).length() - expectedSuffixLen);
 
         final SharedVertexSequenceSplitter splitter = new SharedVertexSequenceSplitter(graph, v);
         splitter.split();
-//        splitter.splitGraph.printGraph(new File(Utils.join("_", strings) + ".dot"), 0);
 
         Assert.assertEquals(splitter.prefixV.getSequenceString(), expectedPrefix);
         Assert.assertEquals(splitter.suffixV.getSequenceString(), expectedSuffix);
@@ -158,7 +157,7 @@ public class SharedVertexSequenceSplitterUnitTest extends BaseTest {
 
     @DataProvider(name = "CompleteCycleData")
     public Object[][] makeCompleteCycleData() {
-        List<Object[]> tests = new ArrayList<Object[]>();
+        List<Object[]> tests = new ArrayList<>();
 
         for ( final boolean hasTop : Arrays.asList(true, false) ) {
             for ( final boolean hasBot : Arrays.asList(true, false) ) {
@@ -207,11 +206,11 @@ public class SharedVertexSequenceSplitterUnitTest extends BaseTest {
         int edgeWeight = 1;
         final SeqVertex top = hasTop ? new SeqVertex("AAAAAAAA") : null;
         final SeqVertex bot = hasBot ? new SeqVertex("GGGGGGGG") : null;
-        final List<SeqVertex> v = new ArrayList<SeqVertex>();
+        final List<SeqVertex> v = new ArrayList<>();
         for ( final String s : strings ) {
             v.add(new SeqVertex(s));
         }
-        graph.addVertices(v.toArray(new SeqVertex[]{}));
+        graph.addVertices(v.toArray(new SeqVertex[v.size()]));
         final SeqVertex first = v.get(0);
 
         if ( hasTop ) {
@@ -226,10 +225,10 @@ public class SharedVertexSequenceSplitterUnitTest extends BaseTest {
                 graph.addEdge(vi, bot, new BaseEdge(vi == first, edgeWeight++));
         }
 
-        final Set<String> haplotypes = new HashSet<String>();
-        final List<Path<SeqVertex,BaseEdge>> originalPaths = new KBestPaths<SeqVertex,BaseEdge>().getKBestPaths((SeqGraph)graph.clone());
-        for ( final Path<SeqVertex,BaseEdge> path : originalPaths )
-            haplotypes.add(new String(path.getBases()));
+        final Set<String> haplotypes = new HashSet<>();
+        final List<KBestHaplotype> originalPaths = new KBestHaplotypeFinder((SeqGraph) graph.clone(),graph.getSources(),graph.getSinks());
+        for ( final KBestHaplotype path : originalPaths )
+            haplotypes.add(new String(path.bases()));
 
         final SharedVertexSequenceSplitter splitter = new SharedVertexSequenceSplitter(graph, v);
         splitter.split();
@@ -238,22 +237,22 @@ public class SharedVertexSequenceSplitterUnitTest extends BaseTest {
         splitter.updateGraph(top, bot);
         if ( PRINT_GRAPHS ) graph.printGraph(new File(Utils.join("_", strings) + ".updated.dot"), 0);
 
-        final List<Path<SeqVertex,BaseEdge>> splitPaths = new KBestPaths<SeqVertex,BaseEdge>().getKBestPaths(graph);
-        for ( final Path<SeqVertex,BaseEdge> path : splitPaths ) {
-            final String h = new String(path.getBases());
+        final List<KBestHaplotype> splitPaths = new KBestHaplotypeFinder(graph,graph.getSources(),graph.getSinks());
+        for ( final KBestHaplotype path : splitPaths ) {
+            final String h = new String(path.bases());
             Assert.assertTrue(haplotypes.contains(h), "Failed to find haplotype " + h);
         }
 
         if ( splitPaths.size() == originalPaths.size() ) {
             for ( int i = 0; i < originalPaths.size(); i++ ) {
-                Assert.assertTrue(splitPaths.get(i).equalScoreAndSequence(originalPaths.get(i)), "Paths not equal " + splitPaths.get(i) + " vs. original " + originalPaths.get(i));
+                Assert.assertTrue(splitPaths.get(i).path().equalScoreAndSequence(originalPaths.get(i).path()), "Paths not equal " + splitPaths.get(i) + " vs. original " + originalPaths.get(i));
             }
         }
     }
 
     @DataProvider(name = "MeetsMinSequenceData")
     public Object[][] makeMeetsMinSequenceData() {
-        List<Object[]> tests = new ArrayList<Object[]>();
+        final List<Object[]> tests = new ArrayList<>();
 
         final boolean prefixBiased = SharedVertexSequenceSplitter.prefersPrefixMerging();
         tests.add(new Object[]{Arrays.asList("AC", "AC"), 0, true, true});
@@ -280,9 +279,9 @@ public class SharedVertexSequenceSplitterUnitTest extends BaseTest {
 
         final SeqVertex top = new SeqVertex("AAAAAAAA");
         final SeqVertex bot = new SeqVertex("GGGGGGGG");
-        final List<SeqVertex> v = new ArrayList<SeqVertex>();
+        final List<SeqVertex> v = new ArrayList<>();
         for ( final String s : mids ) { v.add(new SeqVertex(s)); }
-        graph.addVertices(v.toArray(new SeqVertex[]{}));
+        graph.addVertices(v.toArray(new SeqVertex[v.size()]));
         graph.addVertices(top, bot);
         for ( final SeqVertex vi : v ) { graph.addEdge(top, vi); graph.addEdge(vi, bot); }
 
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraphUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraphUnitTest.java
index bab952e2a..a13bc4754 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraphUnitTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/DanglingChainMergingGraphUnitTest.java
@@ -46,10 +46,11 @@
 
 package org.broadinstitute.sting.gatk.walkers.haplotypecaller.readthreading;
 
-import net.sf.samtools.Cigar;
 import net.sf.samtools.TextCigarCodec;
 import org.broadinstitute.sting.BaseTest;
-import org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs.*;
+import org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs.KBestHaplotype;
+import org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs.KBestHaplotypeFinder;
+import org.broadinstitute.sting.gatk.walkers.haplotypecaller.graphs.SeqGraph;
 import org.broadinstitute.sting.utils.Utils;
 import org.broadinstitute.sting.utils.sam.ArtificialSAMUtils;
 import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
@@ -57,7 +58,8 @@ import org.testng.Assert;
 import org.testng.annotations.DataProvider;
 import org.testng.annotations.Test;
 
-import java.util.*;
+import java.util.ArrayList;
+import java.util.List;
 
 public class DanglingChainMergingGraphUnitTest extends BaseTest {
 
@@ -235,7 +237,7 @@ public class DanglingChainMergingGraphUnitTest extends BaseTest {
         // confirm that we created the appropriate bubble in the graph only if expected
         rtgraph.cleanNonRefPaths();
         final SeqGraph seqGraph = rtgraph.convertToSequenceGraph();
-        List<Path<SeqVertex,BaseEdge>> paths = new KBestPaths<SeqVertex,BaseEdge>().getKBestPaths(seqGraph, seqGraph.getReferenceSourceVertex(), seqGraph.getReferenceSinkVertex());
+        final List<KBestHaplotype> paths = new KBestHaplotypeFinder(seqGraph, seqGraph.getReferenceSourceVertex(), seqGraph.getReferenceSinkVertex());
         Assert.assertEquals(paths.size(), shouldBeMerged ? 2 : 1);
     }
 }
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssemblerUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssemblerUnitTest.java
index 5b01a1d85..769026f2b 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssemblerUnitTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingAssemblerUnitTest.java
@@ -59,13 +59,14 @@ import java.io.File;
 import java.util.*;
 
 public class ReadThreadingAssemblerUnitTest extends BaseTest {
+
     private final static boolean DEBUG = false;
 
     private static class TestAssembler {
         final ReadThreadingAssembler assembler;
 
         Haplotype refHaplotype;
-        final List<GATKSAMRecord> reads = new LinkedList<GATKSAMRecord>();
+        final List<GATKSAMRecord> reads = new LinkedList<>();
 
         private TestAssembler(final int kmerSize) {
             this.assembler = new ReadThreadingAssembler(100000, Arrays.asList(kmerSize));
@@ -102,11 +103,11 @@ public class ReadThreadingAssemblerUnitTest extends BaseTest {
     private void assertSingleBubble(final TestAssembler assembler, final String one, final String two) {
         final SeqGraph graph = assembler.assemble();
         graph.simplifyGraph();
-        List<Path<SeqVertex,BaseEdge>> paths = new KBestPaths<SeqVertex,BaseEdge>().getKBestPaths(graph);
+        final List<KBestHaplotype> paths = new KBestHaplotypeFinder(graph);
         Assert.assertEquals(paths.size(), 2);
-        final Set<String> expected = new HashSet<String>(Arrays.asList(one, two));
-        for ( final Path<SeqVertex,BaseEdge> path : paths ) {
-            final String seq = new String(path.getBases());
+        final Set<String> expected = new HashSet<>(Arrays.asList(one, two));
+        for ( final KBestHaplotype path : paths ) {
+            final String seq = new String(path.bases());
             Assert.assertTrue(expected.contains(seq));
             expected.remove(seq);
         }
@@ -169,7 +170,7 @@ public class ReadThreadingAssemblerUnitTest extends BaseTest {
         Assert.assertNotNull(graph.getReferenceSourceVertex());
         Assert.assertNotNull(graph.getReferenceSinkVertex());
 
-        final List<Path<SeqVertex,BaseEdge>> paths = new KBestPaths<SeqVertex,BaseEdge>().getKBestPaths(graph);
+        final List<KBestHaplotype> paths = new KBestHaplotypeFinder(graph);
         Assert.assertEquals(paths.size(), 2);
     }
 
@@ -226,11 +227,10 @@ public class ReadThreadingAssemblerUnitTest extends BaseTest {
         assembler.addSequence(ReadThreadingGraphUnitTest.getBytes(read2), false);
 
         final SeqGraph graph = assembler.assemble();
-        final KBestPaths<SeqVertex,BaseEdge> pathFinder = new KBestPaths<SeqVertex,BaseEdge>();
-        final List<Path<SeqVertex,BaseEdge>> paths = pathFinder.getKBestPaths(graph);
+        final List<KBestHaplotype> paths = new KBestHaplotypeFinder(graph);
         Assert.assertEquals(paths.size(), 2);
-        final byte[] refPath = paths.get(0).getBases().length == ref.length() ? paths.get(0).getBases() : paths.get(1).getBases();
-        final byte[] altPath = paths.get(0).getBases().length == ref.length() ? paths.get(1).getBases() : paths.get(0).getBases();
+        final byte[] refPath = paths.get(0).bases().length == ref.length() ? paths.get(0).bases() : paths.get(1).bases();
+        final byte[] altPath = paths.get(0).bases().length == ref.length() ? paths.get(1).bases() : paths.get(0).bases();
         Assert.assertEquals(refPath, ReadThreadingGraphUnitTest.getBytes(ref));
         Assert.assertEquals(altPath, ReadThreadingGraphUnitTest.getBytes(read1));
     }
diff --git a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraphUnitTest.java b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraphUnitTest.java
index 8535c186a..c95f4002e 100644
--- a/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraphUnitTest.java
+++ b/protected/gatk-protected/src/test/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/readthreading/ReadThreadingGraphUnitTest.java
@@ -212,8 +212,7 @@ public class ReadThreadingGraphUnitTest extends BaseTest {
         rtgraph.buildGraphIfNecessary();
 
         final SeqGraph graph = rtgraph.convertToSequenceGraph();
-        final KBestPaths<SeqVertex,BaseEdge> pathFinder = new KBestPaths<>(false);
-        Assert.assertEquals(pathFinder.getKBestPaths(graph, length, graph.getReferenceSourceVertex(), graph.getReferenceSinkVertex()).size(), 1);
+        Assert.assertEquals(new KBestHaplotypeFinder(graph, graph.getReferenceSourceVertex(), graph.getReferenceSinkVertex()).size(), 1);
     }
 
 // TODO -- update to use determineKmerSizeAndNonUniques directly
diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/refdata/tracks/RMDTrackBuilder.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/refdata/tracks/RMDTrackBuilder.java
index a587a3984..df5cf91ca 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/refdata/tracks/RMDTrackBuilder.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/gatk/refdata/tracks/RMDTrackBuilder.java
@@ -34,7 +34,6 @@ import org.broad.tribble.TribbleException;
 import org.broad.tribble.index.Index;
 import org.broad.tribble.index.IndexFactory;
 import org.broad.tribble.util.LittleEndianOutputStream;
-import org.broad.tribble.util.TabixUtils;
 import org.broadinstitute.sting.commandline.Tags;
 import org.broadinstitute.sting.gatk.GenomeAnalysisEngine;
 import org.broadinstitute.sting.gatk.arguments.ValidationExclusion;
@@ -172,8 +171,8 @@ public class RMDTrackBuilder { // extends PluginManager<FeatureCodec> {
         // we might not know the index type, try loading with the default reader constructor
         logger.debug("Attempting to load " + inputFile + " as a tabix indexed file without validating it");
         try {
-            final File indexFile = new File(inputFile.getAbsoluteFile() + TabixUtils.STANDARD_INDEX_EXTENSION);
-            final SAMSequenceDictionary dict = TabixUtils.getSequenceDictionary(indexFile);
+            final File indexFile = null;//new File(inputFile.getAbsoluteFile() + TabixUtils.STANDARD_INDEX_EXTENSION);
+            final SAMSequenceDictionary dict = null; //TabixUtils.getSequenceDictionary(indexFile);
             return new Pair<>(AbstractFeatureReader.getFeatureReader(inputFile.getAbsolutePath(), createCodec(descriptor, name)), dict);
         } catch (TribbleException e) {
             throw new UserException(e.getMessage(), e);

From 58905e8fe034ac8a3f0c682a12ec1a5c10e62325 Mon Sep 17 00:00:00 2001
From: David Roazen <droazen@broadinstitute.org>
Date: Wed, 5 Mar 2014 09:15:26 -0500
Subject: [PATCH 14/18] Disable the intermittently-failing and flawed
 ProgressMeterDaemonUnitTest

-created a Pivotal ticket to eventually redesign this test
---
 .../sting/utils/progressmeter/ProgressMeterDaemonUnitTest.java  | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/public/gatk-framework/src/test/java/org/broadinstitute/sting/utils/progressmeter/ProgressMeterDaemonUnitTest.java b/public/gatk-framework/src/test/java/org/broadinstitute/sting/utils/progressmeter/ProgressMeterDaemonUnitTest.java
index 767646963..2ede67a3c 100644
--- a/public/gatk-framework/src/test/java/org/broadinstitute/sting/utils/progressmeter/ProgressMeterDaemonUnitTest.java
+++ b/public/gatk-framework/src/test/java/org/broadinstitute/sting/utils/progressmeter/ProgressMeterDaemonUnitTest.java
@@ -92,7 +92,7 @@ public class ProgressMeterDaemonUnitTest extends BaseTest {
         Assert.assertTrue( meter.getRuntimeInNanosecondsUpdatedPeriodically() > currentTime, "Updating the periodic runtime failed" );
     }
 
-    @Test(dataProvider = "PollingData", invocationCount = 10, successPercentage = 90)
+    @Test(dataProvider = "PollingData", invocationCount = 10, successPercentage = 90, enabled = false)
     public void testProgressMeterDaemon(final long poll, final int ticks) throws InterruptedException {
         final TestingProgressMeter meter = new TestingProgressMeter(poll);
         final ProgressMeterDaemon daemon = meter.getProgressMeterDaemon();

From b4dde6a78c6a3527dd7f80392e10b36ef1b2ca3d Mon Sep 17 00:00:00 2001
From: Joel Thibault <thibault@broadinstitute.org>
Date: Thu, 27 Feb 2014 10:07:38 -0500
Subject: [PATCH 15/18] Add WARN to the valid log types error message - order
 if statements and error message in increasing severity

---
 .../sting/commandline/CommandLineProgram.java          | 10 +++++-----
 1 file changed, 5 insertions(+), 5 deletions(-)

diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/commandline/CommandLineProgram.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/commandline/CommandLineProgram.java
index 8c7e11f35..8b1a390f4 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/commandline/CommandLineProgram.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/commandline/CommandLineProgram.java
@@ -277,19 +277,19 @@ public abstract class CommandLineProgram {
         Level par;
         if (logging_level.toUpperCase().equals("DEBUG")) {
             par = Level.DEBUG;
-        } else if (logging_level.toUpperCase().equals("ERROR")) {
-            par = Level.ERROR;
-        } else if (logging_level.toUpperCase().equals("FATAL")) {
-            par = Level.FATAL;
         } else if (logging_level.toUpperCase().equals("INFO")) {
             par = Level.INFO;
         } else if (logging_level.toUpperCase().equals("WARN")) {
             par = Level.WARN;
+        } else if (logging_level.toUpperCase().equals("ERROR")) {
+            par = Level.ERROR;
+        } else if (logging_level.toUpperCase().equals("FATAL")) {
+            par = Level.FATAL;
         } else if (logging_level.toUpperCase().equals("OFF")) {
             par = Level.OFF;
         } else {
             // we don't understand the logging level, let's get out of here
-            throw new ArgumentException("Unable to match: " + logging_level + " to a logging level, make sure it's a valid level (INFO, DEBUG, ERROR, FATAL, OFF)");
+            throw new ArgumentException("Unable to match: " + logging_level + " to a logging level, make sure it's a valid level (DEBUG, INFO, WARN, ERROR, FATAL, OFF)");
         }
 
         Logger.getRootLogger().setLevel(par);

From 57747ad35e3154004ad6f27df5337366ac1942ec Mon Sep 17 00:00:00 2001
From: Joel Thibault <thibault@broadinstitute.org>
Date: Tue, 4 Mar 2014 19:40:08 -0500
Subject: [PATCH 16/18] Logger output should go to STDERR instead of STDOUT

---
 .../org/broadinstitute/sting/commandline/CommandLineUtils.java  | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/public/gatk-framework/src/main/java/org/broadinstitute/sting/commandline/CommandLineUtils.java b/public/gatk-framework/src/main/java/org/broadinstitute/sting/commandline/CommandLineUtils.java
index ddedda054..cb9a781c3 100644
--- a/public/gatk-framework/src/main/java/org/broadinstitute/sting/commandline/CommandLineUtils.java
+++ b/public/gatk-framework/src/main/java/org/broadinstitute/sting/commandline/CommandLineUtils.java
@@ -173,7 +173,7 @@ public class CommandLineUtils {
         }
         // Extracted from BasicConfigurator.configure(), but only applied to the Sting logger.
         Logger.getRootLogger().addAppender(new ConsoleAppender(
-                    new PatternLayout(PatternLayout.TTCC_CONVERSION_PATTERN)));
+                    new PatternLayout(PatternLayout.TTCC_CONVERSION_PATTERN), ConsoleAppender.SYSTEM_ERR));
     }
 
     /**

From d81116eb1d75a03b9c535a39caed5a3a4d91063c Mon Sep 17 00:00:00 2001
From: Intel Repocontact <karthik.gururaj@intel.com>
Date: Wed, 5 Mar 2014 09:30:29 -0800
Subject: [PATCH 18/18] Added vectorized PairHMM implementation by Mohammad and
 Mustafa into the Maven build of GATK.

C++ code has PAPI calls for reading hardware counters

Followed Khalid's suggestion for packing libVectorLoglessCaching into
the jar file with Maven

Native library part of git repo

1. Renamed directory structure from public/c++/VectorPairHMM to
public/VectorPairHMM/src/main/c++ as per Khalid's suggestion
2. Use java.home in public/VectorPairHMM/pom.xml to pass environment
variable JRE_HOME to the make process. This is needed because the
Makefile needs to compile JNI code with the flag -I<JRE_HOME>/../include (among
others). Assuming that the Maven build process uses a JDK (and not just
a JRE), the variable java.home points to the JRE inside maven.
3. Dropped all pretense at cross-platform compatibility. Removed Mac
profile from pom.xml for VectorPairHMM

Moved JNI_README

1. Added the catch UnsatisfiedLinkError exception in
PairHMMLikelihoodCalculationEngine.java to fall back to LOGLESS_CACHING
in case the native library could not be loaded. Made
VECTOR_LOGLESS_CACHING as the default implementation.
2. Updated the README with Mauricio's comments
3. baseline.cc is used within the library - if the machine supports
neither AVX nor SSE4.1, the native library falls back to un-vectorized
C++ in baseline.cc.
4. pairhmm-1-base.cc: This is not part of the library, but is being
heavily used for debugging/profiling. Can I request that we keep it
there for now? In the next release, we can delete it from the
repository.
5. I agree with Mauricio about the ifdefs. I am sure you already know,
but just to reassure you the debug code is not compiled into the library
(because of the ifdefs) and will not affect performance.

1. Changed logger.info to logger.warn in PairHMMLikelihoodCalculationEngine.java
2. Committing the right set of files after rebase

Added public license text to all C++ files

Added license to Makefile

Add package info to Sandbox.java

Conflicts:
	protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCaller.java
	protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/PairHMMLikelihoodCalculationEngine.java
	protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/pairhmm/DebugJNILoglessPairHMM.java
	protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/pairhmm/JNILoglessPairHMM.java
	protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/pairhmm/VectorLoglessPairHMM.java
	public/VectorPairHMM/src/main/c++/.gitignore
	public/VectorPairHMM/src/main/c++/LoadTimeInitializer.cc
	public/VectorPairHMM/src/main/c++/LoadTimeInitializer.h
	public/VectorPairHMM/src/main/c++/Makefile
	public/VectorPairHMM/src/main/c++/Sandbox.cc
	public/VectorPairHMM/src/main/c++/Sandbox.h
	public/VectorPairHMM/src/main/c++/Sandbox.java
	public/VectorPairHMM/src/main/c++/Sandbox_JNIHaplotypeDataHolderClass.h
	public/VectorPairHMM/src/main/c++/Sandbox_JNIReadDataHolderClass.h
	public/VectorPairHMM/src/main/c++/baseline.cc
	public/VectorPairHMM/src/main/c++/define-double.h
	public/VectorPairHMM/src/main/c++/define-float.h
	public/VectorPairHMM/src/main/c++/define-sse-double.h
	public/VectorPairHMM/src/main/c++/define-sse-float.h
	public/VectorPairHMM/src/main/c++/headers.h
	public/VectorPairHMM/src/main/c++/jnidebug.h
	public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM.cc
	public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM.h
	public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM.cc
	public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM.h
	public/VectorPairHMM/src/main/c++/pairhmm-template-kernel.cc
	public/VectorPairHMM/src/main/c++/pairhmm-template-main.cc
	public/VectorPairHMM/src/main/c++/run.sh
	public/VectorPairHMM/src/main/c++/shift_template.c
	public/VectorPairHMM/src/main/c++/utils.cc
	public/VectorPairHMM/src/main/c++/utils.h
	public/VectorPairHMM/src/main/c++/vector_function_prototypes.h
---
 ...GraphBasedLikelihoodCalculationEngine.java |   4 +
 .../haplotypecaller/HaplotypeCaller.java      |   4 +-
 .../PairHMMLikelihoodCalculationEngine.java   |  42 +-
 .../RandomLikelihoodCalculationEngine.java    |   5 +
 .../utils/pairhmm/DebugJNILoglessPairHMM.java | 517 ++++++++++++++++++
 .../utils/pairhmm/JNILoglessPairHMM.java      |  63 +++
 .../utils/pairhmm/VectorLoglessPairHMM.java   | 335 ++++++++++++
 public/VectorPairHMM/README.md                |  71 +++
 public/VectorPairHMM/pom.xml                  | 119 ++++
 public/VectorPairHMM/src/main/c++/.gitignore  |  16 +
 .../src/main/c++/LoadTimeInitializer.cc       | 206 +++++++
 .../src/main/c++/LoadTimeInitializer.h        |  94 ++++
 public/VectorPairHMM/src/main/c++/Makefile    | 114 ++++
 public/VectorPairHMM/src/main/c++/Sandbox.cc  | 106 ++++
 public/VectorPairHMM/src/main/c++/Sandbox.h   |  96 ++++
 .../VectorPairHMM/src/main/c++/Sandbox.java   | 305 +++++++++++
 .../c++/Sandbox_JNIHaplotypeDataHolderClass.h |  13 +
 .../main/c++/Sandbox_JNIReadDataHolderClass.h |  13 +
 .../main/c++/avx_function_instantiations.cc   |  44 ++
 public/VectorPairHMM/src/main/c++/baseline.cc | 167 ++++++
 .../src/main/c++/define-double.h              | 205 +++++++
 .../VectorPairHMM/src/main/c++/define-float.h | 206 +++++++
 .../src/main/c++/define-sse-double.h          | 173 ++++++
 .../src/main/c++/define-sse-float.h           | 173 ++++++
 public/VectorPairHMM/src/main/c++/headers.h   |  71 +++
 .../VectorPairHMM/src/main/c++/jni_common.h   |  58 ++
 public/VectorPairHMM/src/main/c++/jnidebug.h  | 191 +++++++
 ...ng_utils_pairhmm_DebugJNILoglessPairHMM.cc | 176 ++++++
 ...ing_utils_pairhmm_DebugJNILoglessPairHMM.h |  96 ++++
 ...ting_utils_pairhmm_VectorLoglessPairHMM.cc | 382 +++++++++++++
 ...sting_utils_pairhmm_VectorLoglessPairHMM.h | 104 ++++
 .../src/main/c++/pairhmm-1-base.cc            |  70 +++
 .../src/main/c++/pairhmm-template-kernel.cc   | 380 +++++++++++++
 .../src/main/c++/pairhmm-template-main.cc     | 114 ++++
 public/VectorPairHMM/src/main/c++/run.sh      |  32 ++
 .../src/main/c++/shift_template.c             | 113 ++++
 .../main/c++/sse_function_instantiations.cc   |  43 ++
 public/VectorPairHMM/src/main/c++/template.h  | 320 +++++++++++
 public/VectorPairHMM/src/main/c++/utils.cc    | 493 +++++++++++++++++
 public/VectorPairHMM/src/main/c++/utils.h     |  75 +++
 .../VectorPairHMM/src/main/c++/vector_defs.h  |  55 ++
 .../src/main/c++/vector_function_prototypes.h |  44 ++
 public/sting-root/pom.xml                     |   6 +-
 .../utils/pairhmm/libVectorLoglessPairHMM.so  | Bin 0 -> 443803 bytes
 44 files changed, 5901 insertions(+), 13 deletions(-)
 create mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/pairhmm/DebugJNILoglessPairHMM.java
 create mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/pairhmm/JNILoglessPairHMM.java
 create mode 100644 protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/pairhmm/VectorLoglessPairHMM.java
 create mode 100644 public/VectorPairHMM/README.md
 create mode 100644 public/VectorPairHMM/pom.xml
 create mode 100644 public/VectorPairHMM/src/main/c++/.gitignore
 create mode 100644 public/VectorPairHMM/src/main/c++/LoadTimeInitializer.cc
 create mode 100644 public/VectorPairHMM/src/main/c++/LoadTimeInitializer.h
 create mode 100644 public/VectorPairHMM/src/main/c++/Makefile
 create mode 100644 public/VectorPairHMM/src/main/c++/Sandbox.cc
 create mode 100644 public/VectorPairHMM/src/main/c++/Sandbox.h
 create mode 100644 public/VectorPairHMM/src/main/c++/Sandbox.java
 create mode 100644 public/VectorPairHMM/src/main/c++/Sandbox_JNIHaplotypeDataHolderClass.h
 create mode 100644 public/VectorPairHMM/src/main/c++/Sandbox_JNIReadDataHolderClass.h
 create mode 100644 public/VectorPairHMM/src/main/c++/avx_function_instantiations.cc
 create mode 100644 public/VectorPairHMM/src/main/c++/baseline.cc
 create mode 100644 public/VectorPairHMM/src/main/c++/define-double.h
 create mode 100644 public/VectorPairHMM/src/main/c++/define-float.h
 create mode 100644 public/VectorPairHMM/src/main/c++/define-sse-double.h
 create mode 100644 public/VectorPairHMM/src/main/c++/define-sse-float.h
 create mode 100644 public/VectorPairHMM/src/main/c++/headers.h
 create mode 100644 public/VectorPairHMM/src/main/c++/jni_common.h
 create mode 100644 public/VectorPairHMM/src/main/c++/jnidebug.h
 create mode 100644 public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM.cc
 create mode 100644 public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM.h
 create mode 100644 public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM.cc
 create mode 100644 public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM.h
 create mode 100644 public/VectorPairHMM/src/main/c++/pairhmm-1-base.cc
 create mode 100644 public/VectorPairHMM/src/main/c++/pairhmm-template-kernel.cc
 create mode 100644 public/VectorPairHMM/src/main/c++/pairhmm-template-main.cc
 create mode 100755 public/VectorPairHMM/src/main/c++/run.sh
 create mode 100644 public/VectorPairHMM/src/main/c++/shift_template.c
 create mode 100644 public/VectorPairHMM/src/main/c++/sse_function_instantiations.cc
 create mode 100644 public/VectorPairHMM/src/main/c++/template.h
 create mode 100644 public/VectorPairHMM/src/main/c++/utils.cc
 create mode 100644 public/VectorPairHMM/src/main/c++/utils.h
 create mode 100644 public/VectorPairHMM/src/main/c++/vector_defs.h
 create mode 100644 public/VectorPairHMM/src/main/c++/vector_function_prototypes.h
 create mode 100644 public/sting-utils/src/main/resources/org/broadinstitute/sting/utils/pairhmm/libVectorLoglessPairHMM.so

diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/GraphBasedLikelihoodCalculationEngine.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/GraphBasedLikelihoodCalculationEngine.java
index 8a35ccb05..8b37e265d 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/GraphBasedLikelihoodCalculationEngine.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/GraphBasedLikelihoodCalculationEngine.java
@@ -155,4 +155,8 @@ public class GraphBasedLikelihoodCalculationEngine implements LikelihoodCalculat
             }
         }
     }
+
+    @Override
+    public void close() {
+    }
 }
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCaller.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCaller.java
index 91e763a0d..33dfa54ce 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCaller.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/HaplotypeCaller.java
@@ -433,7 +433,7 @@ public class HaplotypeCaller extends ActiveRegionWalker<List<VariantContext>, In
      */
     @Hidden
     @Argument(fullName = "pair_hmm_implementation", shortName = "pairHMM", doc = "The PairHMM implementation to use for genotype likelihood calculations", required = false)
-    public PairHMM.HMM_IMPLEMENTATION pairHMM = PairHMM.HMM_IMPLEMENTATION.LOGLESS_CACHING;
+    public PairHMM.HMM_IMPLEMENTATION pairHMM = PairHMM.HMM_IMPLEMENTATION.VECTOR_LOGLESS_CACHING;
 
     @Hidden
     @Argument(fullName="keepRG", shortName="keepRG", doc="Only use read from this read group when making calls (but use all reads to build the assembly)", required = false)
@@ -1051,7 +1051,7 @@ public class HaplotypeCaller extends ActiveRegionWalker<List<VariantContext>, In
         referenceConfidenceModel.close();
         //TODO remove the need to call close here for debugging, the likelihood output stream should be managed
         //TODO (open & close) at the walker, not the engine.
-        //likelihoodCalculationEngine.close();
+        likelihoodCalculationEngine.close();
         logger.info("Ran local assembly on " + result + " active regions");
     }
 
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/PairHMMLikelihoodCalculationEngine.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/PairHMMLikelihoodCalculationEngine.java
index 55a1c5dba..7a526f32e 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/PairHMMLikelihoodCalculationEngine.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/PairHMMLikelihoodCalculationEngine.java
@@ -86,17 +86,29 @@ public class PairHMMLikelihoodCalculationEngine implements LikelihoodCalculation
                 case EXACT: return new Log10PairHMM(true);
                 case ORIGINAL: return new Log10PairHMM(false);
                 case LOGLESS_CACHING:
-                    if (noFpga || !CnyPairHMM.isAvailable())
-                        return new LoglessPairHMM();
-                    else
-                        return new CnyPairHMM();
+                               if (noFpga || !CnyPairHMM.isAvailable())
+                                   return new LoglessPairHMM();
+                               else
+                                   return new CnyPairHMM();
+                case VECTOR_LOGLESS_CACHING:
+                               try
+                               {
+                                   return new VectorLoglessPairHMM();
+                               }
+                               catch(UnsatisfiedLinkError ule)
+                               {
+                                   logger.warn("Failed to load native library for VectorLoglessPairHMM - using Java implementation of LOGLESS_CACHING");
+                                   return new LoglessPairHMM();
+                               }
+                case DEBUG_VECTOR_LOGLESS_CACHING:
+                               return new DebugJNILoglessPairHMM(PairHMM.HMM_IMPLEMENTATION.VECTOR_LOGLESS_CACHING);
                 case ARRAY_LOGLESS:
-                    if (noFpga || !CnyPairHMM.isAvailable())
-                        return new ArrayLoglessPairHMM();
-                    else
-                        return new CnyPairHMM();
+                               if (noFpga || !CnyPairHMM.isAvailable())
+                                   return new ArrayLoglessPairHMM();
+                               else
+                                   return new CnyPairHMM();
                 default:
-                    throw new UserException.BadArgumentValue("pairHMM", "Specified pairHMM implementation is unrecognized or incompatible with the HaplotypeCaller. Acceptable options are ORIGINAL, EXACT, CACHING, LOGLESS_CACHING, and ARRAY_LOGLESS.");
+                               throw new UserException.BadArgumentValue("pairHMM", "Specified pairHMM implementation is unrecognized or incompatible with the HaplotypeCaller. Acceptable options are ORIGINAL, EXACT, CACHING, LOGLESS_CACHING, and ARRAY_LOGLESS.");
             }
         }
     };
@@ -164,8 +176,10 @@ public class PairHMMLikelihoodCalculationEngine implements LikelihoodCalculation
 
     public void close() {
         if ( likelihoodsStream != null ) likelihoodsStream.close();
+        pairHMMThreadLocal.get().close();
     }
 
+
     private void writeDebugLikelihoods(final GATKSAMRecord processedRead, final Haplotype haplotype, final double log10l){
         if ( WRITE_LIKELIHOODS_TO_FILE ) {
             likelihoodsStream.printf("%s %s %s %s %s %s %f%n",
@@ -327,7 +341,13 @@ public class PairHMMLikelihoodCalculationEngine implements LikelihoodCalculation
         }
 
         // initialize arrays to hold the probabilities of being in the match, insertion and deletion cases
-        pairHMMThreadLocal.get().initialize(X_METRIC_LENGTH, Y_METRIC_LENGTH);
+        pairHMMThreadLocal.get().initialize(haplotypes, perSampleReadList, X_METRIC_LENGTH, Y_METRIC_LENGTH);
+    }
+
+    private void finalizePairHMM()
+    {
+        pairHMMThreadLocal.get().finalizeRegion();
+>>>>>>> d968ca6... Added vectorized PairHMM implementation by Mohammad and Mustafa into the Maven build of GATK.
     }
 
 
@@ -347,6 +367,8 @@ public class PairHMMLikelihoodCalculationEngine implements LikelihoodCalculation
             map.filterPoorlyModelledReads(EXPECTED_ERROR_RATE_PER_BASE);
             stratifiedReadMap.put(sampleEntry.getKey(), map);
         }
+        //Used mostly by the JNI implementation(s) to free arrays
+        finalizePairHMM();
 
         return stratifiedReadMap;
     }
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/RandomLikelihoodCalculationEngine.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/RandomLikelihoodCalculationEngine.java
index b8dba7b86..d5d424ca9 100644
--- a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/RandomLikelihoodCalculationEngine.java
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/gatk/walkers/haplotypecaller/RandomLikelihoodCalculationEngine.java
@@ -79,4 +79,9 @@ public class RandomLikelihoodCalculationEngine implements LikelihoodCalculationE
 
         return result;
     }
+
+    @Override
+    public void close() {
+    }
+
 }
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/pairhmm/DebugJNILoglessPairHMM.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/pairhmm/DebugJNILoglessPairHMM.java
new file mode 100644
index 000000000..ea93ebe4a
--- /dev/null
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/pairhmm/DebugJNILoglessPairHMM.java
@@ -0,0 +1,517 @@
+/*
+*  By downloading the PROGRAM you agree to the following terms of use:
+*  
+*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
+*  
+*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
+*  
+*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
+*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
+*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
+*  
+*  1. DEFINITIONS
+*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
+*  
+*  2. LICENSE
+*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
+*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
+*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
+*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
+*  
+*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
+*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
+*  Copyright 2012 Broad Institute, Inc.
+*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
+*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
+*  
+*  4. INDEMNIFICATION
+*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
+*  
+*  5. NO REPRESENTATIONS OR WARRANTIES
+*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
+*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
+*  
+*  6. ASSIGNMENT
+*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
+*  
+*  7. MISCELLANEOUS
+*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
+*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
+*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
+*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
+*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
+*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
+*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
+*/
+
+package org.broadinstitute.sting.utils.pairhmm;
+
+import com.google.java.contract.Ensures;
+import com.google.java.contract.Requires;
+import org.broadinstitute.sting.utils.QualityUtils;
+
+import org.broadinstitute.sting.utils.genotyper.PerReadAlleleLikelihoodMap;
+import org.broadinstitute.sting.utils.haplotype.Haplotype;
+import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
+import org.broadinstitute.variant.variantcontext.Allele;
+import org.broadinstitute.sting.utils.exceptions.UserException;
+import static org.broadinstitute.sting.utils.pairhmm.PairHMMModel.*;
+
+import java.util.List;
+import java.util.Map;
+import java.util.HashMap;
+import java.io.File;
+import java.io.FileWriter;
+import java.io.BufferedWriter;
+import java.util.Map;
+import java.util.HashMap;
+import java.io.IOException;
+
+
+/**
+ * Created with IntelliJ IDEA.
+ * User: rpoplin, carneiro
+ * Date: 10/16/12
+ */
+public class DebugJNILoglessPairHMM extends LoglessPairHMM {
+
+    private static final boolean dumpSandboxOnly = false;        //simulates ifdef
+    private static final boolean debug = false;  //simulates ifdef
+    private static final boolean verify = !dumpSandboxOnly && (debug || true);        //simulates ifdef
+    private static final boolean debug0_1 = false;       //simulates ifdef
+    private static final boolean debug1 = false; //simulates ifdef
+    private static final boolean debug2 = false;
+    private static final boolean debug3 = false;
+   
+    //Debugging stats 
+    private int numCalls = 0;
+    private int numComputeLikelihoodCalls = 0;
+    protected HashMap<String, BufferedWriter> filenameToWriter = new HashMap<String, BufferedWriter>();
+
+    private JNILoglessPairHMM jniPairHMM = null;
+    public DebugJNILoglessPairHMM(final PairHMM.HMM_IMPLEMENTATION hmmType) {
+        super();
+        switch(hmmType) {
+            case VECTOR_LOGLESS_CACHING:
+                jniPairHMM = new VectorLoglessPairHMM();
+                break;
+            default:
+                throw new UserException.BadArgumentValue("pairHMM","Specified JNIPairHMM implementation is unrecognized or incompatible with     the HaplotypeCaller. Acceptable options are VECTOR_LOGLESS_CACHING"); 
+        }
+    }
+
+    @Override
+    public void close()
+    {
+        jniPairHMM.close();
+        debugClose();
+    }
+
+    //Used only when testing parts of the compute kernel
+    /**
+     * {@inheritDoc}
+     */
+    @Override
+    public void initialize( final int readMaxLength, final int haplotypeMaxLength ) {
+        if(verify)
+            super.initialize(readMaxLength, haplotypeMaxLength);
+        if(debug3)
+        {
+            System.out.println("Java: alloc initialized readMaxLength : "+readMaxLength+" haplotypeMaxLength : "+haplotypeMaxLength);
+            debugDump("lengths_java.txt", String.format("%d %d\n",readMaxLength, haplotypeMaxLength),
+                    true);
+        }
+        if(debug2)
+            jniInitialize(readMaxLength, haplotypeMaxLength);
+    }
+
+    private HashMap<Haplotype,Integer> haplotypeToHaplotypeListIdxMap = null;
+    //Used to transfer data to JNI
+    //Since the haplotypes are the same for all calls to computeLikelihoods within a region, transfer the haplotypes only once to the JNI per region
+    /**
+     * {@inheritDoc}
+     */
+    @Override
+    public void initialize( final List<Haplotype> haplotypes, final Map<String, List<GATKSAMRecord>> perSampleReadList,
+            final int readMaxLength, final int haplotypeMaxLength ) {
+        if(verify)
+        {
+            super.initialize(haplotypes, perSampleReadList, readMaxLength, haplotypeMaxLength);
+            jniPairHMM.initialize(haplotypes, perSampleReadList, readMaxLength, haplotypeMaxLength);
+            haplotypeToHaplotypeListIdxMap = jniPairHMM.getHaplotypeToHaplotypeListIdxMap();
+        }
+    }
+
+    /**
+     * {@inheritDoc}
+     */
+    @Override
+    public void finalizeRegion()
+    {
+        if(!dumpSandboxOnly)
+            jniPairHMM.finalizeRegion();
+    }
+
+    /**
+     * {@inheritDoc}
+     */
+    @Override
+    public PerReadAlleleLikelihoodMap computeLikelihoods( final List<GATKSAMRecord> reads, final Map<Allele, Haplotype> alleleHaplotypeMap, final Map<GATKSAMRecord, byte[]> GCPArrayMap ) {
+        // (re)initialize the pairHMM only if necessary
+        final int readMaxLength = verify ? findMaxReadLength(reads) : 0;
+        final int haplotypeMaxLength = verify ? findMaxHaplotypeLength(alleleHaplotypeMap) : 0;
+        if(verify)
+        {
+            if (!initialized || readMaxLength > maxReadLength || haplotypeMaxLength > maxHaplotypeLength)
+            { initialize(readMaxLength, haplotypeMaxLength); }
+            if ( ! initialized )
+                throw new IllegalStateException("Must call initialize before calling jniComputeLikelihoods in debug/verify mode");
+        }
+        int readListSize = reads.size();
+        int numHaplotypes = alleleHaplotypeMap.size();
+        int numTestcases = readListSize*numHaplotypes;
+        if(debug0_1)
+            System.out.println("Java numReads "+readListSize+" numHaplotypes "+numHaplotypes);
+        int idx = 0;
+        for(GATKSAMRecord read : reads)
+        {
+            byte [] overallGCP = GCPArrayMap.get(read);
+            if(debug0_1)
+                System.out.println("Java read length "+read.getReadBases().length);
+            if(debug3)
+            {
+                for(int i=0;i<read.getReadBases().length;++i)
+                {
+                    debugDump("reads_java.txt",String.format("%d\n",(int)read.getReadBases()[i]),true);
+                    debugDump("reads_java.txt",String.format("%d\n",(int)read.getBaseQualities()[i]),true);
+                    debugDump("reads_java.txt",String.format("%d\n",(int)read.getBaseInsertionQualities()[i]),true);
+                    debugDump("reads_java.txt",String.format("%d\n",(int)read.getBaseDeletionQualities()[i]),true);
+                    debugDump("reads_java.txt",String.format("%d\n",(int)overallGCP[i]),true);
+                }
+            }
+            ++idx;
+        }
+
+        if(verify)
+        {
+            idx = 0;
+            for (Map.Entry<Allele, Haplotype>  currEntry : alleleHaplotypeMap.entrySet())       //order is important - access in same order always
+            {
+                byte[] haplotypeBases = currEntry.getValue().getBases();
+                if(debug0_1)
+                    System.out.println("Java haplotype length "+haplotypeBases.length);
+                if(debug3)
+                {
+                    for(int i=0;i<haplotypeBases.length;++i)
+                        debugDump("haplotype_bases_java.txt",String.format("%d\n",(int)haplotypeBases[i]),true);
+                }
+                ++idx;
+            }
+        }
+        double[] likelihoodArray = null;
+        PerReadAlleleLikelihoodMap likelihoodMap  = null;
+        if(verify)
+        {
+            jniPairHMM.computeLikelihoods(reads, alleleHaplotypeMap, GCPArrayMap);
+            likelihoodArray = jniPairHMM.getLikelihoodArray();
+            //to compare values
+            likelihoodMap = super.computeLikelihoods(reads, alleleHaplotypeMap, GCPArrayMap);
+        }
+        else
+        {
+            likelihoodMap = new PerReadAlleleLikelihoodMap();
+            likelihoodArray = new double[numTestcases];
+            for(int i=0;i<numTestcases;++i)
+                likelihoodArray[i] = -0.5;
+        }
+        if(verify || dumpSandboxOnly)
+        {
+            boolean toDump = dumpSandboxOnly ? true : false;
+            if(verify)
+            {
+                //re-order values in likelihoodArray
+                double[] tmpArray = new double[numHaplotypes];
+                idx = 0;
+                int idxInsideHaplotypeList = 0;
+                int readIdx = 0;
+                for(GATKSAMRecord read : reads)
+                {
+                    for(int j=0;j<numHaplotypes;++j)
+                        tmpArray[j] = likelihoodArray[readIdx+j];
+                    for (Map.Entry<Allele, Haplotype>  currEntry : alleleHaplotypeMap.entrySet())//order is important - access in same order always
+                    {
+                        idxInsideHaplotypeList = haplotypeToHaplotypeListIdxMap.get(currEntry.getValue());
+                        likelihoodArray[idx] = tmpArray[idxInsideHaplotypeList];
+                        ++idx;
+                    }
+                    readIdx += numHaplotypes;
+                }
+                //for floating point values, no exact equality
+                //check whether numbers are close in terms of abs_error or relative_error
+                //For very large values, relative_error is relevant
+                //For very small values, abs_error is relevant
+                for(int i=0;i<likelihoodArray.length;++i)
+                {
+                    double abs_error = Math.abs(likelihoodArray[i] - mLikelihoodArray[i]);
+                    double relative_error = 0;
+                    if(mLikelihoodArray[i] == 0)
+                        relative_error = 0;
+                    else
+                        relative_error = Math.abs(abs_error/mLikelihoodArray[i]);
+                    if(abs_error > 1e-5 && relative_error > 1e-5)
+                    {
+                        toDump = true;
+                        break;
+                    }
+                }
+            }
+            //if numbers are not close, then dump out the data that produced the inconsistency
+            if(toDump)
+            {
+                idx = 0;
+                System.out.println("Dump : Java numReads "+readListSize+" numHaplotypes "+numHaplotypes);
+                boolean firstLine = true;
+                for(GATKSAMRecord read : reads)
+                {
+                    byte [] overallGCP = GCPArrayMap.get(read);
+                    byte[] tmpByteArray = new byte[read.getReadBases().length];
+                    for (Map.Entry<Allele, Haplotype>  currEntry : alleleHaplotypeMap.entrySet())       //order is important - access in same order always
+                    {
+                        byte[] haplotypeBases = currEntry.getValue().getBases();
+                        debugDump("debug_dump.txt",new String(haplotypeBases)+" ",true);
+                        debugDump("debug_dump.txt",new String(read.getReadBases())+" ",true);
+                        for(int k=0;k<read.getReadBases().length;++k)
+                            tmpByteArray[k] = (byte)((int)((read.getBaseQualities())[k]) + 33);
+                        debugDump("debug_dump.txt",new String(tmpByteArray)+" ",true);
+                        for(int k=0;k<read.getReadBases().length;++k)
+                            tmpByteArray[k] = (byte)((int)((read.getBaseInsertionQualities())[k]) + 33);
+                        debugDump("debug_dump.txt",new String(tmpByteArray)+" ",true);
+                        for(int k=0;k<read.getReadBases().length;++k)
+                            tmpByteArray[k] = (byte)((int)((read.getBaseDeletionQualities())[k]) + 33);
+                        debugDump("debug_dump.txt",new String(tmpByteArray)+" ",true);
+                        for(int k=0;k<read.getReadBases().length;++k)
+                            tmpByteArray[k] = (byte)((int)(overallGCP[k]) + 33);
+                        debugDump("debug_dump.txt",new String(tmpByteArray),true);
+                        if(firstLine)
+                        {
+                            debugDump("debug_dump.txt",String.format(" %d %d\n",readListSize, numHaplotypes), true);
+                            firstLine = false;
+                        }
+                        else
+                            debugDump("debug_dump.txt","\n",true);
+                        if(verify)
+                            debugDump("debug_results.txt",String.format("%e %e\n",mLikelihoodArray[idx],likelihoodArray[idx]),true);
+                        else
+                            if(dumpSandboxOnly)
+                                likelihoodMap.add(read, currEntry.getKey(), likelihoodArray[idx]);
+                        ++idx;
+                    }
+                }
+            }   
+            debugClose();
+        }
+        ++numComputeLikelihoodCalls;
+        //if(numComputeLikelihoodCalls == 5)
+        //jniPairHMM.close();
+        //System.exit(0);
+        return likelihoodMap;
+    }
+
+    //Used to test parts of the compute kernel separately    
+    private native void jniInitialize( final int readMaxLength, final int haplotypeMaxLength);
+    private native static void jniInitializeProbabilities( final double[][] transition, final byte[] insertionGOP,
+            final byte[] deletionGOP, final byte[] overallGCP);
+    private native double jniInitializePriorsAndUpdateCells( boolean doInitialization, final int paddedReadLength,
+            final int paddedHaplotypeLength, final byte[] readBases, final byte[] haplotypeBases, final byte[] readQuals,
+            final int hapStartIndex);
+    private native double jniSubComputeReadLikelihoodGivenHaplotypeLog10( final int readLength, final int haplotypeLength,
+            final byte[] readBases, final byte[] haplotypeBases, final byte[] readQuals, final byte[] insertionGOP,
+            final byte[] deletionGOP, final byte[] overallGCP, final int hapStartIndex);
+    /**
+     * {@inheritDoc}
+     */
+    @Override
+    public double subComputeReadLikelihoodGivenHaplotypeLog10( final byte[] haplotypeBases,  final byte[] readBases,
+            final byte[] readQuals, final byte[] insertionGOP, final byte[] deletionGOP, final byte[] overallGCP,
+            final int hapStartIndex, final boolean recacheReadValues, final int nextHapStartIndex) {
+        //System.out.println("#### START STACK TRACE ####");
+        //for (StackTraceElement ste : Thread.currentThread().getStackTrace()) {
+        //System.out.println(ste);
+        //}
+        //System.out.println("#### END STACK TRACE ####");
+        //
+        if(debug1)
+            jniSubComputeReadLikelihoodGivenHaplotypeLog10(readBases.length, haplotypeBases.length,
+                    readBases, haplotypeBases, readQuals,
+                    insertionGOP, deletionGOP, overallGCP,
+                    hapStartIndex);
+
+        boolean doInitialization = (previousHaplotypeBases == null || previousHaplotypeBases.length != haplotypeBases.length);
+        if (doInitialization) {
+            final double initialValue = INITIAL_CONDITION / haplotypeBases.length;
+            // set the initial value (free deletions in the beginning) for the first row in the deletion matrix
+            for( int j = 0; j < paddedHaplotypeLength; j++ ) {
+                deletionMatrix[0][j] = initialValue;
+            }
+        }
+
+        if ( ! constantsAreInitialized || recacheReadValues ) {
+            initializeProbabilities(transition, insertionGOP, deletionGOP, overallGCP); 
+            if(debug3)
+            {
+                System.out.println("Java: initializeProbabilities lengths : "+insertionGOP.length+" padded "+paddedReadLength+" "+paddedHaplotypeLength);
+                for(int i=0;i<insertionGOP.length;++i)
+                    for(int j=0;j<6;++j)
+                        debugDump("transitions_java.txt",String.format("%e\n",transition[i+1][j]),true);
+            }
+            if(debug2)
+                jniInitializeProbabilities(transition, insertionGOP, deletionGOP, overallGCP); 
+
+            // note that we initialized the constants
+            constantsAreInitialized = true;
+        }
+
+        if(debug3)
+            System.out.println("Java: initializePriors : lengths "+readBases.length+" "+haplotypeBases.length+" padded "+paddedReadLength+" "+paddedHaplotypeLength + " doNotUseTristateCorrection "+doNotUseTristateCorrection);
+        initializePriors(haplotypeBases, readBases, readQuals, hapStartIndex);
+
+        for (int i = 1; i < paddedReadLength; i++) {
+            // +1 here is because hapStartIndex is 0-based, but our matrices are 1 based
+            for (int j = hapStartIndex+1; j < paddedHaplotypeLength; j++) {
+                updateCell(i, j, prior[i][j], transition[i]);
+            }
+        }
+
+        // final probability is the log10 sum of the last element in the Match and Insertion state arrays
+        // this way we ignore all paths that ended in deletions! (huge)
+        // but we have to sum all the paths ending in the M and I matrices, because they're no longer extended.
+        final int endI = paddedReadLength - 1;
+        double finalSumProbabilities = 0.0;
+        for (int j = 1; j < paddedHaplotypeLength; j++) {
+            finalSumProbabilities += matchMatrix[endI][j] + insertionMatrix[endI][j];
+        }
+        if(debug2)
+            jniInitializePriorsAndUpdateCells(doInitialization, paddedReadLength, paddedHaplotypeLength,
+                    readBases, haplotypeBases, readQuals,
+                    hapStartIndex);
+        if(debug)
+            debugDump("return_values_java.txt",String.format("%e\n",Math.log10(finalSumProbabilities) - INITIAL_CONDITION_LOG10),true);
+        ++numCalls;
+        //if(numCalls == 100)
+        //{
+        //debugClose();
+        //System.exit(0);
+        //}
+        return Math.log10(finalSumProbabilities) - INITIAL_CONDITION_LOG10;
+    }
+
+    /**
+     * Initializes the matrix that holds all the constants related to the editing
+     * distance between the read and the haplotype.
+     *
+     * @param haplotypeBases the bases of the haplotype
+     * @param readBases      the bases of the read
+     * @param readQuals      the base quality scores of the read
+     * @param startIndex     where to start updating the distanceMatrix (in case this read is similar to the previous read)
+     */
+    protected void initializePriors(final byte[] haplotypeBases, final byte[] readBases, final byte[] readQuals, final int startIndex) {
+
+        // initialize the pBaseReadLog10 matrix for all combinations of read x haplotype bases
+        // Abusing the fact that java initializes arrays with 0.0, so no need to fill in rows and columns below 2.
+
+        if(debug3)
+            System.out.println("hapStartIndex "+startIndex);
+
+        for (int i = 0; i < readBases.length; i++) {
+            final byte x = readBases[i];
+            final byte qual = readQuals[i];
+            for (int j = startIndex; j < haplotypeBases.length; j++) {
+                final byte y = haplotypeBases[j];
+                prior[i+1][j+1] = ( x == y || x == (byte) 'N' || y == (byte) 'N' ?
+                        QualityUtils.qualToProb(qual) : (QualityUtils.qualToErrorProb(qual) / (doNotUseTristateCorrection ? 1.0 : TRISTATE_CORRECTION)) );
+                if(debug3)
+                    debugDump("priors_java.txt",String.format("%e\n",prior[i+1][j+1]),true);
+            }
+        }
+    }
+
+    /**
+     * Initializes the matrix that holds all the constants related to quality scores.
+     *
+     * @param insertionGOP   insertion quality scores of the read
+     * @param deletionGOP    deletion quality scores of the read
+     * @param overallGCP     overall gap continuation penalty
+     */
+    @Requires({
+        "insertionGOP != null",
+        "deletionGOP != null",
+        "overallGCP != null"
+    })
+    @Ensures("constantsAreInitialized")
+    protected static void initializeProbabilities(final double[][] transition, final byte[] insertionGOP, final byte[] deletionGOP, final byte[] overallGCP) {
+        PairHMMModel.qualToTransProbs(transition,insertionGOP,deletionGOP,overallGCP);
+    }
+
+    /**
+     * Updates a cell in the HMM matrix
+     *
+     * The read and haplotype indices are offset by one because the state arrays have an extra column to hold the
+     * initial conditions
+
+     * @param indI             row index in the matrices to update
+     * @param indJ             column index in the matrices to update
+     * @param prior            the likelihood editing distance matrix for the read x haplotype
+     * @param transition        an array with the six transition relevant to this location
+     */
+    protected void updateCell( final int indI, final int indJ, final double prior, final double[] transition) {
+
+        matchMatrix[indI][indJ] = prior * ( matchMatrix[indI - 1][indJ - 1] * transition[matchToMatch] +
+                insertionMatrix[indI - 1][indJ - 1] * transition[indelToMatch] +
+                deletionMatrix[indI - 1][indJ - 1] * transition[indelToMatch] );
+        insertionMatrix[indI][indJ] = matchMatrix[indI - 1][indJ] * transition[matchToInsertion] + insertionMatrix[indI - 1][indJ] * transition[insertionToInsertion];
+        deletionMatrix[indI][indJ] = matchMatrix[indI][indJ - 1] * transition[matchToDeletion] + deletionMatrix[indI][indJ - 1] * transition[deletionToDeletion];
+        if(debug3)
+        {
+            debugDump("matrices_java.txt",String.format("%e\n",matchMatrix[indI][indJ]),true);
+            debugDump("matrices_java.txt",String.format("%e\n",insertionMatrix[indI][indJ]),true);
+            debugDump("matrices_java.txt",String.format("%e\n",deletionMatrix[indI][indJ]),true);
+        }
+    }
+
+    protected void debugDump( String filename, String s, boolean toAppend ) {
+        try {
+            File file = new File(filename);
+            if (!file.exists())
+                file.createNewFile();
+            BufferedWriter currWriter = filenameToWriter.get(filename);
+            if(currWriter == null)
+            {
+                FileWriter fw = new FileWriter(file, toAppend);
+                currWriter = new BufferedWriter(fw);
+                filenameToWriter.put(filename, currWriter);
+            }
+            currWriter.write(s);
+        }
+        catch(IOException e)
+        {
+            e.printStackTrace();
+        }
+    }
+
+    protected void debugClose()  {
+        for(Map.Entry<String, BufferedWriter> currEntry : filenameToWriter.entrySet()) {
+            BufferedWriter currWriter = currEntry.getValue();
+            try
+            {
+                currWriter.flush();
+                currWriter.close();
+            }
+            catch(IOException e)
+            {
+                e.printStackTrace();
+
+            }
+        }
+        filenameToWriter.clear();
+    }
+}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/pairhmm/JNILoglessPairHMM.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/pairhmm/JNILoglessPairHMM.java
new file mode 100644
index 000000000..f039cc295
--- /dev/null
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/pairhmm/JNILoglessPairHMM.java
@@ -0,0 +1,63 @@
+/*
+*  By downloading the PROGRAM you agree to the following terms of use:
+*  
+*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
+*  
+*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
+*  
+*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
+*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
+*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
+*  
+*  1. DEFINITIONS
+*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
+*  
+*  2. LICENSE
+*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
+*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
+*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
+*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
+*  
+*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
+*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
+*  Copyright 2012 Broad Institute, Inc.
+*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
+*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
+*  
+*  4. INDEMNIFICATION
+*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
+*  
+*  5. NO REPRESENTATIONS OR WARRANTIES
+*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
+*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
+*  
+*  6. ASSIGNMENT
+*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
+*  
+*  7. MISCELLANEOUS
+*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
+*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
+*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
+*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
+*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
+*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
+*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
+*/
+
+package org.broadinstitute.sting.utils.pairhmm;
+
+import org.broadinstitute.sting.utils.haplotype.Haplotype;
+
+import java.util.HashMap;
+
+
+/**
+ * Created with IntelliJ IDEA.
+ * User: rpoplin, carneiro
+ * Date: 10/16/12
+ */
+public abstract class JNILoglessPairHMM extends LoglessPairHMM {
+    public abstract HashMap<Haplotype, Integer> getHaplotypeToHaplotypeListIdxMap();
+    protected long setupTime = 0;
+    
+}
diff --git a/protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/pairhmm/VectorLoglessPairHMM.java b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/pairhmm/VectorLoglessPairHMM.java
new file mode 100644
index 000000000..a32768c20
--- /dev/null
+++ b/protected/gatk-protected/src/main/java/org/broadinstitute/sting/utils/pairhmm/VectorLoglessPairHMM.java
@@ -0,0 +1,335 @@
+/*
+*  By downloading the PROGRAM you agree to the following terms of use:
+*  
+*  BROAD INSTITUTE - SOFTWARE LICENSE AGREEMENT - FOR ACADEMIC NON-COMMERCIAL RESEARCH PURPOSES ONLY
+*  
+*  This Agreement is made between the Broad Institute, Inc. with a principal address at 7 Cambridge Center, Cambridge, MA 02142 (BROAD) and the LICENSEE and is effective at the date the downloading is completed (EFFECTIVE DATE).
+*  
+*  WHEREAS, LICENSEE desires to license the PROGRAM, as defined hereinafter, and BROAD wishes to have this PROGRAM utilized in the public interest, subject only to the royalty-free, nonexclusive, nontransferable license rights of the United States Government pursuant to 48 CFR 52.227-14; and
+*  WHEREAS, LICENSEE desires to license the PROGRAM and BROAD desires to grant a license on the following terms and conditions.
+*  NOW, THEREFORE, in consideration of the promises and covenants made herein, the parties hereto agree as follows:
+*  
+*  1. DEFINITIONS
+*  1.1 PROGRAM shall mean copyright in the object code and source code known as GATK2 and related documentation, if any, as they exist on the EFFECTIVE DATE and can be downloaded from http://www.broadinstitute/GATK on the EFFECTIVE DATE.
+*  
+*  2. LICENSE
+*  2.1   Grant. Subject to the terms of this Agreement, BROAD hereby grants to LICENSEE, solely for academic non-commercial research purposes, a non-exclusive, non-transferable license to: (a) download, execute and display the PROGRAM and (b) create bug fixes and modify the PROGRAM. 
+*  The LICENSEE may apply the PROGRAM in a pipeline to data owned by users other than the LICENSEE and provide these users the results of the PROGRAM provided LICENSEE does so for academic non-commercial purposes only.  For clarification purposes, academic sponsored research is not a commercial use under the terms of this Agreement.
+*  2.2  No Sublicensing or Additional Rights. LICENSEE shall not sublicense or distribute the PROGRAM, in whole or in part, without prior written permission from BROAD.  LICENSEE shall ensure that all of its users agree to the terms of this Agreement.  LICENSEE further agrees that it shall not put the PROGRAM on a network, server, or other similar technology that may be accessed by anyone other than the LICENSEE and its employees and users who have agreed to the terms of this agreement.
+*  2.3  License Limitations. Nothing in this Agreement shall be construed to confer any rights upon LICENSEE by implication, estoppel, or otherwise to any computer software, trademark, intellectual property, or patent rights of BROAD, or of any other entity, except as expressly granted herein. LICENSEE agrees that the PROGRAM, in whole or part, shall not be used for any commercial purpose, including without limitation, as the basis of a commercial software or hardware product or to provide services. LICENSEE further agrees that the PROGRAM shall not be copied or otherwise adapted in order to circumvent the need for obtaining a license for use of the PROGRAM.  
+*  
+*  3. OWNERSHIP OF INTELLECTUAL PROPERTY 
+*  LICENSEE acknowledges that title to the PROGRAM shall remain with BROAD. The PROGRAM is marked with the following BROAD copyright notice and notice of attribution to contributors. LICENSEE shall retain such notice on all copies.  LICENSEE agrees to include appropriate attribution if any results obtained from use of the PROGRAM are included in any publication.
+*  Copyright 2012 Broad Institute, Inc.
+*  Notice of attribution:  The GATK2 program was made available through the generosity of Medical and Population Genetics program at the Broad Institute, Inc.
+*  LICENSEE shall not use any trademark or trade name of BROAD, or any variation, adaptation, or abbreviation, of such marks or trade names, or any names of officers, faculty, students, employees, or agents of BROAD except as states above for attribution purposes.
+*  
+*  4. INDEMNIFICATION
+*  LICENSEE shall indemnify, defend, and hold harmless BROAD, and their respective officers, faculty, students, employees, associated investigators and agents, and their respective successors, heirs and assigns, (Indemnitees), against any liability, damage, loss, or expense (including reasonable attorneys fees and expenses) incurred by or imposed upon any of the Indemnitees in connection with any claims, suits, actions, demands or judgments arising out of any theory of liability (including, without limitation, actions in the form of tort, warranty, or strict liability and regardless of whether such action has any factual basis) pursuant to any right or license granted under this Agreement.
+*  
+*  5. NO REPRESENTATIONS OR WARRANTIES
+*  THE PROGRAM IS DELIVERED AS IS.  BROAD MAKES NO REPRESENTATIONS OR WARRANTIES OF ANY KIND CONCERNING THE PROGRAM OR THE COPYRIGHT, EXPRESS OR IMPLIED, INCLUDING, WITHOUT LIMITATION, WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, NONINFRINGEMENT, OR THE ABSENCE OF LATENT OR OTHER DEFECTS, WHETHER OR NOT DISCOVERABLE. BROAD EXTENDS NO WARRANTIES OF ANY KIND AS TO PROGRAM CONFORMITY WITH WHATEVER USER MANUALS OR OTHER LITERATURE MAY BE ISSUED FROM TIME TO TIME.
+*  IN NO EVENT SHALL BROAD OR ITS RESPECTIVE DIRECTORS, OFFICERS, EMPLOYEES, AFFILIATED INVESTIGATORS AND AFFILIATES BE LIABLE FOR INCIDENTAL OR CONSEQUENTIAL DAMAGES OF ANY KIND, INCLUDING, WITHOUT LIMITATION, ECONOMIC DAMAGES OR INJURY TO PROPERTY AND LOST PROFITS, REGARDLESS OF WHETHER BROAD SHALL BE ADVISED, SHALL HAVE OTHER REASON TO KNOW, OR IN FACT SHALL KNOW OF THE POSSIBILITY OF THE FOREGOING.
+*  
+*  6. ASSIGNMENT
+*  This Agreement is personal to LICENSEE and any rights or obligations assigned by LICENSEE without the prior written consent of BROAD shall be null and void.
+*  
+*  7. MISCELLANEOUS
+*  7.1 Export Control. LICENSEE gives assurance that it will comply with all United States export control laws and regulations controlling the export of the PROGRAM, including, without limitation, all Export Administration Regulations of the United States Department of Commerce. Among other things, these laws and regulations prohibit, or require a license for, the export of certain types of software to specified countries.
+*  7.2 Termination. LICENSEE shall have the right to terminate this Agreement for any reason upon prior written notice to BROAD. If LICENSEE breaches any provision hereunder, and fails to cure such breach within thirty (30) days, BROAD may terminate this Agreement immediately. Upon termination, LICENSEE shall provide BROAD with written assurance that the original and all copies of the PROGRAM have been destroyed, except that, upon prior written authorization from BROAD, LICENSEE may retain a copy for archive purposes.
+*  7.3 Survival. The following provisions shall survive the expiration or termination of this Agreement: Articles 1, 3, 4, 5 and Sections 2.2, 2.3, 7.3, and 7.4.
+*  7.4 Notice. Any notices under this Agreement shall be in writing, shall specifically refer to this Agreement, and shall be sent by hand, recognized national overnight courier, confirmed facsimile transmission, confirmed electronic mail, or registered or certified mail, postage prepaid, return receipt requested.  All notices under this Agreement shall be deemed effective upon receipt. 
+*  7.5 Amendment and Waiver; Entire Agreement. This Agreement may be amended, supplemented, or otherwise modified only by means of a written instrument signed by all parties. Any waiver of any rights or failure to act in a specific instance shall relate only to such instance and shall not be construed as an agreement to waive any rights or fail to act in any other instance, whether or not similar. This Agreement constitutes the entire agreement among the parties with respect to its subject matter and supersedes prior agreements or understandings between the parties relating to its subject matter. 
+*  7.6 Binding Effect; Headings. This Agreement shall be binding upon and inure to the benefit of the parties and their respective permitted successors and assigns. All headings are for convenience only and shall not affect the meaning of any provision of this Agreement.
+*  7.7 Governing Law. This Agreement shall be construed, governed, interpreted and applied in accordance with the internal laws of the Commonwealth of Massachusetts, U.S.A., without regard to conflict of laws principles.
+*/
+
+package org.broadinstitute.sting.utils.pairhmm;
+
+import com.google.java.contract.Ensures;
+import com.google.java.contract.Requires;
+import org.broadinstitute.sting.utils.QualityUtils;
+
+import org.broadinstitute.sting.utils.genotyper.PerReadAlleleLikelihoodMap;
+import org.broadinstitute.sting.utils.haplotype.Haplotype;
+import org.broadinstitute.sting.utils.sam.GATKSAMRecord;
+import org.broadinstitute.variant.variantcontext.Allele;
+
+import java.util.List;
+import java.util.Map;
+import java.util.HashMap;
+
+//For loading library from jar
+import java.io.File;
+import java.io.FileNotFoundException;
+import java.io.FileOutputStream;
+import java.io.IOException;
+import java.io.InputStream;
+import java.io.OutputStream;
+
+/**
+ * Created with IntelliJ IDEA.
+ * User: rpoplin, carneiro
+ * Date: 10/16/12
+ */
+public class VectorLoglessPairHMM extends JNILoglessPairHMM {
+
+    //For machine capabilities
+    public static final long sse41Mask = 1;
+    public static final long sse42Mask = 2;
+    public static final long avxMask = 4;
+    public static final long enableAll = 0xFFFFFFFFFFFFFFFFl;
+
+    //Used to copy references to byteArrays to JNI from reads
+    protected class JNIReadDataHolderClass {
+        public byte[] readBases = null;
+        public byte[] readQuals = null;
+        public byte[] insertionGOP = null;
+        public byte[] deletionGOP = null;
+        public byte[] overallGCP = null;
+    }
+
+    //Used to copy references to byteArrays to JNI from haplotypes
+    protected class JNIHaplotypeDataHolderClass {
+        public byte[] haplotypeBases = null;
+    }
+
+    /**
+     * Return 64-bit mask representing machine capabilities
+     * Bit 0 is LSB, bit 63 MSB
+     * Bit 0 represents sse4.1 availability
+     * Bit 1 represents sse4.2 availability
+     * Bit 2 represents AVX availability
+     */
+    public native long jniGetMachineType();
+    
+    /**
+     * Function to initialize the fields of JNIReadDataHolderClass and JNIHaplotypeDataHolderClass from JVM.
+     * C++ codegets FieldIDs for these classes once and re-uses these IDs for the remainder of the program. Field IDs do not
+     * change per JVM session
+     * @param readDataHolderClass class type of JNIReadDataHolderClass
+     * @param haplotypeDataHolderClass class type of JNIHaplotypeDataHolderClass
+     * @param mask mask is a 64 bit integer identical to the one received from jniGetMachineType(). Users can disable usage of some hardware features by zeroing some bits in the mask
+     * */
+    private native void jniInitializeClassFieldsAndMachineMask(Class<?> readDataHolderClass, Class<?> haplotypeDataHolderClass, long mask);
+
+    private static Boolean isVectorLoglessPairHMMLibraryLoaded = false;
+    //The constructor is called only once inside PairHMMLikelihoodCalculationEngine
+    public VectorLoglessPairHMM() {
+        super();
+        synchronized(isVectorLoglessPairHMMLibraryLoaded) {
+            //Load the library and initialize the FieldIDs
+            if(!isVectorLoglessPairHMMLibraryLoaded) {
+                try
+                {
+                    //Try loading from Java's library path first
+                    //Useful if someone builds his/her own library and wants to override the bundled
+                    //implementation without modifying the Java code
+                    System.loadLibrary("VectorLoglessPairHMM");
+                    logger.info("libVectorLoglessPairHMM found in JVM library path");
+                }
+                catch(UnsatisfiedLinkError ule)
+                {
+                    //Could not load from Java's library path - try unpacking from jar
+                    try
+                    {
+                        logger.info("libVectorLoglessPairHMM not found in JVM library path - trying to unpack from StingUtils.jar");
+                        loadLibraryFromJar("/org/broadinstitute/sting/utils/pairhmm/libVectorLoglessPairHMM.so");
+                        logger.info("libVectorLoglessPairHMM unpacked successfully from StingUtils.jar");
+                    }
+                    catch(IOException ioe)
+                    {
+                        //Throw the UnsatisfiedLinkError to make it clear to the user what failed
+                        throw ule;
+                    }
+                }
+
+                isVectorLoglessPairHMMLibraryLoaded = true;
+                jniInitializeClassFieldsAndMachineMask(JNIReadDataHolderClass.class, JNIHaplotypeDataHolderClass.class, enableAll);        //need to do this only once
+            }
+        }
+    }
+
+    private native void jniInitializeHaplotypes(final int numHaplotypes,  JNIHaplotypeDataHolderClass[] haplotypeDataArray);
+    //Hold the mapping between haplotype and index in the list of Haplotypes passed to initialize
+    //Use this mapping in computeLikelihoods to find the likelihood value corresponding to a given Haplotype
+    private HashMap<Haplotype,Integer> haplotypeToHaplotypeListIdxMap = new HashMap<Haplotype,Integer>();
+    @Override
+    public HashMap<Haplotype, Integer> getHaplotypeToHaplotypeListIdxMap() { return haplotypeToHaplotypeListIdxMap; }
+    
+    //Used to transfer data to JNI
+    //Since the haplotypes are the same for all calls to computeLikelihoods within a region, transfer the haplotypes only once to the JNI per region
+    /**
+     * {@inheritDoc}
+     */
+    @Override
+    public void initialize( final List<Haplotype> haplotypes, final Map<String, List<GATKSAMRecord>> perSampleReadList,
+            final int readMaxLength, final int haplotypeMaxLength ) {
+        int numHaplotypes = haplotypes.size();
+        JNIHaplotypeDataHolderClass[] haplotypeDataArray = new JNIHaplotypeDataHolderClass[numHaplotypes];
+        int idx = 0;
+        haplotypeToHaplotypeListIdxMap.clear();
+        for(final Haplotype currHaplotype : haplotypes)
+        {
+            haplotypeDataArray[idx] = new JNIHaplotypeDataHolderClass();
+            haplotypeDataArray[idx].haplotypeBases = currHaplotype.getBases();
+            haplotypeToHaplotypeListIdxMap.put(currHaplotype, idx);
+            ++idx;
+        }
+        jniInitializeHaplotypes(numHaplotypes, haplotypeDataArray);
+    }
+    /**
+     * Tell JNI to release arrays - really important if native code is directly accessing Java memory, if not
+     * accessing Java memory directly, still important to release memory from C++
+     */
+    private native void jniFinalizeRegion();
+
+    /**
+     * {@inheritDoc}
+     */
+    @Override
+    public void finalizeRegion()
+    {
+        jniFinalizeRegion();
+    }
+
+    /**
+     * Real compute kernel
+     */
+    private native void jniComputeLikelihoods(int numReads, int numHaplotypes, JNIReadDataHolderClass[] readDataArray,
+            JNIHaplotypeDataHolderClass[] haplotypeDataArray, double[] likelihoodArray, int maxNumThreadsToUse);
+    /**
+     * {@inheritDoc}
+     */
+    @Override
+    public PerReadAlleleLikelihoodMap computeLikelihoods( final List<GATKSAMRecord> reads, final Map<Allele, Haplotype> alleleHaplotypeMap, final Map<GATKSAMRecord, byte[]> GCPArrayMap ) {
+        if(doProfiling)
+            startTime = System.nanoTime();
+        int readListSize = reads.size();
+        int numHaplotypes = alleleHaplotypeMap.size();
+        int numTestcases = readListSize*numHaplotypes;
+        JNIReadDataHolderClass[] readDataArray = new JNIReadDataHolderClass[readListSize];
+        int idx = 0;
+        for(GATKSAMRecord read : reads)
+        {
+            readDataArray[idx] = new JNIReadDataHolderClass();
+            readDataArray[idx].readBases = read.getReadBases();
+            readDataArray[idx].readQuals = read.getBaseQualities();
+            readDataArray[idx].insertionGOP = read.getBaseInsertionQualities();
+            readDataArray[idx].deletionGOP = read.getBaseDeletionQualities();
+            readDataArray[idx].overallGCP = GCPArrayMap.get(read);
+            ++idx;
+        }
+
+        mLikelihoodArray = new double[readListSize*numHaplotypes];      //to store results
+        if(doProfiling)
+            setupTime += (System.nanoTime() - startTime);
+        //for(reads)
+        //   for(haplotypes)
+        //       compute_full_prob()
+        jniComputeLikelihoods(readListSize, numHaplotypes, readDataArray, null, mLikelihoodArray, 12);
+
+        final PerReadAlleleLikelihoodMap likelihoodMap = new PerReadAlleleLikelihoodMap();
+        idx = 0;
+        int idxInsideHaplotypeList = 0;
+        int readIdx = 0;
+        for(GATKSAMRecord read : reads)
+        {
+            for (Map.Entry<Allele, Haplotype>  currEntry : alleleHaplotypeMap.entrySet())//order is important - access in same order always
+            {
+                //Since the order of haplotypes in the List<Haplotype> and alleleHaplotypeMap is different,
+                //get idx of current haplotype in the list and use this idx to get the right likelihoodValue
+                idxInsideHaplotypeList = haplotypeToHaplotypeListIdxMap.get(currEntry.getValue());
+                likelihoodMap.add(read, currEntry.getKey(), mLikelihoodArray[readIdx + idxInsideHaplotypeList]);
+                ++idx;
+            }
+            readIdx += numHaplotypes;
+        }
+        if(doProfiling)
+            computeTime += (System.nanoTime() - startTime);
+        return likelihoodMap;
+    }
+    
+    /**
+     * Print final profiling information from native code
+     */
+    public native void jniClose();
+    @Override
+    public void close()
+    {
+        System.out.println("Time spent in setup for JNI call : "+(setupTime*1e-9));
+        super.close();
+        jniClose();
+    }
+   
+    //Copied from http://frommyplayground.com/how-to-load-native-jni-library-from-jar 
+    /**
+     * Loads library from current JAR archive
+     * 
+     * The file from JAR is copied into system temporary directory and then loaded. The temporary file is deleted after exiting.
+     * Method uses String as filename because the pathname is "abstract", not system-dependent.
+     * 
+     * @param filename The filename inside JAR as absolute path (beginning with '/'), e.g. /package/File.ext
+     * @throws IOException If temporary file creation or read/write operation fails
+     * @throws IllegalArgumentException If source file (param path) does not exist
+     * @throws IllegalArgumentException If the path is not absolute or if the filename is shorter than three characters (restriction of {@see File#createTempFile(java.lang.String, java.lang.String)}).
+     */
+    public static void loadLibraryFromJar(String path) throws IOException {
+
+        if (!path.startsWith("/")) {
+            throw new IllegalArgumentException("The path to be absolute (start with '/').");
+        }
+
+        // Obtain filename from path
+        String[] parts = path.split("/");
+        String filename = (parts.length > 1) ? parts[parts.length - 1] : null;
+
+        // Split filename to prexif and suffix (extension)
+        String prefix = "";
+        String suffix = null;
+        if (filename != null) {
+            parts = filename.split("\\.", 2);
+            prefix = parts[0];
+            suffix = (parts.length > 1) ? "."+parts[parts.length - 1] : null; // Thanks, davs! :-)
+        }
+
+        // Check if the filename is okay
+        if (filename == null || prefix.length() < 3) {
+            throw new IllegalArgumentException("The filename has to be at least 3 characters long.");
+        }
+
+        // Prepare temporary file
+        File temp = File.createTempFile(prefix, suffix);
+        //System.out.println("Temp lib file "+temp.getAbsolutePath());
+        temp.deleteOnExit();
+
+        if (!temp.exists()) {
+            throw new FileNotFoundException("File " + temp.getAbsolutePath() + " does not exist.");
+        }
+
+        // Prepare buffer for data copying
+        byte[] buffer = new byte[1024];
+        int readBytes;
+
+        // Open and check input stream
+        InputStream is = VectorLoglessPairHMM.class.getResourceAsStream(path);
+        if (is == null) {
+            throw new FileNotFoundException("File " + path + " was not found inside JAR.");
+        }
+
+        // Open output stream and copy data between source file in JAR and the temporary file
+        OutputStream os = new FileOutputStream(temp);
+        try {
+            while ((readBytes = is.read(buffer)) != -1) {
+                os.write(buffer, 0, readBytes);
+            }
+        } finally {
+            // If read/write fails, close streams safely before throwing an exception
+            os.close();
+            is.close();
+        }
+
+        // Finally, load the library
+        System.load(temp.getAbsolutePath());
+    }
+}
diff --git a/public/VectorPairHMM/README.md b/public/VectorPairHMM/README.md
new file mode 100644
index 000000000..85cc0a04a
--- /dev/null
+++ b/public/VectorPairHMM/README.md
@@ -0,0 +1,71 @@
+Implementation overview:
+Created a new Java class called VectorLoglessPairHMM which extends LoglessPairHMM and 
+overrides functions from both LoglessPairHMM and PairHMM.
+1. Constructor: Call base class constructors. Then, load the native library located in this 
+directory and call an init function (with suffix 'jniInitializeClassFieldsAndMachineMask') in the 
+library to determine fields ids for the members of classes JNIReadDataHolder and 
+JNIHaplotypeDataHolders. The native code stores the field ids (struct offsets) for the classes and 
+re-uses them for subsequent computations. Optionally, the user can disable the vector 
+implementation, by using the 'mask' argument (see comments for a more detailed explanation).
+2. When the library is loaded, it invokes the constructor of the class LoadTimeInitializer (because 
+a global variable g_load_time_initializer is declared in the library).  This constructor 
+(LoadTimeInitializer.cc) can be used to perform various initializations.  Currently, it initializes 
+two global function pointers to point to the function implementation that is supported on the 
+machine (AVX/SSE/un-vectorized) on which the program is being run. The two pointers are for float 
+and double respectively.  The global function pointers are declared in utils.cc and are assigned in 
+the function initialize_function_pointers() defined in utils.cc and invoked from the constructor of 
+LoadTimeInitializer.
+Other initializations in LoadTimeInitializer:
+* ConvertChar::init - sets some masks for the vector implementation
+* FTZ for performance
+* stat counters = 0
+* debug structs (which are never used in non-debug mode)
+This initialization is done only once for the whole program.
+3. initialize(): To initialize the region for PairHMM. Pass haplotype bases to native code through 
+the JNIHaplotypeDataHolder class.  Since the haplotype list is common across multiple samples in 
+computeReadLikelihoods(), we can pass the haplotype bases to the native code once and re-use across 
+multiple samples.
+4. computeLikelihoods(): Copies array references for readBases/quals etc to array of 
+JNIReadDataHolder objects.  Invokes the JNI function to perform the computation and updates the 
+likelihoodMap.
+The JNI function copies the byte array references into an array of testcase structs and invokes the 
+compute_full_prob function through the function pointers initialized earlier.
+The primary native function called is 
+Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniComputeLikelihoods. It uses 
+standard JNI calls to get and return data from/to the Java class VectorLoglessPairHMM.  The last 
+argument to the function is the maximum number of OpenMP threads to use while computing PairHMM in 
+C++. This option is set when the native function call is made from JNILoglessPairHMM 
+computeLikelihoods - currently it is set to 12 (no logical reason).
+Note: OpenMP has been disabled for now - insufficient #testcases per call to computeLikelihoods() to 
+justify multi-threading.
+5. finalizeRegion(): Releases the haplotype arrays initialized in step 3 - should be called at the 
+end of every region (line 351 in PairHMMLikelihoodCalculationEngine).
+
+Note: Debug code has been moved to a separate class DebugJNILoglessPairHMM.java.
+
+Compiling:
+Make sure you have icc (Intel C compiler) available. Currently, gcc does not seem to support all AVX 
+intrinsics.
+This native library is called libVectorLoglessPairHMM.so
+Using Maven:
+Type 'mvn install' in this directory - this will build the library (by invoking 'make') and copy the 
+native library to the directory 
+${sting-utils.basedir}/src/main/resources/org/broadinstitute/sting/utils/pairhmm
+The GATK maven build process (when run) will bundle the library into the StingUtils jar file from 
+the copied directory.
+Simple build:
+cd src/main/c++
+make  
+
+Running:
+The default implementation of PairHMM is now VECTOR_LOGLESS_CACHING in HaplotypeCaller.java. To use 
+the Java version, use the command line argument "--pair_hmm_implementation LOGLESS_CACHING". (see 
+run.sh in src/main/c++).
+The native library is bundled with the StingUtils jar file. When HaplotypeCaller is invoked, then 
+the library is unpacked from the jar file, copied to the /tmp directory (with a unique id) and 
+loaded by the Java class VectorLoglessPairHMM in the constructor (if it has not been loaded 
+already).
+The default library can be overridden by using the -Djava.library.path argument (see 
+src/main/c++/run.sh for an example) for the JVM to pass the path to the library. If the library 
+libVectorLoglessPairHMM.so can be found in java.library.path, then it is loaded and the 'packed' 
+library is not used.
diff --git a/public/VectorPairHMM/pom.xml b/public/VectorPairHMM/pom.xml
new file mode 100644
index 000000000..41bb73211
--- /dev/null
+++ b/public/VectorPairHMM/pom.xml
@@ -0,0 +1,119 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/maven-v4_0_0.xsd">
+    <modelVersion>4.0.0</modelVersion>
+
+    <parent>
+        <groupId>org.broadinstitute.sting</groupId>
+        <artifactId>sting-root</artifactId>
+        <version>2.8-SNAPSHOT</version>
+        <relativePath>../../public/sting-root</relativePath>
+    </parent>
+
+    <artifactId>VectorPairHMM</artifactId>
+    <packaging>pom</packaging>
+    <name>Vectorized PairHMM native libraries</name>
+
+    <description>Builds a GNU/Linux x86_64 library of VectorPairHMM using icc (Intel C++ compiler). During install, copies it into sting-utils. Neither tested nor expected to work on any other platform.</description>
+
+    <properties>
+        <sourceEncoding>UTF-8</sourceEncoding>
+        <project.build.sourceEncoding>${sourceEncoding}</project.build.sourceEncoding>
+        <project.reporting.outputEncoding>${sourceEncoding}</project.reporting.outputEncoding>
+        <sting.basedir>${project.basedir}/../..</sting.basedir>
+        <sting-utils.basedir>${sting.basedir}/public/sting-utils</sting-utils.basedir>
+        <!-- Where to place the library in sting-utils -->
+        <pairhmm.resources.directory>${sting-utils.basedir}/src/main/resources/org/broadinstitute/sting/utils/pairhmm</pairhmm.resources.directory>
+    </properties>
+    <build>
+        <plugins>
+            <!-- Print out the architecture - works only on GNU/Linux x86_64 systems -->
+            <!-- Neither tested nor expected to work on any other platform. -->
+            <!-- Requires icc (Intel C++ compiler) to be in your PATH. -->
+            <plugin>
+                <groupId>org.apache.maven.plugins</groupId>
+                <artifactId>maven-enforcer-plugin</artifactId>
+                <executions>
+                    <execution>
+                        <goals>
+                            <goal>display-info</goal>
+                        </goals>
+                        <phase>validate</phase>
+                    </execution>
+                </executions>
+            </plugin>
+
+            <!-- Run make -->
+            <plugin>
+                <groupId>org.codehaus.mojo</groupId>
+                <artifactId>exec-maven-plugin</artifactId>
+                <executions>
+                    <execution>
+                        <goals>
+                            <goal>exec</goal>
+                        </goals>
+                        <phase>compile</phase>
+                        <configuration>
+                            <executable>make</executable>
+                            <workingDirectory>src/main/c++</workingDirectory>
+                            <environmentVariables>
+                                <JRE_HOME>${java.home}</JRE_HOME>
+                                <OUTPUT_DIR>${project.build.directory}</OUTPUT_DIR>
+                            </environmentVariables>
+                        </configuration>
+                    </execution>
+                </executions>
+            </plugin>
+
+            <!-- Don't actually install this artifact into the user's repo -->
+            <plugin>
+                <groupId>org.apache.maven.plugins</groupId>
+                <artifactId>maven-install-plugin</artifactId>
+                <configuration>
+                    <skip>true</skip>
+                </configuration>
+            </plugin>
+
+            <!-- Copy the built library into sting-utils -->
+            <plugin>
+                <groupId>org.apache.maven.plugins</groupId>
+                <artifactId>maven-resources-plugin</artifactId>
+                <executions>
+                    <execution>
+                        <id>default-install</id>
+                        <goals>
+                            <goal>copy-resources</goal>
+                        </goals>
+                        <phase>install</phase>
+                        <configuration>
+                            <outputDirectory>${pairhmm.resources.directory}</outputDirectory>
+                            <resources>
+                                <resource>
+                                    <directory>${project.build.directory}</directory>
+                                    <includes>
+                                        <include>**/*</include>
+                                    </includes>
+                                </resource>
+                            </resources>
+                        </configuration>
+                    </execution>
+                </executions>
+            </plugin>
+
+            <!-- pom.xml cleanup, always sort according to the definitions in sting-root -->
+            <plugin>
+                <groupId>com.google.code.sortpom</groupId>
+                <artifactId>maven-sortpom-plugin</artifactId>
+                <configuration>
+                    <createBackupFile>false</createBackupFile>
+                    <predefinedSortOrder>custom_1</predefinedSortOrder>
+                    <lineSeparator>\n</lineSeparator>
+                    <encoding>${sourceEncoding}</encoding>
+                    <keepBlankLines>true</keepBlankLines>
+                    <sortDependencies>scope</sortDependencies>
+                    <nrOfIndentSpace>4</nrOfIndentSpace>
+                    <expandEmptyElements>false</expandEmptyElements>
+                </configuration>
+            </plugin>
+        </plugins>
+    </build>
+</project>
diff --git a/public/VectorPairHMM/src/main/c++/.gitignore b/public/VectorPairHMM/src/main/c++/.gitignore
new file mode 100644
index 000000000..d791ffd80
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/.gitignore
@@ -0,0 +1,16 @@
+.svn
+*.o
+*.so
+tests
+.deps
+hmm_Mohammad
+pairhmm-template-main
+*.swp
+*.class
+checker
+reformat
+subdir_checkout.sh
+avx/
+sse/
+triplicate.sh
+
diff --git a/public/VectorPairHMM/src/main/c++/LoadTimeInitializer.cc b/public/VectorPairHMM/src/main/c++/LoadTimeInitializer.cc
new file mode 100644
index 000000000..0e3026f65
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/LoadTimeInitializer.cc
@@ -0,0 +1,206 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#include "LoadTimeInitializer.h"
+#include "utils.h"
+using namespace std;
+char* LoadTimeInitializerStatsNames[] = 
+{
+  "num_regions",
+  "num_reads",
+  "num_haplotypes",
+  "num_testcases",
+  "num_double_invocations",
+  "haplotype_length",
+  "readlength",
+  "product_read_length_haplotype_length",
+  "dummy"
+};
+
+LoadTimeInitializer g_load_time_initializer;
+
+LoadTimeInitializer::LoadTimeInitializer()		//will be called when library is loaded
+{
+  ConvertChar::init();
+#ifndef DISABLE_FTZ
+  //Very important to get good performance on Intel processors
+  //Function: enabling FTZ converts denormals to 0 in hardware
+  //Denormals cause microcode to insert uops into the core causing big slowdown
+  _MM_SET_FLUSH_ZERO_MODE(_MM_FLUSH_ZERO_ON);
+  cout << "FTZ enabled - may decrease accuracy if denormal numbers encountered\n";
+#else
+  cout << "FTZ is not set - may slow down performance if denormal numbers encountered\n";
+#endif
+  //Profiling: times for compute and transfer (either bytes copied or pointers copied)
+  m_compute_time = 0;
+  m_data_transfer_time = 0;
+  m_bytes_copied = 0;
+
+  //Initialize profiling counters
+  for(unsigned i=0;i<TOTAL_NUMBER_STATS;++i)
+  {
+    m_sum_stats[i] = 0;
+    m_sum_square_stats[i] = 0;
+    m_max_stats[i] = 0;
+    m_min_stats[i] = 0xFFFFFFFFFFFFFFFFull;
+  }
+
+  //for debug dump
+  m_filename_to_fptr.clear();
+  m_written_files_set.clear();
+
+  //Common buffer - 8MB
+  unsigned size = 1024*1024;
+  m_buffer = new uint64_t[size];
+  m_buffer_size = size*sizeof(uint64_t);
+  
+  initialize_function_pointers();
+
+  //Initialize static members of class
+  Context<float>::initializeStaticMembers();
+  Context<double>::initializeStaticMembers();
+
+  cout.flush();
+}
+
+void LoadTimeInitializer::print_profiling()
+{
+  double mean = 0;
+  double variance = 0;
+  uint64_t denominator = 1;
+  cout << "Time spent in compute_testcases "<<m_compute_time*1e-9<<"\n";
+  cout << "Time spent in data transfer (Java <--> C++) "<<m_data_transfer_time*1e-9<<"\n";
+
+  cout << "\nHC input stats\nstat_name,sum,sum_square,mean,variance,min,max\n";
+  for(unsigned i=0;i<TOTAL_NUMBER_STATS;++i)
+  {
+    cout << LoadTimeInitializerStatsNames[i];
+    cout << "," << m_sum_stats[i];
+    cout << "," << std::scientific << m_sum_square_stats[i];
+    denominator = 1;
+    switch(i)
+    {
+      case NUM_READS_IDX:
+      case NUM_HAPLOTYPES_IDX:
+      case NUM_TESTCASES_IDX:
+        denominator = m_sum_stats[NUM_REGIONS_IDX];
+        break;
+      case HAPLOTYPE_LENGTH_IDX:
+        denominator = m_sum_stats[NUM_HAPLOTYPES_IDX];
+        break;
+      case READ_LENGTH_IDX:
+        denominator = m_sum_stats[NUM_READS_IDX];
+        break;
+      case PRODUCT_READ_LENGTH_HAPLOTYPE_LENGTH_IDX:
+        denominator = m_sum_stats[NUM_TESTCASES_IDX];
+        break;
+      default:
+        denominator = 1;
+        break;
+    }
+    mean = ((double)m_sum_stats[i])/denominator;
+    cout << "," << std::scientific << mean;
+    variance = (m_sum_square_stats[i]/denominator) - (mean*mean);       //E(X^2)-(E(X))^2
+    cout << "," << std::scientific << variance;
+    cout << "," << m_min_stats[i];
+    cout << "," << m_max_stats[i];
+    cout << "\n";
+  }
+  cout << "\n";
+  cout.flush();
+}
+
+void LoadTimeInitializer::debug_dump(string filename, string s, bool to_append, bool add_newline)
+{
+  map<string, ofstream*>::iterator mI = m_filename_to_fptr.find(filename);
+  ofstream* fptr = 0;
+  if(mI == m_filename_to_fptr.end())
+  {
+    m_filename_to_fptr[filename] = new ofstream();
+    fptr = m_filename_to_fptr[filename];
+    //File never seen before
+    if(m_written_files_set.find(filename) == m_written_files_set.end())
+    {
+      to_append = false;
+      m_written_files_set.insert(filename);
+    }
+    fptr->open(filename.c_str(), to_append ? ios::app : ios::out);
+    assert(fptr->is_open());
+  }
+  else
+    fptr = (*mI).second;
+  //ofstream fptr;
+  //fptr.open(filename.c_str(), to_append ? ofstream::app : ofstream::out);
+  (*fptr) << s;
+  if(add_newline)
+    (*fptr) << "\n";
+  //fptr.close();
+}
+void LoadTimeInitializer::debug_close()
+{
+  for(map<string,ofstream*>::iterator mB = m_filename_to_fptr.begin(), mE = m_filename_to_fptr.end();
+      mB != mE;mB++)
+  {
+    (*mB).second->close();
+    delete (*mB).second;
+  }
+  m_filename_to_fptr.clear();
+}
+
+void LoadTimeInitializer::dump_sandbox(testcase& tc, unsigned tc_idx, unsigned numReads, unsigned numHaplotypes)
+{
+  unsigned haplotypeLength = tc.haplen;
+  unsigned readLength = tc.rslen;
+  ofstream& dumpFptr = m_sandbox_fptr;
+  for(unsigned k=0;k<haplotypeLength;++k)
+    dumpFptr<<(char)(tc.hap[k]);
+  dumpFptr<<" ";
+  for(unsigned k=0;k<readLength;++k)
+    dumpFptr<<(char)(tc.rs[k]);
+  dumpFptr<<" ";
+  for(unsigned k=0;k<readLength;++k)
+    dumpFptr<<(char)(tc.q[k]+33);
+  dumpFptr<<" ";
+  for(unsigned k=0;k<readLength;++k)
+    dumpFptr<<(char)(tc.i[k]+33);
+  dumpFptr<<" ";
+  for(unsigned k=0;k<readLength;++k)
+    dumpFptr<<(char)(tc.d[k]+33);
+  dumpFptr<<" ";
+  for(unsigned k=0;k<readLength;++k)
+    dumpFptr<<(char)(tc.c[k]+33);
+  if(tc_idx == 0)       //new region
+    dumpFptr << " "<< numReads << " "<<numHaplotypes; 
+  dumpFptr<<"\n";
+}
+
+void LoadTimeInitializer::update_stat(LoadTimeInitializerStatsEnum stat_idx, uint64_t value)
+{
+  m_sum_stats[stat_idx] += value;
+  double v = value;
+  m_sum_square_stats[stat_idx] += (v*v);
+  m_max_stats[stat_idx] = std::max(m_max_stats[stat_idx], value);
+  m_min_stats[stat_idx] = std::min(m_min_stats[stat_idx], value);
+}
diff --git a/public/VectorPairHMM/src/main/c++/LoadTimeInitializer.h b/public/VectorPairHMM/src/main/c++/LoadTimeInitializer.h
new file mode 100644
index 000000000..e7d9af626
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/LoadTimeInitializer.h
@@ -0,0 +1,94 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#ifndef LOAD_TIME_INITIALIZER_H
+#define LOAD_TIME_INITIALIZER_H
+#include "headers.h"
+#include <jni.h>
+#include "template.h"
+
+enum LoadTimeInitializerStatsEnum
+{
+  NUM_REGIONS_IDX=0,
+  NUM_READS_IDX,
+  NUM_HAPLOTYPES_IDX,
+  NUM_TESTCASES_IDX,
+  NUM_DOUBLE_INVOCATIONS_IDX,
+  HAPLOTYPE_LENGTH_IDX,
+  READ_LENGTH_IDX,
+  PRODUCT_READ_LENGTH_HAPLOTYPE_LENGTH_IDX,
+  TOTAL_NUMBER_STATS
+};
+extern char* LoadTimeInitializerStatsNames[];
+
+class LoadTimeInitializer
+{
+  public:
+    LoadTimeInitializer();		//will be called when library is loaded
+    ~LoadTimeInitializer()
+    {
+      delete m_buffer;
+    }
+    void print_profiling();
+    void debug_dump(std::string filename, std::string s, bool to_append, bool add_newline=true);
+    void debug_close();
+    
+    void dump_sandbox(testcase& tc, unsigned tc_idx, unsigned numReads, unsigned numHaplotypes);
+    void open_sandbox() { m_sandbox_fptr.open("sandbox.txt", std::ios::app); }
+    void close_sandbox() { m_sandbox_fptr.close(); }
+    
+    jfieldID m_readBasesFID;
+    jfieldID m_readQualsFID;
+    jfieldID m_insertionGOPFID;
+    jfieldID m_deletionGOPFID;
+    jfieldID m_overallGCPFID;
+    jfieldID m_haplotypeBasesFID;
+    //profiling - update stats
+    void update_stat(LoadTimeInitializerStatsEnum stat_idx, uint64_t value);
+    //timing in nanoseconds
+    uint64_t m_compute_time;
+    uint64_t m_data_transfer_time;
+    //bytes copied
+    uint64_t m_bytes_copied;
+    unsigned get_buffer_size() { return m_buffer_size; }
+    char* get_buffer() { return (char*)m_buffer; }
+  private:
+    std::map<std::string, std::ofstream*> m_filename_to_fptr;
+    std::set<std::string> m_written_files_set;
+    std::ofstream m_sandbox_fptr;
+    //used to compute various stats
+    uint64_t m_sum_stats[TOTAL_NUMBER_STATS];
+    double m_sum_square_stats[TOTAL_NUMBER_STATS];
+    uint64_t m_min_stats[TOTAL_NUMBER_STATS];
+    uint64_t m_max_stats[TOTAL_NUMBER_STATS];
+    unsigned m_buffer_size;
+    uint64_t* m_buffer;
+};
+extern LoadTimeInitializer g_load_time_initializer;
+
+#define SIZE_PER_TESTCASE 6*10000
+#define SIZE_PER_BUFFER 10000
+
+#endif
diff --git a/public/VectorPairHMM/src/main/c++/Makefile b/public/VectorPairHMM/src/main/c++/Makefile
new file mode 100644
index 000000000..354bca0bb
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/Makefile
@@ -0,0 +1,114 @@
+#Copyright (c) 2012 The Broad Institute
+
+#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.
+#
+
+
+#OMPCFLAGS=-fopenmp
+#OMPLFLAGS=-fopenmp #-openmp-link static
+
+#CFLAGS=-O2 -std=c++11 -W -Wall -march=corei7-avx -Wa,-q            -pedantic $(OMPCFLAGS) -Wno-unknown-pragmas
+#CFLAGS=-O2             -W -Wall -march=corei7 -mfpmath=sse -msse4.2 -pedantic $(OMPCFLAGS) -Wno-unknown-pragmas
+
+JRE_HOME?=/opt/jdk1.7.0_25/jre
+JNI_COMPILATION_FLAGS=-D_REENTRANT -fPIC -I${JRE_HOME}/../include -I${JRE_HOME}/../include/linux
+
+COMMON_COMPILATION_FLAGS=$(JNI_COMPILATION_FLAGS) -O3 -W -Wall -pedantic $(OMPCFLAGS) -Wno-unknown-pragmas
+CC=icc
+CXX=icc
+
+LDFLAGS=-lm -lrt $(OMPLDFLAGS)
+ifdef DISABLE_FTZ
+  COMMON_COMPILATION_FLAGS+=-DDISABLE_FTZ -no-ftz
+endif
+
+PAPI_DIR=/home/karthikg/softwares/papi-5.3.0
+ifdef USE_PAPI
+  ifeq ($(USE_PAPI),1)
+    COMMON_COMPILATION_FLAGS+=-I$(PAPI_DIR)/include -DUSE_PAPI
+    LDFLAGS+=-L$(PAPI_DIR)/lib -lpapi
+  endif
+endif
+
+ifdef DISABLE_FTZ
+  COMMON_COMPILATION_FLAGS+=-DDISABLE_FTZ -no-ftz
+endif
+
+BIN=libVectorLoglessPairHMM.so pairhmm-template-main checker
+#BIN=checker
+
+DEPDIR=.deps
+DF=$(DEPDIR)/$(*).d
+
+#Common across libJNI and sandbox
+COMMON_SOURCES=utils.cc avx_function_instantiations.cc baseline.cc sse_function_instantiations.cc LoadTimeInitializer.cc
+#Part of libJNI
+LIBSOURCES=org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM.cc org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM.cc Sandbox.cc $(COMMON_SOURCES)
+SOURCES=$(LIBSOURCES) pairhmm-template-main.cc pairhmm-1-base.cc
+LIBOBJECTS=$(LIBSOURCES:.cc=.o)
+COMMON_OBJECTS=$(COMMON_SOURCES:.cc=.o)
+
+
+#No vectorization for these files
+NO_VECTOR_SOURCES=org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM.cc org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM.cc pairhmm-template-main.cc pairhmm-1-base.cc utils.cc baseline.cc LoadTimeInitializer.cc Sandbox.cc
+#Use -xAVX for these files
+AVX_SOURCES=avx_function_instantiations.cc
+#Use -xSSE4.2 for these files
+SSE_SOURCES=sse_function_instantiations.cc
+
+NO_VECTOR_OBJECTS=$(NO_VECTOR_SOURCES:.cc=.o)
+AVX_OBJECTS=$(AVX_SOURCES:.cc=.o)
+SSE_OBJECTS=$(SSE_SOURCES:.cc=.o)
+$(NO_VECTOR_OBJECTS): CXXFLAGS=$(COMMON_COMPILATION_FLAGS)
+$(AVX_OBJECTS): CXXFLAGS=$(COMMON_COMPILATION_FLAGS) -xAVX
+$(SSE_OBJECTS): CXXFLAGS=$(COMMON_COMPILATION_FLAGS) -xSSE4.2
+OBJECTS=$(NO_VECTOR_OBJECTS) $(AVX_OBJECTS) $(SSE_OBJECTS)
+
+all: $(BIN) Sandbox.class copied_lib
+
+-include $(addprefix $(DEPDIR)/,$(SOURCES:.cc=.d))
+
+checker: pairhmm-1-base.o $(COMMON_OBJECTS)
+	$(CXX) $(OMPLFLAGS) -o $@ $^ $(LDFLAGS)
+
+pairhmm-template-main:	pairhmm-template-main.o $(COMMON_OBJECTS)
+	$(CXX) $(OMPLFLAGS) -o $@ $^ $(LDFLAGS)
+
+libVectorLoglessPairHMM.so: $(LIBOBJECTS) 
+	$(CXX) $(OMPLFLAGS) -shared -static-intel -o $@ $(LIBOBJECTS) ${LDFLAGS}
+
+
+$(OBJECTS): %.o: %.cc
+	@mkdir -p $(DEPDIR)
+	$(CXX) -c -MMD -MF $(DF) $(CXXFLAGS) $(OUTPUT_OPTION) $<
+
+Sandbox.class: Sandbox.java
+	javac Sandbox.java
+
+copied_lib: libVectorLoglessPairHMM.so
+ifdef OUTPUT_DIR
+	mkdir -p $(OUTPUT_DIR)
+	rsync -a libVectorLoglessPairHMM.so $(OUTPUT_DIR)/
+endif
+
+clean:
+	rm -rf $(BIN) *.o $(DEPDIR) *.class
diff --git a/public/VectorPairHMM/src/main/c++/Sandbox.cc b/public/VectorPairHMM/src/main/c++/Sandbox.cc
new file mode 100644
index 000000000..985b19ae9
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/Sandbox.cc
@@ -0,0 +1,106 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#include "Sandbox.h"
+#include "org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM.h"
+#include "utils.h"
+#include "jni_common.h"
+/*
+ * Class:     Sandbox
+ * Method:    jniGetMachineType
+ * Signature: ()J
+ */
+JNIEXPORT jlong JNICALL Java_Sandbox_jniGetMachineType
+  (JNIEnv * env, jobject thisObj)
+{
+  return 0;
+}
+
+/*
+ * Class:     Sandbox
+ * Method:    jniInitializeClassFieldsAndMachineMask
+ * Signature: (Ljava/lang/Class;Ljava/lang/Class;J)V
+ */
+JNIEXPORT void JNICALL Java_Sandbox_jniInitializeClassFieldsAndMachineMask
+  (JNIEnv* env, jobject thisObject, jclass readDataHolderClass, jclass haplotypeDataHolderClass, jlong mask)
+{
+  Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniInitializeClassFieldsAndMachineMask(env, thisObject, readDataHolderClass,
+      haplotypeDataHolderClass, mask);
+}
+
+/*
+ * Class:     Sandbox
+ * Method:    jniInitializeHaplotypes
+ * Signature: (I[LSandbox/JNIHaplotypeDataHolderClass;)V
+ */
+JNIEXPORT void JNICALL Java_Sandbox_jniInitializeHaplotypes
+  (JNIEnv * env, jobject thisObject, jint numHaplotypes, jobjectArray haplotypeDataArray)
+{
+  Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniInitializeHaplotypes(env, thisObject, numHaplotypes, haplotypeDataArray);
+}
+
+/*
+ * Class:     Sandbox
+ * Method:    jniFinalizeRegion
+ * Signature: ()V
+ */
+JNIEXPORT void JNICALL Java_Sandbox_jniFinalizeRegion
+  (JNIEnv * env, jobject thisObject)
+{
+  Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniFinalizeRegion(env, thisObject);
+}
+
+
+/*
+ * Class:     Sandbox
+ * Method:    jniComputeLikelihoods
+ * Signature: (II[LSandbox/JNIReadDataHolderClass;[LSandbox/JNIHaplotypeDataHolderClass;[DI)V
+ */
+JNIEXPORT void JNICALL Java_Sandbox_jniComputeLikelihoods
+  (JNIEnv* env, jobject thisObject, jint numReads, jint numHaplotypes, 
+   jobjectArray readDataArray, jobjectArray haplotypeDataArray, jdoubleArray likelihoodArray, jint maxNumThreadsToUse)
+{
+  Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniComputeLikelihoods(env, thisObject,
+      numReads, numHaplotypes, readDataArray, haplotypeDataArray, likelihoodArray, maxNumThreadsToUse);
+}
+/*
+ * Class:     Sandbox
+ * Method:    jniClose
+ * Signature: ()V
+ */
+JNIEXPORT void JNICALL Java_Sandbox_jniClose
+  (JNIEnv* env, jobject thisObject)
+{ Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniClose(env, thisObject); } 
+
+JNIEXPORT void JNICALL Java_Sandbox_doEverythingNative
+  (JNIEnv* env, jobject thisObject, jstring fileNameString)
+{
+  const char* fileName = env->GetStringUTFChars(fileNameString, 0);
+  char local_array[800];
+  strncpy(local_array, fileName, 200);
+  env->ReleaseStringUTFChars(fileNameString, fileName);
+  do_compute(local_array, true, 10000, false);
+}
+
diff --git a/public/VectorPairHMM/src/main/c++/Sandbox.h b/public/VectorPairHMM/src/main/c++/Sandbox.h
new file mode 100644
index 000000000..486a1c095
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/Sandbox.h
@@ -0,0 +1,96 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+/* DO NOT EDIT THIS FILE - it is machine generated */
+#include <jni.h>
+/* Header for class Sandbox */
+
+#ifndef _Included_Sandbox
+#define _Included_Sandbox
+#ifdef __cplusplus
+extern "C" {
+#endif
+#undef Sandbox_enableAll
+#define Sandbox_enableAll -1LL
+/*
+ * Class:     Sandbox
+ * Method:    jniGetMachineType
+ * Signature: ()J
+ */
+JNIEXPORT jlong JNICALL Java_Sandbox_jniGetMachineType
+  (JNIEnv *, jobject);
+
+/*
+ * Class:     Sandbox
+ * Method:    jniInitializeClassFieldsAndMachineMask
+ * Signature: (Ljava/lang/Class;Ljava/lang/Class;J)V
+ */
+JNIEXPORT void JNICALL Java_Sandbox_jniInitializeClassFieldsAndMachineMask
+  (JNIEnv *, jobject, jclass, jclass, jlong);
+
+/*
+ * Class:     Sandbox
+ * Method:    jniInitializeHaplotypes
+ * Signature: (I[LSandbox/JNIHaplotypeDataHolderClass;)V
+ */
+JNIEXPORT void JNICALL Java_Sandbox_jniInitializeHaplotypes
+  (JNIEnv *, jobject, jint, jobjectArray);
+
+/*
+ * Class:     Sandbox
+ * Method:    jniFinalizeRegion
+ * Signature: ()V
+ */
+JNIEXPORT void JNICALL Java_Sandbox_jniFinalizeRegion
+  (JNIEnv *, jobject);
+
+/*
+ * Class:     Sandbox
+ * Method:    jniComputeLikelihoods
+ * Signature: (II[LSandbox/JNIReadDataHolderClass;[LSandbox/JNIHaplotypeDataHolderClass;[DI)V
+ */
+JNIEXPORT void JNICALL Java_Sandbox_jniComputeLikelihoods
+  (JNIEnv *, jobject, jint, jint, jobjectArray, jobjectArray, jdoubleArray, jint);
+
+/*
+ * Class:     Sandbox
+ * Method:    jniClose
+ * Signature: ()V
+ */
+JNIEXPORT void JNICALL Java_Sandbox_jniClose
+  (JNIEnv *, jobject);
+
+/*
+ * Class:     Sandbox
+ * Method:    doEverythingNative
+ * Signature: ([B)V
+ */
+JNIEXPORT void JNICALL Java_Sandbox_doEverythingNative
+  (JNIEnv *, jobject, jstring);
+
+#ifdef __cplusplus
+}
+#endif
+#endif
diff --git a/public/VectorPairHMM/src/main/c++/Sandbox.java b/public/VectorPairHMM/src/main/c++/Sandbox.java
new file mode 100644
index 000000000..d6b7c2eae
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/Sandbox.java
@@ -0,0 +1,305 @@
+/*
+* Copyright (c) 2012 The Broad Institute
+* 
+* 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.
+*/
+
+package org.broadinstitute.sting.utils.vectorpairhmm;
+
+import java.util.List;
+import java.util.LinkedList;
+import java.util.Map;
+import java.util.HashMap;
+import java.io.File;
+import java.util.Scanner;
+import java.io.IOException;
+import java.io.FileNotFoundException;
+import java.io.InputStreamReader;
+
+public class Sandbox {
+
+    private long setupTime = 0;
+    private long computeTime = 0;
+    //Used to copy references to byteArrays to JNI from reads
+    protected class JNIReadDataHolderClass {
+        public byte[] readBases = null;
+        public byte[] readQuals = null;
+        public byte[] insertionGOP = null;
+        public byte[] deletionGOP = null;
+        public byte[] overallGCP = null;
+    }
+
+    //Used to copy references to byteArrays to JNI from haplotypes
+    protected class JNIHaplotypeDataHolderClass {
+        public byte[] haplotypeBases = null;
+    }
+
+    /**
+     * Return 64-bit mask representing machine capabilities
+     * Bit 0 is LSB, bit 63 MSB
+     * Bit 0 represents sse4.2 availability
+     * Bit 1 represents AVX availability
+     */
+    public native long jniGetMachineType();
+    public static final long enableAll = 0xFFFFFFFFFFFFFFFFl;
+
+    
+    /**
+     * Function to initialize the fields of JNIReadDataHolderClass and JNIHaplotypeDataHolderClass from JVM.
+     * C++ codegets FieldIDs for these classes once and re-uses these IDs for the remainder of the program. Field IDs do not
+     * change per JVM session
+     * @param readDataHolderClass class type of JNIReadDataHolderClass
+     * @param haplotypeDataHolderClass class type of JNIHaplotypeDataHolderClass
+     * @param mask mask is a 64 bit integer identical to the one received from jniGetMachineType(). Users can disable usage of some hardware features by zeroing some bits in the mask
+     * */
+    private native void jniInitializeClassFieldsAndMachineMask(Class<?> readDataHolderClass, Class<?> haplotypeDataHolderClass, long mask);
+
+    private static Boolean isVectorLoglessPairHMMLibraryLoaded = false;
+    //The constructor is called only once inside PairHMMLikelihoodCalculationEngine
+    public Sandbox() {
+        synchronized(isVectorLoglessPairHMMLibraryLoaded) {
+            //Load the library and initialize the FieldIDs
+            if(!isVectorLoglessPairHMMLibraryLoaded) {
+                System.loadLibrary("VectorLoglessPairHMM");
+                isVectorLoglessPairHMMLibraryLoaded = true;
+                jniInitializeClassFieldsAndMachineMask(JNIReadDataHolderClass.class, JNIHaplotypeDataHolderClass.class, enableAll);        //need to do this only once
+            }
+        }
+    }
+
+    private native void jniInitializeHaplotypes(final int numHaplotypes,  JNIHaplotypeDataHolderClass[] haplotypeDataArray);
+    
+    //Used to transfer data to JNI
+    //Since the haplotypes are the same for all calls to computeLikelihoods within a region, transfer the haplotypes only once to the JNI per region
+    public void initialize(final List<JNIHaplotypeDataHolderClass> haplotypes) {
+        int numHaplotypes = haplotypes.size();
+        JNIHaplotypeDataHolderClass[] haplotypeDataArray = new JNIHaplotypeDataHolderClass[numHaplotypes];
+        int idx = 0;
+        for(final JNIHaplotypeDataHolderClass currHaplotype : haplotypes)
+        {
+            haplotypeDataArray[idx] = new JNIHaplotypeDataHolderClass();
+            haplotypeDataArray[idx].haplotypeBases = currHaplotype.haplotypeBases;
+            ++idx;
+        }
+        jniInitializeHaplotypes(numHaplotypes, haplotypeDataArray);
+    }
+    /**
+     * Tell JNI to release arrays - really important if native code is directly accessing Java memory, if not
+     * accessing Java memory directly, still important to release memory from C++
+     */
+    private native void jniFinalizeRegion();
+
+    
+    public void finalizeRegion()
+    {
+        jniFinalizeRegion();
+    }
+
+    /**
+     * Real compute kernel
+     */
+    private native void jniComputeLikelihoods(int numReads, int numHaplotypes, JNIReadDataHolderClass[] readDataArray,
+            JNIHaplotypeDataHolderClass[] haplotypeDataArray, double[] likelihoodArray, int maxNumThreadsToUse);
+    
+    public void computeLikelihoods(final List<JNIReadDataHolderClass> reads, final List<JNIHaplotypeDataHolderClass> haplotypes) {
+      //System.out.println("Region : "+reads.size()+" x "+haplotypes.size());
+      long startTime = System.nanoTime();
+      int readListSize = reads.size();
+      int numHaplotypes = haplotypes.size();
+      int numTestcases = readListSize*numHaplotypes;
+      JNIReadDataHolderClass[] readDataArray = new JNIReadDataHolderClass[readListSize];
+      int idx = 0;
+      for(JNIReadDataHolderClass read : reads)
+      {
+        readDataArray[idx] = new JNIReadDataHolderClass();
+        readDataArray[idx].readBases    = read.readBases; 
+        readDataArray[idx].readQuals    = read.readQuals;
+        readDataArray[idx].insertionGOP = read.insertionGOP;
+        readDataArray[idx].deletionGOP  = read.deletionGOP;
+        readDataArray[idx].overallGCP   = read.overallGCP;
+        ++idx;
+      }
+
+      double[] mLikelihoodArray = new double[readListSize*numHaplotypes];      //to store results
+      setupTime += (System.nanoTime() - startTime);
+      //for(reads)
+      //   for(haplotypes)
+      //       compute_full_prob()
+      jniComputeLikelihoods(readListSize, numHaplotypes, readDataArray, null, mLikelihoodArray, 12);
+
+      computeTime += (System.nanoTime() - startTime);
+    }
+    
+    /**
+     * Print final profiling information from native code
+     */
+    public native void jniClose();
+    public void close()
+    {
+        System.out.println("Time spent in setup for JNI call : "+(setupTime*1e-9)+" compute time : "+(computeTime*1e-9));
+        jniClose();
+    }
+
+    public void parseSandboxFile(String filename)
+    {
+      File file = new File(filename);
+      Scanner input = null;
+      try
+      {
+        input = new Scanner(file); 
+      }
+      catch(FileNotFoundException e)
+      {
+        System.err.println("File "+filename+" cannot be found/read");
+        return;
+      }
+      int idx = 0;
+      int numReads = 0;
+      int numHaplotypes = 0;
+      int readIdx = 0, testCaseIdx = 0, haplotypeIdx = 0;
+      LinkedList<JNIHaplotypeDataHolderClass> haplotypeList = new LinkedList<JNIHaplotypeDataHolderClass>();
+      LinkedList<JNIReadDataHolderClass> readList = new LinkedList<JNIReadDataHolderClass>();
+      
+      byte[][] byteArray = new byte[6][];
+      boolean firstLine = true;
+      String[] currTokens = new String[8];
+      while(input.hasNextLine())
+      {
+        String line = input.nextLine();
+        Scanner lineScanner = new Scanner(line);
+        idx = 0;
+        while(lineScanner.hasNext())
+          currTokens[idx++] = lineScanner.next();
+        if(idx == 0)
+          break;
+        assert(idx >= 6);
+        //start of new region
+        if(idx == 8)
+        {
+          if(!firstLine)
+          {
+            initialize(haplotypeList);
+            computeLikelihoods(readList, haplotypeList);
+            finalizeRegion();
+          }
+          try
+          {
+            numReads = Integer.parseInt(currTokens[6]);
+          }
+          catch(NumberFormatException e)
+          {
+            numReads = 1;
+          }
+          try
+          {
+            numHaplotypes = Integer.parseInt(currTokens[7]);
+          }
+          catch(NumberFormatException e)
+          {
+            numHaplotypes = 1;
+          }
+          haplotypeIdx = readIdx = testCaseIdx = 0;
+          readList.clear();
+          haplotypeList.clear();
+        }
+        if(haplotypeIdx < numHaplotypes)
+        {
+          JNIHaplotypeDataHolderClass X = new JNIHaplotypeDataHolderClass();
+          X.haplotypeBases = currTokens[0].getBytes();
+          haplotypeList.add(X);
+        }
+        if(testCaseIdx%numHaplotypes == 0)
+        {
+          JNIReadDataHolderClass X = new JNIReadDataHolderClass();
+          X.readBases = currTokens[1].getBytes();
+          for(int i=2;i<6;++i)
+          {
+            byteArray[i] = currTokens[i].getBytes();
+            for(int j=0;j<byteArray[i].length;++j)
+              byteArray[i][j] -= 33;       //normalize
+          }
+          X.readQuals = byteArray[2];
+          X.insertionGOP = byteArray[3];
+          X.deletionGOP = byteArray[4];
+          X.overallGCP = byteArray[5];
+          readList.add(X);
+        }
+        ++testCaseIdx;
+        ++haplotypeIdx;
+
+        lineScanner.close();
+        firstLine = false;
+      }
+      if(haplotypeList.size() > 0 && readList.size() > 0)
+      {
+        initialize(haplotypeList);
+        computeLikelihoods(readList, haplotypeList);
+        finalizeRegion();
+      }
+
+      close();
+      input.close();
+    }
+
+    private native void doEverythingNative(String filename);
+
+    public static void main(String[] args)
+    {
+      if(args.length <= 0)
+      {
+        System.err.println("Needs 1 argument - <filename>");
+        System.exit(-1);
+      }
+      //// Get runtime
+      //java.lang.Runtime rt = java.lang.Runtime.getRuntime();
+      //// Start a new process: UNIX command ls
+      //String cmd = "/home/karthikg/broad/gsa-unstable/public/c++/VectorPairHMM/checker "+args[0];
+      //try
+      //{
+        //System.out.println(cmd);
+        //java.lang.Process p = rt.exec(cmd);
+        //try
+        //{
+          //p.waitFor();
+          //java.io.InputStream is = p.getInputStream();
+          //java.io.BufferedReader reader = new java.io.BufferedReader(new InputStreamReader(is));
+          //// And print each line
+          //String s = null;
+          //while ((s = reader.readLine()) != null) {
+            //System.out.println(s);
+          //}
+          //is.close();
+        //}
+        //catch(InterruptedException e)
+        //{
+          //System.err.println(e);
+        //}
+      //}
+      //catch(IOException e)
+      //{
+        //System.err.println(e);
+      //}
+      Sandbox t = new Sandbox();
+      //t.doEverythingNative(args[0]);
+      t.parseSandboxFile(args[0]);
+    }
+}
diff --git a/public/VectorPairHMM/src/main/c++/Sandbox_JNIHaplotypeDataHolderClass.h b/public/VectorPairHMM/src/main/c++/Sandbox_JNIHaplotypeDataHolderClass.h
new file mode 100644
index 000000000..7f78f0178
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/Sandbox_JNIHaplotypeDataHolderClass.h
@@ -0,0 +1,13 @@
+/* DO NOT EDIT THIS FILE - it is machine generated */
+#include <jni.h>
+/* Header for class Sandbox_JNIHaplotypeDataHolderClass */
+
+#ifndef _Included_Sandbox_JNIHaplotypeDataHolderClass
+#define _Included_Sandbox_JNIHaplotypeDataHolderClass
+#ifdef __cplusplus
+extern "C" {
+#endif
+#ifdef __cplusplus
+}
+#endif
+#endif
diff --git a/public/VectorPairHMM/src/main/c++/Sandbox_JNIReadDataHolderClass.h b/public/VectorPairHMM/src/main/c++/Sandbox_JNIReadDataHolderClass.h
new file mode 100644
index 000000000..a9312ff3b
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/Sandbox_JNIReadDataHolderClass.h
@@ -0,0 +1,13 @@
+/* DO NOT EDIT THIS FILE - it is machine generated */
+#include <jni.h>
+/* Header for class Sandbox_JNIReadDataHolderClass */
+
+#ifndef _Included_Sandbox_JNIReadDataHolderClass
+#define _Included_Sandbox_JNIReadDataHolderClass
+#ifdef __cplusplus
+extern "C" {
+#endif
+#ifdef __cplusplus
+}
+#endif
+#endif
diff --git a/public/VectorPairHMM/src/main/c++/avx_function_instantiations.cc b/public/VectorPairHMM/src/main/c++/avx_function_instantiations.cc
new file mode 100644
index 000000000..6d90d5070
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/avx_function_instantiations.cc
@@ -0,0 +1,44 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#include "template.h"
+
+#undef SIMD_ENGINE
+#undef SIMD_ENGINE_SSE
+
+#define SIMD_ENGINE avx
+#define SIMD_ENGINE_AVX
+
+#include "define-float.h"
+#include "shift_template.c"
+#include "pairhmm-template-kernel.cc"
+
+#include "define-double.h"
+#include "shift_template.c"
+#include "pairhmm-template-kernel.cc"
+
+template double compute_full_prob_avxd<double>(testcase* tc, double* nextlog);
+template float compute_full_prob_avxs<float>(testcase* tc, float* nextlog);
+
diff --git a/public/VectorPairHMM/src/main/c++/baseline.cc b/public/VectorPairHMM/src/main/c++/baseline.cc
new file mode 100644
index 000000000..d6085e661
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/baseline.cc
@@ -0,0 +1,167 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#include "headers.h"
+#include "template.h"
+#include "utils.h"
+#include "LoadTimeInitializer.h"
+using namespace std;
+
+template<class NUMBER>
+NUMBER compute_full_prob(testcase *tc, NUMBER *before_last_log)
+{
+  int r, c;
+  int ROWS = tc->rslen + 1;
+  int COLS = tc->haplen + 1;
+
+  Context<NUMBER> ctx;
+  //#define USE_STACK_ALLOCATION 1
+#ifdef USE_STACK_ALLOCATION
+  NUMBER M[ROWS][COLS];
+  NUMBER X[ROWS][COLS];
+  NUMBER Y[ROWS][COLS];
+  NUMBER p[ROWS][6];
+#else
+  //allocate on heap in way that simulates a 2D array. Having a 2D array instead of
+  //a straightforward array of pointers ensures that all data lies 'close' in memory, increasing
+  //the chance of being stored together in the cache. Also, prefetchers can learn memory access
+  //patterns for 2D arrays, not possible for array of pointers
+  //bool locally_allocated = false;
+  //NUMBER* common_buffer = 0;
+  NUMBER* common_buffer = new NUMBER[3*ROWS*COLS + ROWS*6];
+  //unsigned curr_size = sizeof(NUMBER)*(3*ROWS*COLS + ROWS*6);
+  //if(true)
+  //{
+  //common_buffer = new NUMBER[3*ROWS*COLS + ROWS*6];
+  //locally_allocated = true;
+  //}
+  //else
+  //common_buffer = (NUMBER*)(g_load_time_initializer.get_buffer()); 
+  //pointers to within the allocated buffer
+  NUMBER** common_pointer_buffer = new NUMBER*[4*ROWS];
+  NUMBER* ptr = common_buffer;
+  unsigned i = 0;
+  for(i=0;i<3*ROWS;++i, ptr+=COLS)
+    common_pointer_buffer[i] = ptr;
+  for(;i<4*ROWS;++i, ptr+=6)
+    common_pointer_buffer[i] = ptr;
+
+  NUMBER** M = common_pointer_buffer;
+  NUMBER** X = M + ROWS;
+  NUMBER** Y = X + ROWS;
+  NUMBER** p = Y + ROWS;
+#endif
+
+
+  p[0][MM] = ctx._(0.0);
+  p[0][GapM] = ctx._(0.0);
+  p[0][MX] = ctx._(0.0);
+  p[0][XX] = ctx._(0.0);
+  p[0][MY] = ctx._(0.0);
+  p[0][YY] = ctx._(0.0);
+
+  for (r = 1; r < ROWS; r++)
+  {
+    int _i = tc->i[r-1] & 127;
+    int _d = tc->d[r-1] & 127;
+    int _c = tc->c[r-1] & 127;
+    //p[r][MM] = ctx._(1.0) - ctx.ph2pr[(_i + _d) & 127];
+    SET_MATCH_TO_MATCH_PROB(p[r][MM], _i, _d);
+    p[r][GapM] = ctx._(1.0) - ctx.ph2pr[_c];
+    p[r][MX] = ctx.ph2pr[_i];
+    p[r][XX] = ctx.ph2pr[_c];
+    p[r][MY] = ctx.ph2pr[_d];
+    p[r][YY] = ctx.ph2pr[_c];
+    //p[r][MY] = (r == ROWS - 1) ? ctx._(1.0) : ctx.ph2pr[_d];
+    //p[r][YY] = (r == ROWS - 1) ? ctx._(1.0) : ctx.ph2pr[_c];
+  }
+  for (c = 0; c < COLS; c++)
+  {
+    M[0][c] = ctx._(0.0);
+    X[0][c] = ctx._(0.0);
+    Y[0][c] = ctx.INITIAL_CONSTANT / (tc->haplen);
+  }
+
+  for (r = 1; r < ROWS; r++)
+  {
+    M[r][0] = ctx._(0.0);
+    X[r][0] = X[r-1][0] * p[r][XX];
+    Y[r][0] = ctx._(0.0);
+  }
+
+  NUMBER result = ctx._(0.0);
+
+  for (r = 1; r < ROWS; r++)
+    for (c = 1; c < COLS; c++)
+    {
+      fexcept_t flagp;
+      char _rs = tc->rs[r-1];
+      char _hap = tc->hap[c-1];
+      int _q = tc->q[r-1] & 127;
+      NUMBER distm = ctx.ph2pr[_q];
+      if (_rs == _hap || _rs == 'N' || _hap == 'N')
+        distm = ctx._(1.0) - distm;
+      else
+        distm = distm/3;
+
+
+      //feclearexcept(FE_ALL_EXCEPT);
+      M[r][c] = distm * (M[r-1][c-1] * p[r][MM] + X[r-1][c-1] * p[r][GapM] + Y[r-1][c-1] * p[r][GapM]);
+      //STORE_FP_EXCEPTIONS(flagp, exceptions_array);
+
+      //feclearexcept(FE_ALL_EXCEPT);
+      X[r][c] = M[r-1][c] * p[r][MX] + X[r-1][c] * p[r][XX];
+      //STORE_FP_EXCEPTIONS(flagp, exceptions_array);
+
+      //feclearexcept(FE_ALL_EXCEPT);
+      Y[r][c] = M[r][c-1] * p[r][MY] + Y[r][c-1] * p[r][YY];
+      //STORE_FP_EXCEPTIONS(flagp, exceptions_array);
+
+      //CONVERT_AND_PRINT(M[r][c]);
+      //CONVERT_AND_PRINT(X[r][c]);
+      //CONVERT_AND_PRINT(Y[r][c]);
+
+    }
+  for (c = 0; c < COLS; c++)
+  {
+    result += M[ROWS-1][c] + X[ROWS-1][c];
+  }
+
+  if (before_last_log != NULL)
+    *before_last_log = result;
+
+#ifndef USE_STACK_ALLOCATION
+  delete common_pointer_buffer;
+  //if(locally_allocated)
+  delete common_buffer;
+#endif
+
+  return result;
+  //return ctx.LOG10(result) - ctx.LOG10_INITIAL_CONSTANT;
+}
+
+template double compute_full_prob<double>(testcase* tc, double* nextbuf);
+template float compute_full_prob<float>(testcase* tc, float* nextbuf);
+
diff --git a/public/VectorPairHMM/src/main/c++/define-double.h b/public/VectorPairHMM/src/main/c++/define-double.h
new file mode 100644
index 000000000..2067d369c
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/define-double.h
@@ -0,0 +1,205 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#include <iostream>
+
+#ifdef PRECISION
+#undef PRECISION
+#undef MAIN_TYPE
+#undef MAIN_TYPE_SIZE
+#undef UNION_TYPE
+#undef IF_128
+#undef IF_MAIN_TYPE
+#undef SHIFT_CONST1
+#undef SHIFT_CONST2
+#undef SHIFT_CONST3
+#undef _128_TYPE
+#undef SIMD_TYPE
+#undef AVX_LENGTH
+#undef HAP_TYPE
+#undef MASK_TYPE
+#undef MASK_ALL_ONES
+
+#undef SET_VEC_ZERO(__vec)
+#undef VEC_OR(__v1, __v2)
+#undef VEC_ADD(__v1, __v2)
+#undef VEC_SUB(__v1, __v2)
+#undef VEC_MUL(__v1, __v2)
+#undef VEC_DIV(__v1, __v2)
+#undef VEC_BLEND(__v1, __v2, __mask)
+#undef VEC_BLENDV(__v1, __v2, __maskV)
+#undef VEC_CAST_256_128(__v1)
+#undef VEC_EXTRACT_128(__v1, __im)
+#undef VEC_EXTRACT_UNIT(__v1, __im)
+#undef VEC_SET1_VAL128(__val)
+#undef VEC_MOVE(__v1, __val)
+#undef VEC_CAST_128_256(__v1)
+#undef VEC_INSERT_VAL(__v1, __val, __pos)
+#undef VEC_CVT_128_256(__v1)
+#undef VEC_SET1_VAL(__val)
+#undef VEC_POPCVT_CHAR(__ch)
+#undef VEC_LDPOPCVT_CHAR(__addr)
+#undef VEC_CMP_EQ(__v1, __v2)
+#undef VEC_SET_LSE(__val)
+#undef SHIFT_HAP(__v1, __val)
+#undef MASK_VEC
+#undef VEC_SSE_TO_AVX(__vsLow, __vsHigh, __vdst)
+#undef VEC_SHIFT_LEFT_1BIT(__vs)
+#undef MASK_ALL_ONES
+#undef COMPARE_VECS(__v1, __v2)
+#undef _256_INT_TYPE
+#undef BITMASK_VEC
+#endif
+
+#define PRECISION d
+#define MAIN_TYPE double
+#define MAIN_TYPE_SIZE 64
+#define UNION_TYPE mix_D
+#define IF_128 IF_128d
+#define IF_MAIN_TYPE IF_64
+#define SHIFT_CONST1 8
+#define SHIFT_CONST2 1
+#define SHIFT_CONST3 8
+#define _128_TYPE __m128d
+#define SIMD_TYPE __m256d
+#define _256_INT_TYPE __m256i
+#define AVX_LENGTH 4
+#define HAP_TYPE __m128i
+#define MASK_TYPE uint64_t
+#define MASK_ALL_ONES 0xFFFFFFFFFFFFFFFF
+#define MASK_VEC MaskVec_D
+
+#define SET_VEC_ZERO(__vec)                     \
+    __vec= _mm256_setzero_pd()
+
+#define VEC_OR(__v1, __v2)                      \
+    _mm256_or_pd(__v1, __v2)
+
+#define VEC_ADD(__v1, __v2)                     \
+    _mm256_add_pd(__v1, __v2)
+
+#define VEC_SUB(__v1, __v2)                     \
+    _mm256_sub_pd(__v1, __v2)
+
+#define VEC_MUL(__v1, __v2)                     \
+    _mm256_mul_pd(__v1, __v2)
+
+#define VEC_DIV(__v1, __v2)                     \
+    _mm256_div_pd(__v1, __v2)
+
+#define VEC_BLEND(__v1, __v2, __mask)           \
+    _mm256_blend_pd(__v1, __v2, __mask)
+
+#define VEC_BLENDV(__v1, __v2, __maskV)         \
+    _mm256_blendv_pd(__v1, __v2, __maskV)
+
+#define VEC_CAST_256_128(__v1)                  \
+    _mm256_castpd256_pd128 (__v1)
+
+#define VEC_EXTRACT_128(__v1, __im)             \
+    _mm256_extractf128_pd (__v1, __im)
+
+#define VEC_EXTRACT_UNIT(__v1, __im)            \
+    _mm_extract_epi64(__v1, __im)
+
+#define VEC_SET1_VAL128(__val)                  \
+    _mm_set1_pd(__val)
+
+#define VEC_MOVE(__v1, __val)                   \
+    _mm_move_sd(__v1, __val)
+
+#define VEC_CAST_128_256(__v1)                  \
+    _mm256_castpd128_pd256(__v1)
+
+#define VEC_INSERT_VAL(__v1, __val, __pos)      \
+    _mm256_insertf128_pd(__v1, __val, __pos)
+
+#define VEC_CVT_128_256(__v1)                   \
+    _mm256_cvtepi32_pd(__v1)
+
+#define VEC_SET1_VAL(__val)                     \
+    _mm256_set1_pd(__val)
+
+#define VEC_POPCVT_CHAR(__ch)                   \
+    _mm256_cvtepi32_pd(_mm_set1_epi32(__ch))
+
+#define VEC_LDPOPCVT_CHAR(__addr)               \
+    _mm256_cvtepi32_pd(_mm_load_si128((__m128i const *)__addr))
+
+#define VEC_CMP_EQ(__v1, __v2)                  \
+    _mm256_cmp_pd(__v1, __v2, _CMP_EQ_OQ)
+
+#define VEC_SET_LSE(__val)                      \
+    _mm256_set_pd(zero, zero, zero, __val);
+
+#define SHIFT_HAP(__v1, __val)                  \
+    __v1 = _mm_insert_epi32(_mm_slli_si128(__v1, 4), __val.i, 0)
+
+#define VEC_SSE_TO_AVX(__vsLow, __vsHigh, __vdst)       \
+    __vdst = _mm256_castpd128_pd256(__vsLow) ;            \
+__vdst = _mm256_insertf128_pd(__vdst, __vsHigh, 1) ;
+
+#define VEC_SHIFT_LEFT_1BIT(__vs)               \
+    __vs = _mm_slli_epi64(__vs, 1)
+
+
+#define COMPARE_VECS(__v1, __v2, __first, __last) {                     \
+    double* ptr1 = (double*) (&__v1) ;                                  \
+    double* ptr2 = (double*) (&__v2) ;                                  \
+    for (int ei=__first; ei <= __last; ++ei) {                          \
+        if (ptr1[ei] != ptr2[ei]) {                                       \
+            std::cout << "Double Mismatch at " << ei << ": "                \
+            << ptr1[ei] << " vs. " << ptr2[ei] << std::endl ;     \
+            exit(0) ;                                                       \
+        }                                                                 \
+    }                                                                   \
+}
+
+class BitMaskVec_double {
+
+    MASK_VEC low_, high_ ;
+    SIMD_TYPE combined_ ;
+
+    public:
+    inline MASK_TYPE& getLowEntry(int index) {
+        return low_.masks[index] ;
+    }
+    inline MASK_TYPE& getHighEntry(int index) {
+        return high_.masks[index] ;
+    }
+
+    inline const SIMD_TYPE& getCombinedMask() {
+        VEC_SSE_TO_AVX(low_.vecf, high_.vecf, combined_) ;
+        return combined_ ;
+    }
+
+    inline void shift_left_1bit() {
+        VEC_SHIFT_LEFT_1BIT(low_.vec) ;
+        VEC_SHIFT_LEFT_1BIT(high_.vec) ;
+    }
+
+} ;
+
+#define BITMASK_VEC BitMaskVec_double
diff --git a/public/VectorPairHMM/src/main/c++/define-float.h b/public/VectorPairHMM/src/main/c++/define-float.h
new file mode 100644
index 000000000..318f78280
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/define-float.h
@@ -0,0 +1,206 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#include <iostream>
+
+#ifdef PRECISION
+#undef PRECISION
+#undef MAIN_TYPE
+#undef MAIN_TYPE_SIZE
+#undef UNION_TYPE
+#undef IF_128
+#undef IF_MAIN_TYPE
+#undef SHIFT_CONST1
+#undef SHIFT_CONST2
+#undef SHIFT_CONST3
+#undef _128_TYPE
+#undef SIMD_TYPE
+#undef AVX_LENGTH
+#undef HAP_TYPE
+#undef MASK_TYPE
+#undef MASK_ALL_ONES
+
+#undef SET_VEC_ZERO(__vec)
+#undef VEC_OR(__v1, __v2)
+#undef VEC_ADD(__v1, __v2)
+#undef VEC_SUB(__v1, __v2)
+#undef VEC_MUL(__v1, __v2)
+#undef VEC_DIV(__v1, __v2)
+#undef VEC_BLEND(__v1, __v2, __mask)
+#undef VEC_BLENDV(__v1, __v2, __maskV)
+#undef VEC_CAST_256_128(__v1)
+#undef VEC_EXTRACT_128(__v1, __im)
+#undef VEC_EXTRACT_UNIT(__v1, __im)
+#undef VEC_SET1_VAL128(__val)
+#undef VEC_MOVE(__v1, __val)
+#undef VEC_CAST_128_256(__v1)
+#undef VEC_INSERT_VAL(__v1, __val, __pos)
+#undef VEC_CVT_128_256(__v1)
+#undef VEC_SET1_VAL(__val)
+#undef VEC_POPCVT_CHAR(__ch)
+#undef VEC_LDPOPCVT_CHAR(__addr)
+#undef VEC_CMP_EQ(__v1, __v2)
+#undef VEC_SET_LSE(__val)
+#undef SHIFT_HAP(__v1, __val)
+#undef MASK_VEC
+#undef VEC_SSE_TO_AVX(__vsLow, __vsHigh, __vdst)
+#undef VEC_SHIFT_LEFT_1BIT(__vs)
+#undef MASK_ALL_ONES
+#undef COMPARE_VECS(__v1, __v2)
+#undef _256_INT_TYPE
+#undef BITMASK_VEC
+#endif
+
+#define PRECISION s
+
+#define MAIN_TYPE float
+#define MAIN_TYPE_SIZE 32
+#define UNION_TYPE mix_F
+#define IF_128 IF_128f
+#define IF_MAIN_TYPE IF_32
+#define SHIFT_CONST1 12
+#define SHIFT_CONST2 3
+#define SHIFT_CONST3 4
+#define _128_TYPE __m128
+#define SIMD_TYPE __m256
+#define _256_INT_TYPE __m256i
+#define AVX_LENGTH 8
+#define HAP_TYPE UNION_TYPE
+#define MASK_TYPE uint32_t
+#define MASK_ALL_ONES 0xFFFFFFFF
+#define MASK_VEC MaskVec_F
+
+#define SET_VEC_ZERO(__vec)                     \
+    __vec= _mm256_setzero_ps()
+
+#define VEC_OR(__v1, __v2)                      \
+    _mm256_or_ps(__v1, __v2)
+
+#define VEC_ADD(__v1, __v2)                     \
+    _mm256_add_ps(__v1, __v2)
+
+#define VEC_SUB(__v1, __v2)                     \
+    _mm256_sub_ps(__v1, __v2)
+
+#define VEC_MUL(__v1, __v2)                     \
+    _mm256_mul_ps(__v1, __v2)
+
+#define VEC_DIV(__v1, __v2)                     \
+    _mm256_div_ps(__v1, __v2)
+
+#define VEC_BLEND(__v1, __v2, __mask)           \
+    _mm256_blend_ps(__v1, __v2, __mask)
+
+#define VEC_BLENDV(__v1, __v2, __maskV)         \
+    _mm256_blendv_ps(__v1, __v2, __maskV)
+
+#define VEC_CAST_256_128(__v1)                  \
+    _mm256_castps256_ps128 (__v1)
+
+#define VEC_EXTRACT_128(__v1, __im)             \
+    _mm256_extractf128_ps (__v1, __im)
+
+#define VEC_EXTRACT_UNIT(__v1, __im)            \
+    _mm_extract_epi32(__v1, __im)
+
+#define VEC_SET1_VAL128(__val)                  \
+    _mm_set1_ps(__val)
+
+#define VEC_MOVE(__v1, __val)                   \
+    _mm_move_ss(__v1, __val)
+
+#define VEC_CAST_128_256(__v1)                  \
+    _mm256_castps128_ps256(__v1)
+
+#define VEC_INSERT_VAL(__v1, __val, __pos)      \
+    _mm256_insertf128_ps(__v1, __val, __pos)
+
+#define VEC_CVT_128_256(__v1)                   \
+    _mm256_cvtepi32_ps(__v1.i)
+
+#define VEC_SET1_VAL(__val)                     \
+    _mm256_set1_ps(__val)
+
+#define VEC_POPCVT_CHAR(__ch)                   \
+    _mm256_cvtepi32_ps(_mm256_set1_epi32(__ch))
+
+#define VEC_LDPOPCVT_CHAR(__addr)               \
+    _mm256_cvtepi32_ps(_mm256_loadu_si256((__m256i const *)__addr))
+
+#define VEC_CMP_EQ(__v1, __v2)                  \
+    _mm256_cmp_ps(__v1, __v2, _CMP_EQ_OQ)
+
+#define VEC_SET_LSE(__val)                      \
+    _mm256_set_ps(zero, zero, zero, zero, zero, zero, zero, __val);
+
+#define SHIFT_HAP(__v1, __val)                  \
+    _vector_shift_lastavxs(__v1, __val.f);
+
+#define VEC_SSE_TO_AVX(__vsLow, __vsHigh, __vdst)       \
+    __vdst = _mm256_castps128_ps256(__vsLow) ;            \
+__vdst = _mm256_insertf128_ps(__vdst, __vsHigh, 1) ;
+
+#define VEC_SHIFT_LEFT_1BIT(__vs)               \
+    __vs = _mm_slli_epi32(__vs, 1)
+
+#define COMPARE_VECS(__v1, __v2, __first, __last) {                     \
+    float* ptr1 = (float*) (&__v1) ;                                    \
+    float* ptr2 = (float*) (&__v2) ;                                    \
+    for (int ei=__first; ei <= __last; ++ei) {                          \
+        if (ptr1[ei] != ptr2[ei]) {                                       \
+            std::cout << "Float Mismatch at " << ei << ": "                 \
+            << ptr1[ei] << " vs. " << ptr2[ei] << std::endl ;     \
+            exit(0) ;                                                       \
+        }                                                                 \
+    }                                                                   \
+}
+
+class BitMaskVec_float {
+
+    MASK_VEC low_, high_ ;
+    SIMD_TYPE combined_ ;
+
+    public:
+
+    inline MASK_TYPE& getLowEntry(int index) {
+        return low_.masks[index] ;
+    }
+    inline MASK_TYPE& getHighEntry(int index) {
+        return high_.masks[index] ;
+    }
+
+    inline const SIMD_TYPE& getCombinedMask() {
+        VEC_SSE_TO_AVX(low_.vecf, high_.vecf, combined_) ;
+        return combined_ ;
+    }
+
+    inline void shift_left_1bit() {
+        VEC_SHIFT_LEFT_1BIT(low_.vec) ;
+        VEC_SHIFT_LEFT_1BIT(high_.vec) ;
+    }
+
+} ;
+
+#define BITMASK_VEC BitMaskVec_float
diff --git a/public/VectorPairHMM/src/main/c++/define-sse-double.h b/public/VectorPairHMM/src/main/c++/define-sse-double.h
new file mode 100644
index 000000000..2d271a854
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/define-sse-double.h
@@ -0,0 +1,173 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#ifdef PRECISION
+#undef PRECISION
+#undef MAIN_TYPE
+#undef MAIN_TYPE_SIZE
+#undef UNION_TYPE
+#undef IF_128
+#undef IF_MAIN_TYPE
+#undef SHIFT_CONST1
+#undef SHIFT_CONST2
+#undef SHIFT_CONST3
+#undef _128_TYPE
+#undef SIMD_TYPE
+#undef AVX_LENGTH
+#undef HAP_TYPE
+#undef MASK_TYPE
+#undef MASK_ALL_ONES
+
+#undef VEC_EXTRACT_UNIT(__v1, __im)
+#undef VEC_INSERT_UNIT(__v1,__ins,__im)
+#undef SET_VEC_ZERO(__vec)
+#undef VEC_OR(__v1, __v2)
+#undef VEC_ADD(__v1, __v2)
+#undef VEC_SUB(__v1, __v2)
+#undef VEC_MUL(__v1, __v2)
+#undef VEC_DIV(__v1, __v2)
+#undef VEC_BLEND(__v1, __v2, __mask)
+#undef VEC_BLENDV(__v1, __v2, __maskV)
+#undef VEC_CAST_256_128(__v1)
+#undef VEC_EXTRACT_128(__v1, __im)
+#undef VEC_EXTRACT_UNIT(__v1, __im)
+#undef VEC_SET1_VAL128(__val)
+#undef VEC_MOVE(__v1, __val)
+#undef VEC_CAST_128_256(__v1)
+#undef VEC_INSERT_VAL(__v1, __val, __pos)
+#undef VEC_CVT_128_256(__v1)
+#undef VEC_SET1_VAL(__val)
+#undef VEC_POPCVT_CHAR(__ch)
+#undef VEC_LDPOPCVT_CHAR(__addr)
+#undef VEC_CMP_EQ(__v1, __v2)
+#undef VEC_SET_LSE(__val)
+#undef SHIFT_HAP(__v1, __val)
+#undef MASK_VEC
+#undef VEC_SSE_TO_AVX(__vsLow, __vsHigh, __vdst)
+#undef VEC_SHIFT_LEFT_1BIT(__vs)
+#undef MASK_ALL_ONES
+#undef COMPARE_VECS(__v1, __v2)
+#undef _256_INT_TYPE
+#undef BITMASK_VEC
+#endif
+
+#define SSE
+#define PRECISION d
+
+#define MAIN_TYPE double
+#define MAIN_TYPE_SIZE 64
+#define UNION_TYPE mix_D128
+#define IF_128 IF_128d
+#define IF_MAIN_TYPE IF_64
+#define SHIFT_CONST1 1
+#define SHIFT_CONST2 8
+#define SHIFT_CONST3 0
+#define _128_TYPE __m128d
+#define SIMD_TYPE __m128d
+#define _256_INT_TYPE __m128i
+#define AVX_LENGTH 2
+#define HAP_TYPE __m128i
+#define MASK_TYPE uint64_t
+#define MASK_ALL_ONES 0xFFFFFFFFFFFFFFFFL
+#define MASK_VEC MaskVec_D
+
+#define VEC_EXTRACT_UNIT(__v1, __im)            \
+    _mm_extract_epi64(__v1, __im)
+
+#define VEC_INSERT_UNIT(__v1,__ins,__im)        \
+    _mm_insert_epi64(__v1,__ins,__im)
+
+#define VEC_OR(__v1, __v2)                      \
+    _mm_or_pd(__v1, __v2)
+
+#define VEC_ADD(__v1, __v2)                     \
+    _mm_add_pd(__v1, __v2)
+
+#define VEC_SUB(__v1, __v2)                     \
+    _mm_sub_pd(__v1, __v2)
+
+#define VEC_MUL(__v1, __v2)                     \
+    _mm_mul_pd(__v1, __v2)
+
+#define VEC_DIV(__v1, __v2)                     \
+    _mm_div_pd(__v1, __v2)
+
+#define VEC_CMP_EQ(__v1, __v2)                  \
+    _mm_cmpeq_pd(__v1, __v2)
+
+#define VEC_BLEND(__v1, __v2, __mask)           \
+    _mm_blend_pd(__v1, __v2, __mask)
+
+#define VEC_BLENDV(__v1, __v2, __maskV)         \
+    _mm_blendv_pd(__v1, __v2, __maskV)
+
+#define SHIFT_HAP(__v1, __val)                  \
+    __v1 = _mm_insert_epi32(_mm_slli_si128(__v1, 4), __val.i, 0)
+
+#define VEC_CVT_128_256(__v1)                   \
+    _mm_cvtepi32_pd(__v1)
+
+#define VEC_SET1_VAL(__val)                     \
+    _mm_set1_pd(__val)
+
+#define VEC_POPCVT_CHAR(__ch)                   \
+    _mm_cvtepi32_pd(_mm_set1_epi32(__ch))
+
+#define VEC_SET_LSE(__val)                      \
+    _mm_set_pd(zero, __val);
+
+#define VEC_LDPOPCVT_CHAR(__addr)               \
+    _mm_cvtepi32_pd(_mm_loadu_si128((__m128i const *)__addr))
+
+#define VEC_SSE_TO_AVX(__vsLow, __vsHigh, __vdst)       \
+    __vdst = _mm_castsi128_pd(_mm_set_epi64(__vsHigh, __vsLow))
+
+#define VEC_SHIFT_LEFT_1BIT(__vs)               \
+    __vs = _mm_slli_epi64(__vs, 1)
+
+
+class BitMaskVec_sse_double {
+
+    MASK_VEC combined_ ;
+    public:
+    inline MASK_TYPE& getLowEntry(int index) {
+        return combined_.masks[index] ;
+    }
+    inline MASK_TYPE& getHighEntry(int index) {
+        return combined_.masks[AVX_LENGTH/2+index] ;
+    }
+
+    inline const SIMD_TYPE& getCombinedMask() {
+        return combined_.vecf ;
+    }
+
+    inline void shift_left_1bit() {
+        VEC_SHIFT_LEFT_1BIT(combined_.vec) ;
+    }
+
+} ;
+
+#define BITMASK_VEC BitMaskVec_sse_double
+
diff --git a/public/VectorPairHMM/src/main/c++/define-sse-float.h b/public/VectorPairHMM/src/main/c++/define-sse-float.h
new file mode 100644
index 000000000..20af947dd
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/define-sse-float.h
@@ -0,0 +1,173 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#ifdef PRECISION
+#undef PRECISION
+#undef MAIN_TYPE
+#undef MAIN_TYPE_SIZE
+#undef UNION_TYPE
+#undef IF_128
+#undef IF_MAIN_TYPE
+#undef SHIFT_CONST1
+#undef SHIFT_CONST2
+#undef SHIFT_CONST3
+#undef _128_TYPE
+#undef SIMD_TYPE
+#undef AVX_LENGTH
+#undef HAP_TYPE
+#undef MASK_TYPE
+#undef MASK_ALL_ONES
+
+#undef VEC_EXTRACT_UNIT(__v1, __im)
+#undef VEC_INSERT_UNIT(__v1,__ins,__im)
+#undef SET_VEC_ZERO(__vec)
+#undef VEC_OR(__v1, __v2)
+#undef VEC_ADD(__v1, __v2)
+#undef VEC_SUB(__v1, __v2)
+#undef VEC_MUL(__v1, __v2)
+#undef VEC_DIV(__v1, __v2)
+#undef VEC_BLEND(__v1, __v2, __mask)
+#undef VEC_BLENDV(__v1, __v2, __maskV)
+#undef VEC_CAST_256_128(__v1)
+#undef VEC_EXTRACT_128(__v1, __im)
+#undef VEC_EXTRACT_UNIT(__v1, __im)
+#undef VEC_SET1_VAL128(__val)
+#undef VEC_MOVE(__v1, __val)
+#undef VEC_CAST_128_256(__v1)
+#undef VEC_INSERT_VAL(__v1, __val, __pos)
+#undef VEC_CVT_128_256(__v1)
+#undef VEC_SET1_VAL(__val)
+#undef VEC_POPCVT_CHAR(__ch)
+#undef VEC_LDPOPCVT_CHAR(__addr)
+#undef VEC_CMP_EQ(__v1, __v2)
+#undef VEC_SET_LSE(__val)
+#undef SHIFT_HAP(__v1, __val)
+#undef MASK_VEC
+#undef VEC_SSE_TO_AVX(__vsLow, __vsHigh, __vdst)
+#undef VEC_SHIFT_LEFT_1BIT(__vs)
+#undef MASK_ALL_ONES
+#undef COMPARE_VECS(__v1, __v2)
+#undef _256_INT_TYPE
+#undef BITMASK_VEC
+#endif
+
+#define SSE
+#define PRECISION s
+
+#define MAIN_TYPE float
+#define MAIN_TYPE_SIZE 32
+#define UNION_TYPE mix_F128
+#define IF_128 IF_128f
+#define IF_MAIN_TYPE IF_32
+#define SHIFT_CONST1 3
+#define SHIFT_CONST2 4
+#define SHIFT_CONST3 0
+#define _128_TYPE __m128
+#define SIMD_TYPE __m128
+#define _256_INT_TYPE __m128i
+#define AVX_LENGTH 4
+//#define MAVX_COUNT  (MROWS+3)/AVX_LENGTH
+#define HAP_TYPE UNION_TYPE
+#define MASK_TYPE uint32_t
+#define MASK_ALL_ONES 0xFFFFFFFF
+#define MASK_VEC MaskVec_F
+
+#define VEC_EXTRACT_UNIT(__v1, __im)            \
+    _mm_extract_epi32(__v1, __im)
+
+#define VEC_INSERT_UNIT(__v1,__ins,__im)        \
+    _mm_insert_epi32(__v1,__ins,__im)
+
+#define VEC_OR(__v1, __v2)                      \
+    _mm_or_ps(__v1, __v2)
+
+#define VEC_ADD(__v1, __v2)                     \
+    _mm_add_ps(__v1, __v2)
+
+#define VEC_SUB(__v1, __v2)                     \
+    _mm_sub_ps(__v1, __v2)
+
+#define VEC_MUL(__v1, __v2)                     \
+    _mm_mul_ps(__v1, __v2)
+
+#define VEC_DIV(__v1, __v2)                     \
+    _mm_div_ps(__v1, __v2)
+
+#define VEC_CMP_EQ(__v1, __v2)                  \
+    _mm_cmpeq_ps(__v1, __v2)
+
+#define VEC_BLEND(__v1, __v2, __mask)           \
+    _mm_blend_ps(__v1, __v2, __mask)
+
+#define VEC_BLENDV(__v1, __v2, __maskV)         \
+    _mm_blendv_ps(__v1, __v2, __maskV)
+
+#define SHIFT_HAP(__v1, __val)                  \
+    _vector_shift_lastsses(__v1, __val.f)
+
+#define VEC_CVT_128_256(__v1)                   \
+    _mm_cvtepi32_ps(__v1.i)
+
+#define VEC_SET1_VAL(__val)                     \
+    _mm_set1_ps(__val)
+
+#define VEC_POPCVT_CHAR(__ch)                   \
+    _mm_cvtepi32_ps(_mm_set1_epi32(__ch))
+
+#define VEC_SET_LSE(__val)                      \
+    _mm_set_ps(zero, zero, zero, __val);
+
+#define VEC_LDPOPCVT_CHAR(__addr)               \
+    _mm_cvtepi32_ps(_mm_loadu_si128((__m128i const *)__addr))
+
+#define VEC_SSE_TO_AVX(__vsLow, __vsHigh, __vdst)       \
+    __vdst = _mm_cvtpi32x2_ps(__vsLow, __vsHigh)
+
+#define VEC_SHIFT_LEFT_1BIT(__vs)               \
+    __vs = _mm_slli_epi32(__vs, 1)
+
+class BitMaskVec_sse_float {
+
+    MASK_VEC combined_ ;
+
+    public:
+    inline MASK_TYPE& getLowEntry(int index) {
+        return combined_.masks[index] ;
+    }
+    inline MASK_TYPE& getHighEntry(int index) {
+        return combined_.masks[AVX_LENGTH/2+index] ;
+    }
+
+    inline const SIMD_TYPE& getCombinedMask() {
+        return combined_.vecf ;
+    }
+
+    inline void shift_left_1bit() {
+        VEC_SHIFT_LEFT_1BIT(combined_.vec) ;
+    }
+
+} ;
+
+#define BITMASK_VEC BitMaskVec_sse_float
diff --git a/public/VectorPairHMM/src/main/c++/headers.h b/public/VectorPairHMM/src/main/c++/headers.h
new file mode 100644
index 000000000..4a0d89b57
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/headers.h
@@ -0,0 +1,71 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#ifndef COMMON_HEADERS_H
+#define COMMON_HEADERS_H
+
+#include <stdio.h>
+#include <string.h>
+#include <stdlib.h>
+#include <math.h>
+#include <stdint.h>
+#include <assert.h>
+#include <ctype.h>
+
+#include <sys/time.h>
+
+#include <immintrin.h>
+#include <emmintrin.h>
+#include <omp.h>
+
+#include <string>
+#include <iostream>
+#include <sstream>
+#include <fstream>
+#include <vector>
+#include <map>
+#include <set>
+#include <cstdio>
+#include <cstring>
+#include <cstdlib>
+#include <cmath>
+#include <fenv.h>
+
+extern uint64_t exceptions_array[128];
+extern FILE* g_debug_fptr;
+#define STORE_FP_EXCEPTIONS(flagp, exceptions_array)                                    \
+  fegetexceptflag(&flagp, FE_ALL_EXCEPT | __FE_DENORM);                                 \
+  exceptions_array[FE_INVALID] += ((flagp & FE_INVALID));                               \
+  exceptions_array[__FE_DENORM] += ((flagp & __FE_DENORM) >> 1);                        \
+  exceptions_array[FE_DIVBYZERO] += ((flagp & FE_DIVBYZERO) >> 2);                      \
+  exceptions_array[FE_OVERFLOW] += ((flagp & FE_OVERFLOW) >> 3);                        \
+  exceptions_array[FE_UNDERFLOW] += ((flagp & FE_UNDERFLOW) >> 4);                      \
+  feclearexcept(FE_ALL_EXCEPT | __FE_DENORM);                 
+
+#define CONVERT_AND_PRINT(X)                    \
+  g_converter.f = (X);                          \
+  fwrite(&(g_converter.i),4,1,g_debug_fptr);    \
+
+#endif
diff --git a/public/VectorPairHMM/src/main/c++/jni_common.h b/public/VectorPairHMM/src/main/c++/jni_common.h
new file mode 100644
index 000000000..23c323246
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/jni_common.h
@@ -0,0 +1,58 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#ifndef JNI_COMMON_H
+#define JNI_COMMON_H
+
+#include <jni.h>
+/*#define ENABLE_ASSERTIONS 1*/
+#define DO_PROFILING 1
+/*#define DEBUG 1*/
+/*#define DEBUG0_1 1*/
+/*#define DEBUG3 1*/
+/*#define DUMP_TO_SANDBOX 1*/
+
+
+#define DIRECT_ACCESS_TO_JAVA_HEAP_MEMORY 1
+
+#ifdef DIRECT_ACCESS_TO_JAVA_HEAP_MEMORY
+//Gets direct access to Java arrays
+#define GET_BYTE_ARRAY_ELEMENTS env->GetPrimitiveArrayCritical
+#define RELEASE_BYTE_ARRAY_ELEMENTS env->ReleasePrimitiveArrayCritical
+#define JNI_RO_RELEASE_MODE JNI_ABORT
+#define GET_DOUBLE_ARRAY_ELEMENTS env->GetPrimitiveArrayCritical
+#define RELEASE_DOUBLE_ARRAY_ELEMENTS env->ReleasePrimitiveArrayCritical
+
+#else
+//Likely makes copy of Java arrays to JNI C++ space
+#define GET_BYTE_ARRAY_ELEMENTS env->GetByteArrayElements
+#define RELEASE_BYTE_ARRAY_ELEMENTS env->ReleaseByteArrayElements
+#define JNI_RO_RELEASE_MODE JNI_ABORT
+#define GET_DOUBLE_ARRAY_ELEMENTS env->GetDoubleArrayElements
+#define RELEASE_DOUBLE_ARRAY_ELEMENTS env->ReleaseDoubleArrayElements
+
+#endif		//ifdef DIRECT_ACCESS_TO_JAVA_HEAP_MEMORY
+
+#endif  //ifndef JNI_COMMON_H
diff --git a/public/VectorPairHMM/src/main/c++/jnidebug.h b/public/VectorPairHMM/src/main/c++/jnidebug.h
new file mode 100644
index 000000000..7fcab2a51
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/jnidebug.h
@@ -0,0 +1,191 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#ifndef JNI_DEBUG_H
+#define JNI_DEBUG_H
+
+template<class NUMBER>
+class DataHolder
+{
+#define INIT_MATRIX(X)								\
+  X = new NUMBER*[m_paddedMaxReadLength];					\
+  for(int i=0;i<m_paddedMaxReadLength;++i)					\
+  {										\
+    X[i] = new NUMBER[m_paddedMaxHaplotypeLength];					\
+    for(int j=0;j<m_paddedMaxHaplotypeLength;++j)				\
+      X[i][j] = (NUMBER)0; 							\
+  }
+
+#define FREE_MATRIX(X)								\
+  for(int i=0;i<m_paddedMaxReadLength;++i)					\
+    delete X[i];								\
+  delete X;
+
+  public:
+    DataHolder() { m_is_initialized = false; }
+    void initialize(int readMaxLength, int haplotypeMaxLength)
+    {
+      if(m_is_initialized)
+      {
+	FREE_MATRIX(m_matchMatrix); 
+	FREE_MATRIX(m_insertionMatrix); 
+	FREE_MATRIX(m_deletionMatrix); 
+	FREE_MATRIX(m_prior);
+	delete m_transition;
+      }
+      
+      m_readMaxLength = readMaxLength;
+      m_haplotypeMaxLength = haplotypeMaxLength;
+      m_paddedMaxReadLength = readMaxLength + 1;
+      m_paddedMaxHaplotypeLength = haplotypeMaxLength + 1;
+           
+      INIT_MATRIX(m_matchMatrix); 
+      INIT_MATRIX(m_insertionMatrix); 
+      INIT_MATRIX(m_deletionMatrix); 
+      INIT_MATRIX(m_prior); 
+      m_transition = new NUMBER[m_paddedMaxReadLength][6];
+      for(int i=0;i<m_paddedMaxReadLength;++i)
+	for(int j=0;j<6;++j)
+	  m_transition[i][j] = (NUMBER)0;
+      m_is_initialized = true;
+    }
+
+    //Corresponds to initializeProbabilities
+    void initializeProbabilities(jint length, jbyte* insertionGOP, jbyte* deletionGOP, jbyte* overallGCP)
+    {
+      static unsigned g_num_prob_init = 0;
+      Context<NUMBER> ctx;
+      for (int r = 1; r <= length;r++)	//in original code, r < ROWS (where ROWS = paddedReadLength)
+      {
+	int _i = insertionGOP[r-1];	//insertionGOP
+	int _d = deletionGOP[r-1];	//deletionGOP
+	int _c = overallGCP[r-1];	//overallGCP
+	m_transition[r][MM] = ctx._(1.0) - ctx.ph2pr[(_i + _d) & 127];	//lines 161-162
+	m_transition[r][GapM] = ctx._(1.0) - ctx.ph2pr[_c];	//line 163
+	m_transition[r][MX] = ctx.ph2pr[_i];	//164
+	m_transition[r][XX] = ctx.ph2pr[_c];	//165
+	m_transition[r][MY] =  ctx.ph2pr[_d];//last row seems different, compared to line 166
+	m_transition[r][YY] = ctx.ph2pr[_c];//same as above for line 167
+	//m_transition[r][MY] = (r == length) ? ctx._(1.0) : ctx.ph2pr[_d];//last row seems different, compared to line 166
+	//m_transition[r][YY] = (r == length) ? ctx._(1.0) : ctx.ph2pr[_c];//same as above for line 167
+#ifdef DEBUG3
+	for(int j=0;j<6;++j)
+	  debug_dump("transitions_jni.txt", to_string(m_transition[r][j]),true);
+#endif
+      }
+      ++g_num_prob_init;
+    }
+    bool m_is_initialized;
+    int m_readMaxLength;
+    int m_haplotypeMaxLength;
+    int m_paddedMaxReadLength;
+    int m_paddedMaxHaplotypeLength;
+    NUMBER** m_matchMatrix;
+    NUMBER** m_insertionMatrix;
+    NUMBER** m_deletionMatrix;
+    NUMBER** m_prior; 
+    NUMBER (*m_transition)[6];
+};
+extern DataHolder<double> g_double_dataholder;
+
+template<class NUMBER>
+NUMBER compute_full_prob(testcase *tc, NUMBER** M, NUMBER** X, NUMBER** Y, NUMBER (*p)[6], 
+    bool do_initialization, jint hapStartIndex, NUMBER *before_last_log = NULL)
+{
+	int r, c;
+	int ROWS = tc->rslen + 1;	//ROWS = paddedReadLength
+	int COLS = tc->haplen + 1;	//COLS = paddedHaplotypeLength
+
+	Context<NUMBER> ctx;
+	//////NOTES
+	////ctx.ph2pr[quality]; 	//This quantity is QualityUtils.qualToErrorProb(quality)
+	////1-ctx.ph2pr[quality]; //This corresponds to QualityUtils.qualToProb(quality);
+
+	//Initialization
+	if(do_initialization)
+	{
+	  for (c = 0; c < COLS; c++)
+	  {
+	    M[0][c] = ctx._(0.0);
+	    X[0][c] = ctx._(0.0);
+	    Y[0][c] = ctx.INITIAL_CONSTANT / (tc->haplen);	//code from 87-90 in LoglessPairHMM
+	  }
+
+	  for (r = 1; r < ROWS; r++)
+	  {
+	    M[r][0] = ctx._(0.0);
+	    //deletionMatrix row 0 in above nest is initialized in the Java code
+	    //However, insertionMatrix column 0 is not initialized in Java code, could it be that
+	    //values are re-used from a previous iteration?
+	    //Why even do this, X[0][0] = 0 from above loop nest, X[idx][0] = 0 from this computation
+	    X[r][0] = X[r-1][0] * p[r][XX];
+	    Y[r][0] = ctx._(0.0);
+	  }
+	}
+
+	for (r = 1; r < ROWS; r++)
+		for (c = hapStartIndex+1; c < COLS; c++)
+		{
+		  	//The following lines correspond to initializePriors()
+			char _rs = tc->rs[r-1];		//line 137
+			char _hap = tc->hap[c-1];	//line 140
+			//int _q = tc->q[r-1] & 127;	//line 138 - q is the quality (qual), should be byte hence int ANDed with 0xFF
+			int _q = tc->q[r-1];	//line 138 - q is the quality (qual), should be byte hence int ANDed with 0xFF
+			NUMBER distm = ctx.ph2pr[_q]; 	//This quantity is QualityUtils.qualToErrorProb(_q)
+			//The assumption here is that doNotUseTristateCorrection is true	
+			//TOASK
+			if (_rs == _hap || _rs == 'N' || _hap == 'N')
+				distm = ctx._(1.0) - distm; //This is the quantity QualityUtils.qualToProb(qual)
+			else
+			  distm = distm/3;
+#ifdef DEBUG3
+			debug_dump("priors_jni.txt",to_string(distm),true);
+#endif
+
+			//Computation inside updateCell
+			M[r][c] = distm * (M[r-1][c-1] * p[r][MM] + X[r-1][c-1] * p[r][GapM] + Y[r-1][c-1] * p[r][GapM]);
+			X[r][c] = M[r-1][c] * p[r][MX] + X[r-1][c] * p[r][XX];
+			Y[r][c] = M[r][c-1] * p[r][MY] + Y[r][c-1] * p[r][YY];
+#ifdef DEBUG3
+			debug_dump("matrices_jni.txt",to_string(M[r][c]),true);
+			debug_dump("matrices_jni.txt",to_string(X[r][c]),true);
+			debug_dump("matrices_jni.txt",to_string(Y[r][c]),true);
+#endif
+		}
+
+	NUMBER result = ctx._(0.0);
+	for (c = 0; c < COLS; c++)
+		result += M[ROWS-1][c] + X[ROWS-1][c];
+
+	if (before_last_log != NULL)
+		*before_last_log = result;	
+
+#ifdef DEBUG
+	debug_dump("return_values_jni.txt",to_string(ctx.LOG10(result) - ctx.LOG10_INITIAL_CONSTANT),true);
+#endif
+	return ctx.LOG10(result) - ctx.LOG10_INITIAL_CONSTANT;
+}
+
+#endif
diff --git a/public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM.cc b/public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM.cc
new file mode 100644
index 000000000..8a3f8b5bc
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM.cc
@@ -0,0 +1,176 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#include "headers.h"
+#include "jni_common.h"
+#include "org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM.h"
+#include "template.h"
+#include "utils.h"
+#include "LoadTimeInitializer.h"
+#include "jnidebug.h"
+DataHolder<double> g_double_dataholder;
+
+using namespace std;
+
+JNIEXPORT void JNICALL Java_org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_jniInitialize
+(JNIEnv* env, jobject thisObject,
+ jint readMaxLength, jint haplotypeMaxLength)
+{
+  static int g_num_init_calls = 0;
+#ifdef DEBUG3
+  cout << "Entered alloc initialized .. readMaxLength "<<readMaxLength<<" haplotypeMaxLength "<<haplotypeMaxLength<<"\n";
+#endif
+  g_double_dataholder.initialize(readMaxLength, haplotypeMaxLength);
+#ifdef DEBUG3
+  debug_dump("lengths_jni.txt", to_string(readMaxLength)+" "+to_string(haplotypeMaxLength),true);
+#endif
+  ++g_num_init_calls;
+}
+
+JNIEXPORT void JNICALL Java_org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_jniInitializeProbabilities
+(JNIEnv* env, jclass thisObject,
+ jobjectArray transition, jbyteArray insertionGOP, jbyteArray deletionGOP, jbyteArray overallGCP
+ )
+{
+  jboolean is_copy = JNI_FALSE;
+  jsize length = (env)->GetArrayLength(insertionGOP);
+#ifdef DEBUG3
+  cout << "Entered initializeProbabilities .. length "<<length<<"\n";
+#endif
+  jbyte* insertionGOPArray = (env)->GetByteArrayElements(insertionGOP, &is_copy);
+  jbyte* deletionGOPArray = (env)->GetByteArrayElements(deletionGOP, &is_copy);
+  jbyte* overallGCPArray = (env)->GetByteArrayElements(overallGCP, &is_copy);
+#ifdef DEBUG
+  if(insertionGOPArray == 0)
+    cerr << "insertionGOP array not initialized in JNI\n";
+  ////assert(insertionGOPArray && "insertionGOP array not initialized in JNI");
+  if(deletionGOPArray == 0)
+    cerr << "deletionGOP array not initialized in JNI\n";
+  ////assert(deletionGOPArray && "deletionGOP array not initialized in JNI");
+  assert(overallGCPArray && "OverallGCP array not initialized in JNI");
+#endif
+
+  g_double_dataholder.initializeProbabilities(length, insertionGOPArray, deletionGOPArray, overallGCPArray);
+
+  env->ReleaseByteArrayElements(overallGCP, overallGCPArray, JNI_ABORT);
+  env->ReleaseByteArrayElements(deletionGOP, deletionGOPArray, JNI_ABORT);
+  env->ReleaseByteArrayElements(insertionGOP, insertionGOPArray, JNI_ABORT);
+}
+
+JNIEXPORT jdouble JNICALL 
+Java_org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_jniInitializePriorsAndUpdateCells( 
+    JNIEnv* env, jobject thisObject,
+    jboolean doInitialization, jint paddedReadLength, jint paddedHaplotypeLength,
+    jbyteArray readBases, jbyteArray haplotypeBases, jbyteArray readQuals,
+    jint hapStartIndex
+    )
+{
+#ifdef DEBUG3
+  cout << "Entered mainCompute .. doInitialization "<<(doInitialization == JNI_TRUE)<<" hapStartIndex "<<hapStartIndex<<"\n";
+  cout << "mainCompute padded lengths "<< paddedReadLength << " " << paddedHaplotypeLength <<"\n";
+#endif
+  jboolean is_copy = JNI_FALSE;
+  jbyte* readBasesArray = (env)->GetByteArrayElements(readBases, &is_copy);
+  jbyte* haplotypeBasesArray = (env)->GetByteArrayElements(haplotypeBases, &is_copy);
+  jbyte* readQualsArray = (env)->GetByteArrayElements(readQuals, &is_copy);
+#ifdef DEBUG
+  assert(readBasesArray && "readBasesArray not initialized in JNI"); 
+  assert(haplotypeBasesArray && "haplotypeBasesArray not initialized in JNI"); 
+  assert(readQualsArray && "readQualsArray not initialized in JNI"); 
+#endif
+  testcase tc;
+
+  tc.rslen = paddedReadLength-1;
+  tc.haplen = paddedHaplotypeLength-1;
+
+  tc.rs = (char*)readBasesArray;
+  tc.hap = (char*)haplotypeBasesArray;
+  tc.q = (char*)readQualsArray; //TOASK - q is now char*
+
+  compute_full_prob<double>(&tc, g_double_dataholder.m_matchMatrix, g_double_dataholder.m_insertionMatrix,
+      g_double_dataholder.m_deletionMatrix, g_double_dataholder.m_transition, 
+    doInitialization == JNI_TRUE, hapStartIndex, NULL);
+
+  env->ReleaseByteArrayElements(readBases, readBasesArray, JNI_ABORT);
+  env->ReleaseByteArrayElements(haplotypeBases, haplotypeBasesArray, JNI_ABORT);
+  env->ReleaseByteArrayElements(readQuals, readQualsArray, JNI_ABORT);
+  return 0.0;
+}
+
+JNIEXPORT jdouble JNICALL 
+Java_org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_jniSubComputeReadLikelihoodGivenHaplotypeLog10( 
+    JNIEnv* env, jobject thisObject,
+    jint readLength, jint haplotypeLength,
+    jbyteArray readBases, jbyteArray haplotypeBases, jbyteArray readQuals,
+    jbyteArray insertionGOP, jbyteArray deletionGOP, jbyteArray overallGCP,
+    jint hapStartIndex
+    )
+{
+  jboolean is_copy = JNI_FALSE;
+  jbyte* readBasesArray =   (jbyte*)GET_BYTE_ARRAY_ELEMENTS(readBases, &is_copy);
+  jbyte* haplotypeBasesArray = (jbyte*)GET_BYTE_ARRAY_ELEMENTS(haplotypeBases, &is_copy);
+  jbyte* readQualsArray = (jbyte*)GET_BYTE_ARRAY_ELEMENTS(readQuals, &is_copy);
+  jbyte* insertionGOPArray = (jbyte*)GET_BYTE_ARRAY_ELEMENTS(insertionGOP, &is_copy);
+  jbyte* deletionGOPArray = (jbyte*)GET_BYTE_ARRAY_ELEMENTS(deletionGOP, &is_copy);
+  jbyte* overallGCPArray = (jbyte*)GET_BYTE_ARRAY_ELEMENTS(overallGCP, &is_copy);
+#ifdef DEBUG
+  assert(readBasesArray && "readBasesArray not initialized in JNI"); 
+  assert(haplotypeBasesArray && "haplotypeBasesArray not initialized in JNI"); 
+  assert(readQualsArray && "readQualsArray not initialized in JNI"); 
+  assert(insertionGOPArray && "insertionGOP array not initialized in JNI");
+  assert(deletionGOPArray && "deletionGOP array not initialized in JNI");
+  assert(overallGCPArray && "OverallGCP array not initialized in JNI");
+  //assert(readLength < MROWS);
+#endif
+  testcase tc;
+  tc.rslen = readLength;
+  tc.haplen = haplotypeLength;
+  tc.rs = (char*)readBasesArray;
+  tc.hap = (char*)haplotypeBasesArray;
+  for(unsigned i=0;i<readLength;++i)
+  {
+    tc.q[i] = (int)readQualsArray[i];
+    tc.i[i] = (int)insertionGOPArray[i];
+    tc.d[i] = (int)deletionGOPArray[i];
+    tc.c[i] = (int)overallGCPArray[i];
+  }
+
+  double result_avxd = g_compute_full_prob_double(&tc, 0);
+  double result = log10(result_avxd) - log10(ldexp(1.0, 1020));
+#ifdef DEBUG
+  g_load_time_initializer.debug_dump("return_values_jni.txt",to_string(result),true);
+#endif
+
+
+  RELEASE_BYTE_ARRAY_ELEMENTS(overallGCP, overallGCPArray, JNI_RO_RELEASE_MODE);
+  RELEASE_BYTE_ARRAY_ELEMENTS(deletionGOP, deletionGOPArray, JNI_RO_RELEASE_MODE);
+  RELEASE_BYTE_ARRAY_ELEMENTS(insertionGOP, insertionGOPArray, JNI_RO_RELEASE_MODE);
+  RELEASE_BYTE_ARRAY_ELEMENTS(readQuals, readQualsArray, JNI_RO_RELEASE_MODE);
+  RELEASE_BYTE_ARRAY_ELEMENTS(haplotypeBases, haplotypeBasesArray, JNI_RO_RELEASE_MODE);
+  RELEASE_BYTE_ARRAY_ELEMENTS(readBases, readBasesArray, JNI_RO_RELEASE_MODE);
+
+  return 0.0;
+}
+
diff --git a/public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM.h b/public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM.h
new file mode 100644
index 000000000..18c2b0394
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM.h
@@ -0,0 +1,96 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+/* DO NOT EDIT THIS FILE - it is machine generated */
+#include <jni.h>
+/* Header for class org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM */
+
+#ifndef _Included_org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM
+#define _Included_org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM
+#ifdef __cplusplus
+extern "C" {
+#endif
+#undef org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_TRISTATE_CORRECTION
+#define org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_TRISTATE_CORRECTION 3.0
+#undef org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_matchToMatch
+#define org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_matchToMatch 0L
+#undef org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_indelToMatch
+#define org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_indelToMatch 1L
+#undef org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_matchToInsertion
+#define org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_matchToInsertion 2L
+#undef org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_insertionToInsertion
+#define org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_insertionToInsertion 3L
+#undef org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_matchToDeletion
+#define org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_matchToDeletion 4L
+#undef org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_deletionToDeletion
+#define org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_deletionToDeletion 5L
+#undef org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_debug
+#define org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_debug 0L
+#undef org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_verify
+#define org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_verify 0L
+#undef org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_debug0_1
+#define org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_debug0_1 0L
+#undef org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_debug1
+#define org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_debug1 0L
+#undef org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_debug2
+#define org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_debug2 0L
+#undef org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_debug3
+#define org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_debug3 0L
+/*
+ * Class:     org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM
+ * Method:    jniInitialize
+ * Signature: (II)V
+ */
+JNIEXPORT void JNICALL Java_org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_jniInitialize
+  (JNIEnv *, jobject, jint, jint);
+
+/*
+ * Class:     org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM
+ * Method:    jniInitializeProbabilities
+ * Signature: ([[D[B[B[B)V
+ */
+JNIEXPORT void JNICALL Java_org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_jniInitializeProbabilities
+  (JNIEnv *, jclass, jobjectArray, jbyteArray, jbyteArray, jbyteArray);
+
+/*
+ * Class:     org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM
+ * Method:    jniInitializePriorsAndUpdateCells
+ * Signature: (ZII[B[B[BI)D
+ */
+JNIEXPORT jdouble JNICALL Java_org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_jniInitializePriorsAndUpdateCells
+  (JNIEnv *, jobject, jboolean, jint, jint, jbyteArray, jbyteArray, jbyteArray, jint);
+
+/*
+ * Class:     org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM
+ * Method:    jniSubComputeReadLikelihoodGivenHaplotypeLog10
+ * Signature: (II[B[B[B[B[B[BI)D
+ */
+JNIEXPORT jdouble JNICALL Java_org_broadinstitute_sting_utils_pairhmm_DebugJNILoglessPairHMM_jniSubComputeReadLikelihoodGivenHaplotypeLog10
+  (JNIEnv *, jobject, jint, jint, jbyteArray, jbyteArray, jbyteArray, jbyteArray, jbyteArray, jbyteArray, jint);
+
+#ifdef __cplusplus
+}
+#endif
+#endif
diff --git a/public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM.cc b/public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM.cc
new file mode 100644
index 000000000..0b54c8a81
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM.cc
@@ -0,0 +1,382 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#include "headers.h"
+#include "jni_common.h"
+#include "org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM.h"
+#include "template.h"
+#include "utils.h"
+#include "LoadTimeInitializer.h"
+
+using namespace std;
+
+JNIEXPORT jlong JNICALL Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniGetMachineType
+  (JNIEnv* env, jobject thisObject)
+{
+  return (jlong)get_machine_capabilities(); 
+}
+
+//Should be called only once for the whole Java process - initializes field ids for the classes JNIReadDataHolderClass
+//and JNIHaplotypeDataHolderClass
+JNIEXPORT void JNICALL Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniInitializeClassFieldsAndMachineMask
+  (JNIEnv* env, jobject thisObject, jclass readDataHolderClass, jclass haplotypeDataHolderClass, jlong mask)
+{
+  assert(readDataHolderClass);
+  assert(haplotypeDataHolderClass);
+  jfieldID fid;
+  fid = env->GetFieldID(readDataHolderClass, "readBases", "[B");
+  assert(fid && "JNI pairHMM: Could not get FID for readBases");
+  g_load_time_initializer.m_readBasesFID = fid;
+  fid = env->GetFieldID(readDataHolderClass, "readQuals", "[B");
+  assert(fid && "JNI pairHMM: Could not get FID for readQuals");
+  g_load_time_initializer.m_readQualsFID = fid;
+  fid = env->GetFieldID(readDataHolderClass, "insertionGOP", "[B");
+  assert(fid && "JNI pairHMM: Could not get FID for insertionGOP");
+  g_load_time_initializer.m_insertionGOPFID = fid;
+  fid = env->GetFieldID(readDataHolderClass, "deletionGOP", "[B");
+  assert(fid && "JNI pairHMM: Could not get FID for deletionGOP");
+  g_load_time_initializer.m_deletionGOPFID = fid;
+  fid = env->GetFieldID(readDataHolderClass, "overallGCP", "[B");
+  assert(fid && "JNI pairHMM: Could not get FID for overallGCP");
+  g_load_time_initializer.m_overallGCPFID = fid;
+
+  fid = env->GetFieldID(haplotypeDataHolderClass, "haplotypeBases", "[B");
+  assert(fid && "JNI pairHMM: Could not get FID for haplotypeBases");
+  g_load_time_initializer.m_haplotypeBasesFID = fid;
+  if(mask != ENABLE_ALL_HARDWARE_FEATURES)
+  {
+    cout << "Using user supplied hardware mask to re-initialize function pointers for PairHMM\n";
+    initialize_function_pointers((uint64_t)mask);
+    cout.flush();
+  }
+}
+
+//Since the list of haplotypes against which the reads are evaluated in PairHMM is the same for a region,
+//transfer the list only once
+vector<pair<jbyteArray, jbyte*> > g_haplotypeBasesArrayVector;
+vector<unsigned> g_haplotypeBasesLengths;
+JNIEXPORT void JNICALL Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniInitializeHaplotypes
+  (JNIEnv * env, jobject thisObject, jint numHaplotypes, jobjectArray haplotypeDataArray)
+{
+  jboolean is_copy = JNI_FALSE;
+  //To ensure, GET_BYTE_ARRAY_ELEMENTS is invoked only once for each haplotype, store bytearrays in a vector
+  vector<pair<jbyteArray, jbyte*> >& haplotypeBasesArrayVector = g_haplotypeBasesArrayVector;
+  haplotypeBasesArrayVector.clear();
+  g_haplotypeBasesLengths.clear();
+  haplotypeBasesArrayVector.resize(numHaplotypes);
+  g_haplotypeBasesLengths.resize(numHaplotypes);
+  jsize haplotypeBasesLength = 0;
+  for(unsigned j=0;j<numHaplotypes;++j)
+  {
+    jobject haplotypeObject = env->GetObjectArrayElement(haplotypeDataArray, j);
+    jbyteArray haplotypeBases = (jbyteArray)env->GetObjectField(haplotypeObject, g_load_time_initializer.m_haplotypeBasesFID);
+#ifdef ENABLE_ASSERTIONS
+    assert(haplotypeBases && ("haplotypeBases is NULL at index : "+to_string(j)+"\n").c_str());
+#endif
+    //Need a global reference as this will be accessed across multiple JNI calls to JNIComputeLikelihoods()
+    jbyteArray haplotypeBasesGlobalRef = (jbyteArray)env->NewGlobalRef(haplotypeBases);
+#ifdef ENABLE_ASSERTIONS
+    assert(haplotypeBasesGlobalRef && ("Could not get global ref to haplotypeBases at index : "+to_string(j)+"\n").c_str());
+#endif
+    env->DeleteLocalRef(haplotypeBases);	//free the local reference
+    jbyte* haplotypeBasesArray = (jbyte*)GET_BYTE_ARRAY_ELEMENTS(haplotypeBasesGlobalRef, &is_copy);
+    haplotypeBasesLength = env->GetArrayLength(haplotypeBasesGlobalRef);
+#ifdef ENABLE_ASSERTIONS
+    assert(haplotypeBasesArray && "haplotypeBasesArray not initialized in JNI"); 
+    //assert(haplotypeBasesLength < MCOLS);
+#endif
+#ifdef DEBUG0_1
+    cout << "JNI haplotype length "<<haplotypeBasesLength<<"\n";
+#endif
+    haplotypeBasesArrayVector[j] = make_pair(haplotypeBasesGlobalRef, haplotypeBasesArray);
+    g_haplotypeBasesLengths[j] = haplotypeBasesLength;
+#ifdef DEBUG3
+    for(unsigned k=0;k<haplotypeBasesLength;++k)
+      g_load_time_initializer.debug_dump("haplotype_bases_jni.txt",to_string((int)haplotypeBasesArray[k]),true);
+#endif
+#ifdef DO_PROFILING
+    g_load_time_initializer.update_stat(HAPLOTYPE_LENGTH_IDX, haplotypeBasesLength);
+    g_load_time_initializer.m_bytes_copied += (is_copy ? haplotypeBasesLength : 0);
+#endif
+  }
+}
+
+//Create a vector of testcases for computation - copy the references to bytearrays read/readQuals etc into the appropriate
+//testcase struct
+inline JNIEXPORT void JNICALL Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniInitializeTestcasesVector
+  (JNIEnv* env, jint numReads, jint numHaplotypes, jobjectArray& readDataArray,
+   vector<vector<pair<jbyteArray,jbyte*> > >& readBasesArrayVector, vector<testcase>& tc_array)
+{
+  jboolean is_copy = JNI_FALSE;
+  //haplotype vector from earlier store - note the reference to vector, not copying
+  vector<pair<jbyteArray, jbyte*> >& haplotypeBasesArrayVector = g_haplotypeBasesArrayVector;
+  unsigned tc_idx = 0;
+  for(unsigned i=0;i<numReads;++i)
+  {
+    //Get bytearray fields from read
+    jobject readObject = env->GetObjectArrayElement(readDataArray, i);
+    jbyteArray readBases = (jbyteArray)env->GetObjectField(readObject, g_load_time_initializer.m_readBasesFID);
+    jbyteArray insertionGOP = (jbyteArray)env->GetObjectField(readObject, g_load_time_initializer.m_insertionGOPFID);
+    jbyteArray deletionGOP = (jbyteArray)env->GetObjectField(readObject, g_load_time_initializer.m_deletionGOPFID);
+    jbyteArray overallGCP = (jbyteArray)env->GetObjectField(readObject, g_load_time_initializer.m_overallGCPFID);
+    jbyteArray readQuals = (jbyteArray)env->GetObjectField(readObject, g_load_time_initializer.m_readQualsFID);
+
+#ifdef ENABLE_ASSERTIONS
+    assert(readBases && ("readBases is NULL at index : "+to_string(i)+"\n").c_str());
+    assert(insertionGOP && ("insertionGOP is NULL at index : "+to_string(i)+"\n").c_str());
+    assert(deletionGOP && ("deletionGOP is NULL at index : "+to_string(i)+"\n").c_str());
+    assert(overallGCP && ("overallGCP is NULL at index : "+to_string(i)+"\n").c_str());
+    assert(readQuals && ("readQuals is NULL at index : "+to_string(i)+"\n").c_str());
+#endif
+    jsize readLength = env->GetArrayLength(readBases);
+
+    jbyte* readBasesArray = (jbyte*)GET_BYTE_ARRAY_ELEMENTS(readBases, &is_copy);	//order of GET-RELEASE is important
+    jbyte* readQualsArray = (jbyte*)GET_BYTE_ARRAY_ELEMENTS(readQuals, &is_copy);
+    jbyte* insertionGOPArray = (jbyte*)GET_BYTE_ARRAY_ELEMENTS(insertionGOP, &is_copy);
+    jbyte* deletionGOPArray = (jbyte*)GET_BYTE_ARRAY_ELEMENTS(deletionGOP, &is_copy);
+    jbyte* overallGCPArray = (jbyte*)GET_BYTE_ARRAY_ELEMENTS(overallGCP, &is_copy);
+#ifdef DO_PROFILING
+    g_load_time_initializer.m_bytes_copied += (is_copy ? readLength*5 : 0);
+    g_load_time_initializer.update_stat(READ_LENGTH_IDX, readLength);
+#endif
+#ifdef ENABLE_ASSERTIONS
+    assert(readBasesArray && "readBasesArray not initialized in JNI"); 
+    assert(readQualsArray && "readQualsArray not initialized in JNI"); 
+    assert(insertionGOPArray && "insertionGOP array not initialized in JNI");
+    assert(deletionGOPArray && "deletionGOP array not initialized in JNI");
+    assert(overallGCPArray && "overallGCP array not initialized in JNI");
+    //assert(readLength < MROWS); 
+    assert(readLength == env->GetArrayLength(readQuals));
+    assert(readLength == env->GetArrayLength(insertionGOP));
+    assert(readLength == env->GetArrayLength(deletionGOP));
+    assert(readLength == env->GetArrayLength(overallGCP));
+#endif
+#ifdef DEBUG0_1
+    cout << "JNI read length "<<readLength<<"\n";
+#endif
+#ifdef DEBUG3
+    for(unsigned j=0;j<readLength;++j)
+    {
+      g_load_time_initializer.debug_dump("reads_jni.txt",to_string((int)readBasesArray[j]),true);
+      g_load_time_initializer.debug_dump("reads_jni.txt",to_string((int)readQualsArray[j]),true);
+      g_load_time_initializer.debug_dump("reads_jni.txt",to_string((int)insertionGOPArray[j]),true);
+      g_load_time_initializer.debug_dump("reads_jni.txt",to_string((int)deletionGOPArray[j]),true);
+      g_load_time_initializer.debug_dump("reads_jni.txt",to_string((int)overallGCPArray[j]),true);
+    }
+#endif
+    for(unsigned j=0;j<numHaplotypes;++j)
+    {
+      jsize haplotypeLength = (jsize)g_haplotypeBasesLengths[j];
+      jbyte* haplotypeBasesArray = haplotypeBasesArrayVector[j].second;
+      tc_array[tc_idx].rslen = (int)readLength;
+      tc_array[tc_idx].haplen = (int)haplotypeLength;
+      tc_array[tc_idx].hap = (char*)haplotypeBasesArray;
+      tc_array[tc_idx].rs = (char*)readBasesArray;
+      tc_array[tc_idx].q = (char*)readQualsArray;
+      tc_array[tc_idx].i = (char*)insertionGOPArray;
+      tc_array[tc_idx].d = (char*)deletionGOPArray;
+      tc_array[tc_idx].c = (char*)overallGCPArray;
+#ifdef DO_PROFILING
+      g_load_time_initializer.update_stat(PRODUCT_READ_LENGTH_HAPLOTYPE_LENGTH_IDX, ((uint64_t)readLength)*((uint64_t)haplotypeLength));
+#endif
+#ifdef DUMP_TO_SANDBOX
+      g_load_time_initializer.dump_sandbox(tc_array[tc_idx], tc_idx, numReads, numHaplotypes);
+#endif
+      ++tc_idx;  
+    }
+    //Store the read array references and release them at the end because they are used by compute_full_prob
+    //Maintain order in which GET_BYTE_ARRAY_ELEMENTS called
+    readBasesArrayVector[i].clear();
+    readBasesArrayVector[i].resize(5);
+    readBasesArrayVector[i][0] = make_pair(readBases, readBasesArray);
+    readBasesArrayVector[i][1] = make_pair(readQuals, readQualsArray);
+    readBasesArrayVector[i][2] = make_pair(insertionGOP, insertionGOPArray);
+    readBasesArrayVector[i][3] = make_pair(deletionGOP, deletionGOPArray);
+    readBasesArrayVector[i][4] = make_pair(overallGCP, overallGCPArray);
+  }
+}
+
+//Do compute over vector of testcase structs
+inline void compute_testcases(vector<testcase>& tc_array, unsigned numTestCases, double* likelihoodDoubleArray,
+    unsigned maxNumThreadsToUse)
+{
+#ifdef DO_REPEAT_PROFILING
+  for(unsigned i=0;i<10;++i)
+#endif
+  {
+#pragma omp parallel for schedule (dynamic,10000) num_threads(maxNumThreadsToUse)
+    for(unsigned tc_idx=0;tc_idx<numTestCases;++tc_idx)
+    {
+      float result_avxf = g_compute_full_prob_float(&(tc_array[tc_idx]), 0);
+      double result = 0;
+      if (result_avxf < MIN_ACCEPTED) {
+        double result_avxd = g_compute_full_prob_double(&(tc_array[tc_idx]), 0);
+        result = log10(result_avxd) - log10(ldexp(1.0, 1020.0));
+#ifdef DO_PROFILING
+        g_load_time_initializer.update_stat(NUM_DOUBLE_INVOCATIONS_IDX, 1);
+#endif
+      }
+      else
+        result = (double)(log10f(result_avxf) - log10f(ldexpf(1.f, 120.f)));
+      likelihoodDoubleArray[tc_idx] = result;
+    }
+  }
+}
+
+//Inform the Java VM that we no longer need access to the read arrays (and free memory)
+inline JNIEXPORT void JNICALL Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniReleaseReadArrays
+  (JNIEnv* env, vector<vector<pair<jbyteArray,jbyte*> > >& readBasesArrayVector)
+{
+  //Release read arrays first
+  for(int i=readBasesArrayVector.size()-1;i>=0;--i)//note the order - reverse of GET
+  {
+    for(int j=readBasesArrayVector[i].size()-1;j>=0;--j)
+      RELEASE_BYTE_ARRAY_ELEMENTS(readBasesArrayVector[i][j].first, readBasesArrayVector[i][j].second, JNI_RO_RELEASE_MODE);
+    readBasesArrayVector[i].clear();
+  }
+  readBasesArrayVector.clear();
+}
+
+
+#ifdef DO_WARMUP
+uint64_t g_sum = 0;
+#endif
+//JNI function to invoke compute_full_prob_avx
+//readDataArray - array of JNIReadDataHolderClass objects which contain the readBases, readQuals etc
+//haplotypeDataArray - array of JNIHaplotypeDataHolderClass objects which contain the haplotypeBases
+//likelihoodArray - array of doubles to return results back to Java. Memory allocated by Java prior to JNI call
+//maxNumThreadsToUse - Max number of threads that OpenMP can use for the HMM computation
+JNIEXPORT void JNICALL Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniComputeLikelihoods
+  (JNIEnv* env, jobject thisObject, jint numReads, jint numHaplotypes, 
+   jobjectArray readDataArray, jobjectArray haplotypeDataArray, jdoubleArray likelihoodArray, jint maxNumThreadsToUse)
+{
+#ifdef DEBUG0_1
+  cout << "JNI numReads "<<numReads<<" numHaplotypes "<<numHaplotypes<<"\n";
+#endif
+  jboolean is_copy = JNI_FALSE;
+  struct timespec start_time;
+  unsigned numTestCases = numReads*numHaplotypes;
+  //vector to store testcases
+  vector<testcase> tc_array;
+  tc_array.clear();
+  tc_array.resize(numTestCases);
+  //Store read arrays for release later
+  vector<vector<pair<jbyteArray,jbyte*> > > readBasesArrayVector;
+  readBasesArrayVector.clear();
+  readBasesArrayVector.resize(numReads);
+#ifdef DUMP_TO_SANDBOX
+  g_load_time_initializer.open_sandbox();
+#endif
+#ifdef DO_PROFILING
+  get_time(&start_time);
+#endif
+  //Copy byte array references from Java memory into vector of testcase structs
+  Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniInitializeTestcasesVector(env,
+      numReads, numHaplotypes, readDataArray, readBasesArrayVector, tc_array);
+#ifdef DO_PROFILING
+  g_load_time_initializer.m_data_transfer_time += diff_time(start_time);
+#endif
+
+  //Get double array where results are stored (to pass back to java)
+  jdouble* likelihoodDoubleArray = (jdouble*)GET_DOUBLE_ARRAY_ELEMENTS(likelihoodArray, &is_copy);
+#ifdef ENABLE_ASSERTIONS
+  assert(likelihoodDoubleArray && "likelihoodArray is NULL");
+  assert(env->GetArrayLength(likelihoodArray) == numTestCases);
+#endif
+#ifdef DO_WARMUP        //ignore - only for crazy profiling
+  vector<pair<jbyteArray, jbyte*> >& haplotypeBasesArrayVector = g_haplotypeBasesArrayVector;
+  for(unsigned i=0;i<haplotypeBasesArrayVector.size();++i)
+  {
+    unsigned curr_size = env->GetArrayLength(haplotypeBasesArrayVector[i].first);
+    for(unsigned j=0;j<curr_size;++j)
+      g_sum += ((uint64_t)((haplotypeBasesArrayVector[i].second)[j]));
+  }
+  for(unsigned i=0;i<readBasesArrayVector.size();++i)
+  {
+    for(unsigned j=0;j<readBasesArrayVector[i].size();++j)
+    {
+      unsigned curr_size = env->GetArrayLength(readBasesArrayVector[i][j].first);
+      for(unsigned k=0;k<curr_size;++k)
+        g_sum += ((uint64_t)((readBasesArrayVector[i][j].second)[k]));
+    }
+  }
+#endif
+#ifdef DO_PROFILING
+  g_load_time_initializer.m_bytes_copied += (is_copy ? numTestCases*sizeof(double) : 0);
+  get_time(&start_time);
+#endif
+  compute_testcases(tc_array, numTestCases, likelihoodDoubleArray, maxNumThreadsToUse); //actual computation
+#ifdef DO_PROFILING
+  g_load_time_initializer.m_compute_time += diff_time(start_time);
+#endif
+#ifdef DEBUG
+  for(unsigned tc_idx=0;tc_idx<numTestCases;++tc_idx)
+    g_load_time_initializer.debug_dump("return_values_jni.txt",to_string(likelihoodDoubleArray[tc_idx]),true);
+#endif
+#ifdef DO_PROFILING
+  get_time(&start_time);
+#endif
+  RELEASE_DOUBLE_ARRAY_ELEMENTS(likelihoodArray, likelihoodDoubleArray, 0); //release mode 0, copy back results to Java memory (if copy made)
+  Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniReleaseReadArrays(env, readBasesArrayVector);
+#ifdef DO_PROFILING
+  g_load_time_initializer.m_data_transfer_time += diff_time(start_time);
+  g_load_time_initializer.update_stat(NUM_REGIONS_IDX, 1);
+  g_load_time_initializer.update_stat(NUM_READS_IDX, numReads);
+  g_load_time_initializer.update_stat(NUM_HAPLOTYPES_IDX, numHaplotypes);
+  g_load_time_initializer.update_stat(NUM_TESTCASES_IDX, numTestCases);
+#endif
+  tc_array.clear();
+#ifdef DUMP_TO_SANDBOX
+  g_load_time_initializer.close_sandbox();
+#endif
+}
+
+//Release haplotypes at the end of a region
+JNIEXPORT void JNICALL Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniFinalizeRegion
+  (JNIEnv * env, jobject thisObject)
+{
+  vector<pair<jbyteArray, jbyte*> >& haplotypeBasesArrayVector = g_haplotypeBasesArrayVector;
+  //Now release haplotype arrays
+  for(int j=haplotypeBasesArrayVector.size()-1;j>=0;--j)	//note the order - reverse of GET
+  {
+    RELEASE_BYTE_ARRAY_ELEMENTS(haplotypeBasesArrayVector[j].first, haplotypeBasesArrayVector[j].second, JNI_RO_RELEASE_MODE);
+    env->DeleteGlobalRef(haplotypeBasesArrayVector[j].first);	//free the global reference
+  }
+  haplotypeBasesArrayVector.clear();
+  g_haplotypeBasesLengths.clear(); 
+}
+
+
+JNIEXPORT void JNICALL Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniClose
+  (JNIEnv* env, jobject thisObject)
+{
+#ifdef DO_PROFILING
+  g_load_time_initializer.print_profiling();
+#endif
+#ifdef DEBUG
+  g_load_time_initializer.debug_close();
+#endif
+}
+
diff --git a/public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM.h b/public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM.h
new file mode 100644
index 000000000..d820b4b26
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM.h
@@ -0,0 +1,104 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+/* DO NOT EDIT THIS FILE - it is machine generated */
+#include <jni.h>
+/* Header for class org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM */
+
+#ifndef _Included_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM
+#define _Included_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM
+#ifdef __cplusplus
+extern "C" {
+#endif
+#undef org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_TRISTATE_CORRECTION
+#define org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_TRISTATE_CORRECTION 3.0
+#undef org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_matchToMatch
+#define org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_matchToMatch 0L
+#undef org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_indelToMatch
+#define org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_indelToMatch 1L
+#undef org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_matchToInsertion
+#define org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_matchToInsertion 2L
+#undef org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_insertionToInsertion
+#define org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_insertionToInsertion 3L
+#undef org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_matchToDeletion
+#define org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_matchToDeletion 4L
+#undef org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_deletionToDeletion
+#define org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_deletionToDeletion 5L
+#undef org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_sse42Mask
+#define org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_sse42Mask 1LL
+#undef org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_avxMask
+#define org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_avxMask 2LL
+/*
+ * Class:     org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM
+ * Method:    jniGetMachineType
+ * Signature: ()J
+ */
+JNIEXPORT jlong JNICALL Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniGetMachineType
+  (JNIEnv *, jobject);
+
+/*
+ * Class:     org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM
+ * Method:    jniClose
+ * Signature: ()V
+ */
+JNIEXPORT void JNICALL Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniClose
+  (JNIEnv *, jobject);
+
+/*
+ * Class:     org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM
+ * Method:    jniInitializeClassFieldsAndMachineMask
+ * Signature: (Ljava/lang/Class;Ljava/lang/Class;J)V
+ */
+JNIEXPORT void JNICALL Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniInitializeClassFieldsAndMachineMask
+  (JNIEnv *, jobject, jclass, jclass, jlong);
+
+/*
+ * Class:     org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM
+ * Method:    jniInitializeHaplotypes
+ * Signature: (I[Lorg/broadinstitute/sting/utils/pairhmm/VectorLoglessPairHMM/JNIHaplotypeDataHolderClass;)V
+ */
+JNIEXPORT void JNICALL Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniInitializeHaplotypes
+  (JNIEnv *, jobject, jint, jobjectArray);
+
+/*
+ * Class:     org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM
+ * Method:    jniFinalizeRegion
+ * Signature: ()V
+ */
+JNIEXPORT void JNICALL Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniFinalizeRegion
+  (JNIEnv *, jobject);
+
+/*
+ * Class:     org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM
+ * Method:    jniComputeLikelihoods
+ * Signature: (II[Lorg/broadinstitute/sting/utils/pairhmm/VectorLoglessPairHMM/JNIReadDataHolderClass;[Lorg/broadinstitute/sting/utils/pairhmm/VectorLoglessPairHMM/JNIHaplotypeDataHolderClass;[DI)V
+ */
+JNIEXPORT void JNICALL Java_org_broadinstitute_sting_utils_pairhmm_VectorLoglessPairHMM_jniComputeLikelihoods
+  (JNIEnv *, jobject, jint, jint, jobjectArray, jobjectArray, jdoubleArray, jint);
+
+#ifdef __cplusplus
+}
+#endif
+#endif
diff --git a/public/VectorPairHMM/src/main/c++/pairhmm-1-base.cc b/public/VectorPairHMM/src/main/c++/pairhmm-1-base.cc
new file mode 100644
index 000000000..7ff219b88
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/pairhmm-1-base.cc
@@ -0,0 +1,70 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+//#define DEBUG 1
+//#define DEBUG0_1 1
+//#define DEBUG3 1
+#include "headers.h"
+#include "utils.h"
+#include "LoadTimeInitializer.h"
+using namespace std;
+
+int main(int argc, char** argv)
+{
+#define BATCH_SIZE 10000
+  if(argc < 2)
+  {
+    cerr << "Needs path to input file as argument\n";
+    exit(0);
+  }
+  bool use_old_read_testcase = false;
+  if(argc >= 3 && string(argv[2]) == "1")
+    use_old_read_testcase = true;
+  unsigned chunk_size = 10000;
+  bool do_check = true;
+  uint64_t mask = ~(0ull);
+  for(int i=3;i<argc;++i)
+  {
+    if(strncmp(argv[i], "-chunk_size", 15) == 0)
+    {
+      ++i;
+      chunk_size = strtol(argv[i],0,10);
+    }
+    else
+      if(strncmp(argv[i], "-mask", 15) == 0)
+      {
+        ++i;
+        mask = strtoll(argv[i],0,16);
+      }
+      else
+        if(strncmp(argv[i], "-no-check", 15) == 0)
+          do_check = false;
+  }
+  if(mask != (~0ull))
+    initialize_function_pointers(mask);
+  do_compute(argv[1], use_old_read_testcase, chunk_size, do_check); 
+  return 0;  
+}
+
diff --git a/public/VectorPairHMM/src/main/c++/pairhmm-template-kernel.cc b/public/VectorPairHMM/src/main/c++/pairhmm-template-kernel.cc
new file mode 100644
index 000000000..8c62b3c09
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/pairhmm-template-kernel.cc
@@ -0,0 +1,380 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#ifdef PRECISION
+
+#include <stdint.h>
+#include <assert.h>
+#include <stdlib.h>
+
+
+void CONCAT(CONCAT(precompute_masks_,SIMD_ENGINE), PRECISION)(const testcase& tc, int COLS, int numMaskVecs, MASK_TYPE (*maskArr)[NUM_DISTINCT_CHARS]) {
+
+    const int maskBitCnt = MAIN_TYPE_SIZE ;
+
+    for (int vi=0; vi < numMaskVecs; ++vi) {
+        for (int rs=0; rs < NUM_DISTINCT_CHARS; ++rs) {
+            maskArr[vi][rs] = 0 ;
+        }
+        maskArr[vi][AMBIG_CHAR] = MASK_ALL_ONES ;
+    }
+
+    for (int col=1; col < COLS; ++col) {
+        int mIndex = (col-1) / maskBitCnt ;
+        int mOffset = (col-1) % maskBitCnt ;
+        MASK_TYPE bitMask = ((MASK_TYPE)0x1) << (maskBitCnt-1-mOffset) ;
+
+        char hapChar = ConvertChar::get(tc.hap[col-1]);
+
+        if (hapChar == AMBIG_CHAR) {
+            for (int ci=0; ci < NUM_DISTINCT_CHARS; ++ci)
+                maskArr[mIndex][ci] |= bitMask ;
+        }
+
+        maskArr[mIndex][hapChar] |= bitMask ;
+        // bit corresponding to col 1 will be the MSB of the mask 0
+        // bit corresponding to col 2 will be the MSB-1 of the mask 0
+        // ...
+        // bit corresponding to col 32 will be the LSB of the mask 0
+        // bit corresponding to col 33 will be the MSB of the mask 1
+        // ...
+    }
+
+}
+
+void CONCAT(CONCAT(init_masks_for_row_,SIMD_ENGINE), PRECISION)(const testcase& tc, char* rsArr, MASK_TYPE* lastMaskShiftOut, int beginRowIndex, int numRowsToProcess) {
+
+    for (int ri=0; ri < numRowsToProcess; ++ri) {
+        rsArr[ri] = ConvertChar::get(tc.rs[ri+beginRowIndex-1]) ;
+    }
+
+    for (int ei=0; ei < AVX_LENGTH; ++ei) {
+        lastMaskShiftOut[ei] = 0 ;
+    }
+}
+
+#define SET_MASK_WORD(__dstMask, __srcMask, __lastShiftOut, __shiftBy, __maskBitCnt){ \
+    MASK_TYPE __bitMask = (((MASK_TYPE)0x1) << __shiftBy) - 1 ;            \
+    MASK_TYPE __nextShiftOut = (__srcMask & __bitMask) << (__maskBitCnt - __shiftBy) ; \
+    __dstMask = (__srcMask >> __shiftBy) | __lastShiftOut ;        \
+    __lastShiftOut = __nextShiftOut ;                    \
+}
+
+
+void CONCAT(CONCAT(update_masks_for_cols_,SIMD_ENGINE), PRECISION)(int maskIndex, BITMASK_VEC& bitMaskVec, MASK_TYPE (*maskArr) [NUM_DISTINCT_CHARS], char* rsArr, MASK_TYPE* lastMaskShiftOut, int maskBitCnt) {
+
+    for (int ei=0; ei < AVX_LENGTH/2; ++ei) {
+        SET_MASK_WORD(bitMaskVec.getLowEntry(ei), maskArr[maskIndex][rsArr[ei]],
+                lastMaskShiftOut[ei], ei, maskBitCnt) ;
+
+        int ei2 = ei + AVX_LENGTH/2 ; // the second entry index
+        SET_MASK_WORD(bitMaskVec.getHighEntry(ei), maskArr[maskIndex][rsArr[ei2]],
+                lastMaskShiftOut[ei2], ei2, maskBitCnt) ;
+    }
+
+}
+
+
+inline void CONCAT(CONCAT(computeDistVec,SIMD_ENGINE), PRECISION) (BITMASK_VEC& bitMaskVec, SIMD_TYPE& distm, SIMD_TYPE& _1_distm, SIMD_TYPE& distmChosen) {
+
+    distmChosen = VEC_BLENDV(distm, _1_distm, bitMaskVec.getCombinedMask()) ;
+
+    bitMaskVec.shift_left_1bit() ;
+}
+
+/*
+ * This function:
+ * 1- Intializes probability values p_MM, p_XX, P_YY, p_MX, p_GAPM and pack them into vectors (SSE or AVX)
+ * 2- Precompute parts of "distm" which only depeneds on a row number and pack it into vector
+ */
+ 
+template<class NUMBER> void CONCAT(CONCAT(initializeVectors,SIMD_ENGINE), PRECISION)(int ROWS, int COLS, NUMBER* shiftOutM, NUMBER *shiftOutX, NUMBER *shiftOutY, Context<NUMBER> ctx, testcase *tc,  SIMD_TYPE *p_MM, SIMD_TYPE *p_GAPM, SIMD_TYPE *p_MX, SIMD_TYPE *p_XX, SIMD_TYPE *p_MY, SIMD_TYPE *p_YY, SIMD_TYPE *distm1D)
+{
+    NUMBER zero = ctx._(0.0);
+    NUMBER init_Y = ctx.INITIAL_CONSTANT / (tc->haplen);
+    for (int s=0;s<ROWS+COLS+AVX_LENGTH;s++)
+    {
+        shiftOutM[s] = zero;
+        shiftOutX[s] = zero;
+        shiftOutY[s] = init_Y;
+    }
+
+    NUMBER *ptr_p_MM = (NUMBER *)p_MM;
+    NUMBER *ptr_p_XX = (NUMBER *)p_XX;
+    NUMBER *ptr_p_YY = (NUMBER *)p_YY;
+    NUMBER *ptr_p_MX = (NUMBER *)p_MX;
+    NUMBER *ptr_p_MY = (NUMBER *)p_MY;
+    NUMBER *ptr_p_GAPM = (NUMBER *)p_GAPM;
+
+    *ptr_p_MM = ctx._(0.0);
+    *ptr_p_XX = ctx._(0.0);
+    *ptr_p_YY = ctx._(0.0);
+    *ptr_p_MX = ctx._(0.0);
+    *ptr_p_MY = ctx._(0.0);
+    *ptr_p_GAPM = ctx._(0.0);
+
+    for (int r = 1; r < ROWS; r++)
+    {
+        int _i = tc->i[r-1] & 127;
+        int _d = tc->d[r-1] & 127;
+        int _c = tc->c[r-1] & 127;
+
+        //*(ptr_p_MM+r-1) = ctx._(1.0) - ctx.ph2pr[(_i + _d) & 127];
+        SET_MATCH_TO_MATCH_PROB(*(ptr_p_MM+r-1), _i, _d);
+        *(ptr_p_GAPM+r-1) = ctx._(1.0) - ctx.ph2pr[_c];
+        *(ptr_p_MX+r-1) = ctx.ph2pr[_i];
+        *(ptr_p_XX+r-1) = ctx.ph2pr[_c];
+        *(ptr_p_MY+r-1) = ctx.ph2pr[_d];
+        *(ptr_p_YY+r-1) = ctx.ph2pr[_c];
+    }
+
+    NUMBER *ptr_distm1D = (NUMBER *)distm1D;
+    for (int r = 1; r < ROWS; r++)
+    {
+        int _q = tc->q[r-1] & 127;
+        ptr_distm1D[r-1] = ctx.ph2pr[_q];
+    }
+}
+
+/*
+ * This function handles pre-stripe computation:
+ * 1- Retrieve probaility vectors from memory 
+ * 2- Initialize M, X, Y vectors with all 0's (for the first stripe) and shifting the last row from previous stripe for the rest 
+ */
+
+template<class NUMBER> inline void CONCAT(CONCAT(stripeINITIALIZATION,SIMD_ENGINE), PRECISION)(
+        int stripeIdx, Context<NUMBER> ctx, testcase *tc, SIMD_TYPE &pGAPM, SIMD_TYPE &pMM, SIMD_TYPE &pMX, SIMD_TYPE &pXX, SIMD_TYPE &pMY, SIMD_TYPE &pYY,
+        SIMD_TYPE &rs, UNION_TYPE &rsN, SIMD_TYPE &distm, SIMD_TYPE &_1_distm,  SIMD_TYPE *distm1D, SIMD_TYPE N_packed256, SIMD_TYPE *p_MM , SIMD_TYPE *p_GAPM ,
+        SIMD_TYPE *p_MX, SIMD_TYPE *p_XX , SIMD_TYPE *p_MY, SIMD_TYPE *p_YY, UNION_TYPE &M_t_2, UNION_TYPE &X_t_2, UNION_TYPE &M_t_1, UNION_TYPE &X_t_1,
+        UNION_TYPE &Y_t_2, UNION_TYPE &Y_t_1, UNION_TYPE &M_t_1_y, NUMBER* shiftOutX, NUMBER* shiftOutM)
+{
+    int i = stripeIdx;
+    pGAPM = p_GAPM[i];
+    pMM   = p_MM[i];
+    pMX   = p_MX[i];
+    pXX   = p_XX[i];
+    pMY   = p_MY[i];
+    pYY   = p_YY[i];
+
+    NUMBER zero = ctx._(0.0);
+    NUMBER init_Y = ctx.INITIAL_CONSTANT / (tc->haplen);
+    UNION_TYPE packed1;  packed1.d = VEC_SET1_VAL(1.0);
+    UNION_TYPE packed3;  packed3.d = VEC_SET1_VAL(3.0);
+
+    distm = distm1D[i];
+    _1_distm = VEC_SUB(packed1.d, distm);
+
+    distm = VEC_DIV(distm, packed3.d);
+
+    /* initialize M_t_2, M_t_1, X_t_2, X_t_1, Y_t_2, Y_t_1 */
+    M_t_2.d = VEC_SET1_VAL(zero);
+    X_t_2.d = VEC_SET1_VAL(zero);
+
+    if (i==0) {
+        M_t_1.d = VEC_SET1_VAL(zero);
+        X_t_1.d = VEC_SET1_VAL(zero);
+        Y_t_2.d = VEC_SET_LSE(init_Y);
+        Y_t_1.d = VEC_SET1_VAL(zero);
+    }
+    else {
+        X_t_1.d = VEC_SET_LSE(shiftOutX[AVX_LENGTH]);
+        M_t_1.d = VEC_SET_LSE(shiftOutM[AVX_LENGTH]);
+        Y_t_2.d = VEC_SET1_VAL(zero);
+        Y_t_1.d = VEC_SET1_VAL(zero);
+    }
+    M_t_1_y = M_t_1;
+}
+
+/*
+ *  This function is the main compute kernel to compute M, X and Y
+ */
+
+inline void CONCAT(CONCAT(computeMXY,SIMD_ENGINE), PRECISION)(UNION_TYPE &M_t, UNION_TYPE &X_t, UNION_TYPE &Y_t, UNION_TYPE &M_t_y,
+        UNION_TYPE M_t_2, UNION_TYPE X_t_2, UNION_TYPE Y_t_2, UNION_TYPE M_t_1, UNION_TYPE X_t_1, UNION_TYPE M_t_1_y, UNION_TYPE Y_t_1,
+        SIMD_TYPE pMM, SIMD_TYPE pGAPM, SIMD_TYPE pMX, SIMD_TYPE pXX, SIMD_TYPE pMY, SIMD_TYPE pYY, SIMD_TYPE distmSel)
+{
+    /* Compute M_t <= distm * (p_MM*M_t_2 + p_GAPM*X_t_2 + p_GAPM*Y_t_2) */
+    M_t.d = VEC_MUL(VEC_ADD(VEC_ADD(VEC_MUL(M_t_2.d, pMM), VEC_MUL(X_t_2.d, pGAPM)), VEC_MUL(Y_t_2.d, pGAPM)), distmSel);
+    //M_t.d = VEC_MUL( VEC_ADD(VEC_MUL(M_t_2.d, pMM), VEC_MUL(VEC_ADD(X_t_2.d, Y_t_2.d), pGAPM)), distmSel);
+
+    M_t_y = M_t;
+
+    /* Compute X_t */
+    X_t.d = VEC_ADD(VEC_MUL(M_t_1.d, pMX) , VEC_MUL(X_t_1.d, pXX));
+
+    /* Compute Y_t */
+    Y_t.d = VEC_ADD(VEC_MUL(M_t_1_y.d, pMY) , VEC_MUL(Y_t_1.d, pYY));
+}
+
+/*
+ * This is the main compute function. It operates on the matrix in s stripe manner.
+ * The stripe height is determined by the SIMD engine type. 
+ * Stripe height: "AVX float": 8, "AVX double": 4, "SSE float": 4, "SSE double": 2
+ * For each stripe the operations are anti-diagonal based. 
+ * Each anti-diagonal (M_t, Y_t, X_t) depends on the two previous anti-diagonals (M_t_2, X_t_2, Y_t_2, M_t_1, X_t_1, Y_t_1).
+ * Each stripe (except the fist one) depends on the last row of the previous stripe.
+ * The last stripe computation handles the addition of the last row of M and X, that's the reason for loop spliting.
+ */
+
+template<class NUMBER> NUMBER CONCAT(CONCAT(compute_full_prob_,SIMD_ENGINE), PRECISION) (testcase *tc, NUMBER *before_last_log = NULL)
+{
+    int ROWS = tc->rslen + 1;
+    int COLS = tc->haplen + 1;
+    int MAVX_COUNT = (ROWS+AVX_LENGTH-1)/AVX_LENGTH;
+
+    /* Probaility arrays */
+    SIMD_TYPE p_MM   [MAVX_COUNT], p_GAPM [MAVX_COUNT], p_MX   [MAVX_COUNT];
+    SIMD_TYPE p_XX   [MAVX_COUNT], p_MY   [MAVX_COUNT], p_YY   [MAVX_COUNT];
+
+    /* For distm precomputation */
+    SIMD_TYPE distm1D[MAVX_COUNT];
+
+    /* Carries the values from each stripe to the next stripe */
+    NUMBER shiftOutM[ROWS+COLS+AVX_LENGTH], shiftOutX[ROWS+COLS+AVX_LENGTH], shiftOutY[ROWS+COLS+AVX_LENGTH];
+
+    /* The vector to keep the anti-diagonals of M, X, Y*/
+    /* Current: M_t, X_t, Y_t */
+    /* Previous: M_t_1, X_t_1, Y_t_1 */
+    /* Previous to previous: M_t_2, X_t_2, Y_t_2 */ 
+    UNION_TYPE  M_t, M_t_1, M_t_2, X_t, X_t_1, X_t_2, Y_t, Y_t_1, Y_t_2, M_t_y, M_t_1_y;
+
+    /* Probality vectors */
+    SIMD_TYPE pGAPM, pMM, pMX, pXX, pMY, pYY;
+
+    struct timeval start, end;
+    NUMBER result_avx2;
+    Context<NUMBER> ctx;
+    UNION_TYPE rs , rsN;
+    HAP_TYPE hap;
+    SIMD_TYPE distmSel, distmChosen ;
+    SIMD_TYPE distm, _1_distm;
+
+    int r, c;
+    NUMBER zero = ctx._(0.0);
+    UNION_TYPE packed1;  packed1.d = VEC_SET1_VAL(1.0);
+    SIMD_TYPE N_packed256 = VEC_POPCVT_CHAR('N');
+    NUMBER init_Y = ctx.INITIAL_CONSTANT / (tc->haplen);
+    int remainingRows = (ROWS-1) % AVX_LENGTH;
+    int stripe_cnt = ((ROWS-1) / AVX_LENGTH) + (remainingRows!=0);
+
+    const int maskBitCnt = MAIN_TYPE_SIZE ;
+    const int numMaskVecs = (COLS+ROWS+maskBitCnt-1)/maskBitCnt ; // ceil function
+
+    /* Mask precomputation for distm*/
+    MASK_TYPE maskArr[numMaskVecs][NUM_DISTINCT_CHARS] ;
+    CONCAT(CONCAT(precompute_masks_,SIMD_ENGINE), PRECISION)(*tc, COLS, numMaskVecs, maskArr) ;
+
+    char rsArr[AVX_LENGTH] ;
+    MASK_TYPE lastMaskShiftOut[AVX_LENGTH] ;
+
+    /* Precompute initialization for probabilities and shift vector*/
+    CONCAT(CONCAT(initializeVectors,SIMD_ENGINE), PRECISION)<NUMBER>(ROWS, COLS, shiftOutM, shiftOutX, shiftOutY,
+            ctx, tc, p_MM, p_GAPM, p_MX, p_XX, p_MY, p_YY, distm1D);
+
+    for (int i=0;i<stripe_cnt-1;i++)
+    {
+        //STRIPE_INITIALIZATION
+        CONCAT(CONCAT(stripeINITIALIZATION,SIMD_ENGINE), PRECISION)(i, ctx, tc, pGAPM, pMM, pMX, pXX, pMY, pYY, rs.d, rsN, distm, _1_distm, distm1D, N_packed256, p_MM , p_GAPM ,
+                p_MX, p_XX , p_MY, p_YY, M_t_2, X_t_2, M_t_1, X_t_1, Y_t_2, Y_t_1, M_t_1_y, shiftOutX, shiftOutM);
+        CONCAT(CONCAT(init_masks_for_row_,SIMD_ENGINE), PRECISION)(*tc, rsArr, lastMaskShiftOut, i*AVX_LENGTH+1, AVX_LENGTH) ;
+        // Since there are no shift intrinsics in AVX, keep the masks in 2 SSE vectors
+
+        BITMASK_VEC bitMaskVec ;
+
+        for (int begin_d=1;begin_d<COLS+AVX_LENGTH;begin_d+=MAIN_TYPE_SIZE)
+        {
+            int numMaskBitsToProcess = std::min(MAIN_TYPE_SIZE, COLS+AVX_LENGTH-begin_d) ;
+            CONCAT(CONCAT(update_masks_for_cols_,SIMD_ENGINE), PRECISION)((begin_d-1)/MAIN_TYPE_SIZE, bitMaskVec, maskArr, rsArr, lastMaskShiftOut, maskBitCnt) ;
+
+            for (int mbi=0; mbi < numMaskBitsToProcess; ++mbi) {
+                CONCAT(CONCAT(computeDistVec,SIMD_ENGINE), PRECISION) (bitMaskVec, distm, _1_distm, distmChosen) ;
+                int ShiftIdx = begin_d + mbi + AVX_LENGTH;
+
+                CONCAT(CONCAT(computeMXY,SIMD_ENGINE), PRECISION)(M_t, X_t, Y_t, M_t_y, M_t_2, X_t_2, Y_t_2, M_t_1, X_t_1, M_t_1_y, Y_t_1,
+                        pMM, pGAPM, pMX, pXX, pMY, pYY, distmChosen);
+
+                CONCAT(CONCAT(_vector_shift,SIMD_ENGINE), PRECISION)(M_t, shiftOutM[ShiftIdx], shiftOutM[begin_d+mbi]);
+
+                CONCAT(CONCAT(_vector_shift,SIMD_ENGINE), PRECISION)(X_t, shiftOutX[ShiftIdx], shiftOutX[begin_d+mbi]);
+
+                CONCAT(CONCAT(_vector_shift,SIMD_ENGINE), PRECISION)(Y_t_1, shiftOutY[ShiftIdx], shiftOutY[begin_d+mbi]);
+
+                M_t_2 = M_t_1; M_t_1 = M_t; X_t_2 = X_t_1; X_t_1 = X_t;
+                Y_t_2 = Y_t_1; Y_t_1 = Y_t; M_t_1_y = M_t_y;
+            }
+        }
+    }
+
+    int i = stripe_cnt-1;
+    {
+        //STRIPE_INITIALIZATION
+        CONCAT(CONCAT(stripeINITIALIZATION,SIMD_ENGINE), PRECISION)(i, ctx, tc, pGAPM, pMM, pMX, pXX, pMY, pYY, rs.d, rsN, distm, _1_distm, distm1D, N_packed256, p_MM , p_GAPM ,
+                p_MX, p_XX , p_MY, p_YY, M_t_2, X_t_2, M_t_1, X_t_1, Y_t_2, Y_t_1, M_t_1_y, shiftOutX, shiftOutM);
+
+        if (remainingRows==0) remainingRows=AVX_LENGTH;
+        CONCAT(CONCAT(init_masks_for_row_,SIMD_ENGINE), PRECISION)(*tc, rsArr, lastMaskShiftOut, i*AVX_LENGTH+1, remainingRows) ;
+
+        SIMD_TYPE sumM, sumX;
+        sumM = VEC_SET1_VAL(zero);
+        sumX = VEC_SET1_VAL(zero);
+
+        // Since there are no shift intrinsics in AVX, keep the masks in 2 SSE vectors
+        BITMASK_VEC bitMaskVec ;
+
+        for (int begin_d=1;begin_d<COLS+remainingRows-1;begin_d+=MAIN_TYPE_SIZE)
+        {
+            int numMaskBitsToProcess = std::min(MAIN_TYPE_SIZE, COLS+remainingRows-1-begin_d) ;
+            CONCAT(CONCAT(update_masks_for_cols_,SIMD_ENGINE),PRECISION)((begin_d-1)/MAIN_TYPE_SIZE, bitMaskVec, maskArr, rsArr, lastMaskShiftOut, maskBitCnt) ;
+
+            for (int mbi=0; mbi < numMaskBitsToProcess; ++mbi) {
+
+                CONCAT(CONCAT(computeDistVec,SIMD_ENGINE), PRECISION) (bitMaskVec, distm, _1_distm, distmChosen) ;
+                int ShiftIdx = begin_d + mbi +AVX_LENGTH;
+
+                CONCAT(CONCAT(computeMXY,SIMD_ENGINE), PRECISION)(M_t, X_t, Y_t, M_t_y, M_t_2, X_t_2, Y_t_2, M_t_1, X_t_1, M_t_1_y, Y_t_1,
+                        pMM, pGAPM, pMX, pXX, pMY, pYY, distmChosen);
+
+                sumM  = VEC_ADD(sumM, M_t.d);
+                CONCAT(CONCAT(_vector_shift_last,SIMD_ENGINE), PRECISION)(M_t, shiftOutM[ShiftIdx]);
+
+                sumX  = VEC_ADD(sumX, X_t.d);
+                CONCAT(CONCAT(_vector_shift_last,SIMD_ENGINE), PRECISION)(X_t, shiftOutX[ShiftIdx]);
+
+                CONCAT(CONCAT(_vector_shift_last,SIMD_ENGINE), PRECISION)(Y_t_1, shiftOutY[ShiftIdx]);
+
+                M_t_2 = M_t_1; M_t_1 = M_t; X_t_2 = X_t_1; X_t_1 = X_t;
+                Y_t_2 = Y_t_1; Y_t_1 = Y_t; M_t_1_y = M_t_y;
+
+            }
+        }
+        UNION_TYPE sumMX;
+        sumMX.d = VEC_ADD(sumM, sumX);
+        result_avx2 = sumMX.f[remainingRows-1];
+    }
+    return result_avx2;
+}
+
+#endif
+
diff --git a/public/VectorPairHMM/src/main/c++/pairhmm-template-main.cc b/public/VectorPairHMM/src/main/c++/pairhmm-template-main.cc
new file mode 100644
index 000000000..5d9a05830
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/pairhmm-template-main.cc
@@ -0,0 +1,114 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#include "headers.h"
+#include "template.h"
+#include "vector_defs.h"
+
+#define SIMD_ENGINE avx
+#define SIMD_ENGINE_AVX
+
+
+#define BATCH_SIZE  10000
+#define RUN_HYBRID
+
+double getCurrClk();
+int thread_level_parallelism_enabled = false ;
+
+
+int main()
+{
+    testcase* tc = new testcase[BATCH_SIZE];
+    float result[BATCH_SIZE], result_avxf;
+    double result_avxd;
+    double lastClk = 0.0 ;
+    double aggregateTimeRead = 0.0;
+    double aggregateTimeCompute = 0.0;
+    double aggregateTimeWrite = 0.0;
+
+    // Need to call it once to initialize the static array
+    ConvertChar::init() ;
+
+    //      char* ompEnvVar = getenv("OMP_NUM_THREADS") ;
+    //      if (ompEnvVar != NULL && ompEnvVar != "" && ompEnvVar != "1" ) {
+    //        thread_level_parallelism_enabled = true ;
+    //      }
+
+    bool noMoreData = false;
+    int count =0;
+    while (!noMoreData)
+    {
+        int read_count = BATCH_SIZE;
+
+        lastClk = getCurrClk() ;
+        for (int b=0;b<BATCH_SIZE;b++)
+            if (read_testcase(&tc[b])==-1)
+            {
+                read_count = b;
+                noMoreData = true;
+                break;
+            }
+        aggregateTimeRead += (getCurrClk() - lastClk) ;
+        lastClk = getCurrClk() ;
+
+        //#pragma omp parallel for schedule(dynamic) if(thread_level_parallelism_enabled)
+        for (int b=0;b<read_count;b++)
+        {
+            result_avxf = CONCAT(CONCAT(compute_full_prob_,SIMD_ENGINE), s)<float>(&tc[b]);
+
+#ifdef RUN_HYBRID
+#define MIN_ACCEPTED 1e-28f
+            if (result_avxf < MIN_ACCEPTED) {
+                count++;
+                result_avxd = CONCAT(CONCAT(compute_full_prob_,SIMD_ENGINE), d)<double>(&tc[b]);
+                result[b] = log10(result_avxd) - log10(ldexp(1.0, 1020.f));
+            }
+            else
+                result[b] = log10f(result_avxf) - log10f(ldexpf(1.f, 120.f));
+#endif
+
+#ifndef RUN_HYBRID
+            result[b] = log10f(result_avxf) - log10f(ldexpf(1.f, 120.f));
+#endif
+        }
+        aggregateTimeCompute += (getCurrClk() - lastClk) ;
+        lastClk = getCurrClk() ;
+        for (int b=0;b<read_count;b++)
+            printf("%E\n", result[b]);
+        aggregateTimeWrite += (getCurrClk() - lastClk) ;
+    }
+
+    delete tc;
+    printf("AVX Read Time: %.2f\n", aggregateTimeRead);
+    printf("AVX Compute Time: %.2f\n", aggregateTimeCompute);
+    printf("AVX Write Time: %.2f\n", aggregateTimeWrite);
+    printf("AVX Total Time: %.2f\n", aggregateTimeRead + aggregateTimeCompute + aggregateTimeWrite);
+    printf("# Double called: %d\n", count);
+
+    return 0;
+}
+
+
+
diff --git a/public/VectorPairHMM/src/main/c++/run.sh b/public/VectorPairHMM/src/main/c++/run.sh
new file mode 100755
index 000000000..e821497f1
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/run.sh
@@ -0,0 +1,32 @@
+#!/bin/bash
+rm -f *.txt *.log
+GSA_ROOT_DIR=/home/karthikg/broad/gsa-unstable
+pair_hmm_implementation="VECTOR_LOGLESS_CACHING";
+if [ "$#" -ge 1 ];
+then
+  pair_hmm_implementation=$1;
+fi
+
+#-Djava.library.path is needed if you wish to override the default 'packed' library
+#java -jar $GSA_ROOT_DIR/target/GenomeAnalysisTK.jar   -T HaplotypeCaller \
+java  -Djava.library.path=${GSA_ROOT_DIR}/public/VectorPairHMM/src/main/c++ -jar $GSA_ROOT_DIR/target/GenomeAnalysisTK.jar   -T HaplotypeCaller \
+--dbsnp /data/broad/samples/joint_variant_calling/dbSNP/00-All.vcf \
+-R /opt/Genomics/ohsu/dnapipeline/humanrefgenome/human_g1k_v37.fasta \
+-I /data/simulated/sim1M_pairs_final.bam \
+-stand_call_conf 50.0 \
+-stand_emit_conf 10.0 \
+--pair_hmm_implementation $pair_hmm_implementation \
+-o output.raw.snps.indels.vcf 
+
+#--pair_hmm_implementation JNI_LOGLESS_CACHING \
+#-XL unmapped	\
+#-I /data/simulated/sim1M_pairs_final.bam \
+#-I /data/broad/samples/joint_variant_calling/NA12878_low_coverage_alignment/NA12878.chrom11.ILLUMINA.bwa.CEU.low_coverage.20121211.bam \
+#-I /data/broad/samples/joint_variant_calling/NA12878_high_coverage_alignment/NA12878.mapped.ILLUMINA.bwa.CEU.high_coverage_pcr_free.20130906.bam \
+#-R /data/broad/samples/joint_variant_calling/broad_reference/Homo_sapiens_assembly18.fasta \
+#-R /data/broad/samples/joint_variant_calling/broad_reference/Homo_sapiens_assembly19.fasta \
+#-R /data/broad/samples/joint_variant_calling/broad_reference/ucsc.hg19.fasta \
+#-R /opt/Genomics/ohsu/dnapipeline/humanrefgenome/human_g1k_v37.fasta \
+#-R /data/broad/samples/joint_variant_calling/broad_reference/human_g1k_v37_decoy.fasta \
+#--dbsnp /data/broad/samples/joint_variant_calling/dbSNP/00-All.vcf \
+#--dbsnp /data/broad/samples/joint_variant_calling/dbSNP/dbsnp_138.hg19.vcf \
diff --git a/public/VectorPairHMM/src/main/c++/shift_template.c b/public/VectorPairHMM/src/main/c++/shift_template.c
new file mode 100644
index 000000000..c591c6882
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/shift_template.c
@@ -0,0 +1,113 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#ifdef PRECISION
+
+#ifdef SIMD_ENGINE_AVX
+
+inline void CONCAT(CONCAT(_vector_shift,SIMD_ENGINE), PRECISION) (UNION_TYPE &x, MAIN_TYPE shiftIn, MAIN_TYPE &shiftOut)
+{
+    IF_128 xlow , xhigh;
+    /* cast x to xlow */
+    xlow.f = VEC_CAST_256_128(x.d);
+    /* extract x,1 to xhigh */
+    xhigh.f = VEC_EXTRACT_128(x.d, 1);
+    /* extract xlow[3] */
+    IF_128 shiftOutL128;
+    shiftOutL128.i = _mm_srli_si128(xlow.i, SHIFT_CONST1);
+    /* extract xhigh[3] */
+    IF_MAIN_TYPE shiftOutH;
+    shiftOutH.i = VEC_EXTRACT_UNIT(xhigh.i, SHIFT_CONST2);
+    shiftOut = shiftOutH.f;
+    /* shift xlow */
+    xlow.i = _mm_slli_si128 (xlow.i, SHIFT_CONST3);
+    /* shift xhigh */
+    xhigh.i = _mm_slli_si128 (xhigh.i, SHIFT_CONST3);
+    /*movss shiftIn to xlow[0] */
+    _128_TYPE shiftIn128 = VEC_SET1_VAL128(shiftIn);
+    xlow.f = VEC_MOVE(xlow.f , shiftIn128);
+    /*movss xlow[3] to xhigh[0] */
+    xhigh.f = VEC_MOVE(xhigh.f, shiftOutL128.f);
+    /* cast xlow to x */
+    x.d = VEC_CAST_128_256(xlow.f);
+    /* insert xhigh to x,1 */
+    x.d = VEC_INSERT_VAL(x.d, xhigh.f, 1);
+}
+
+
+inline void CONCAT(CONCAT(_vector_shift_last,SIMD_ENGINE), PRECISION) (UNION_TYPE &x, MAIN_TYPE shiftIn)
+{
+    IF_128 xlow , xhigh;
+    /* cast x to xlow */
+    xlow.f = VEC_CAST_256_128(x.d);
+    /* extract x,1 to xhigh */
+    xhigh.f = VEC_EXTRACT_128(x.d, 1);
+    /* extract xlow[3] */
+    IF_128 shiftOutL128;
+    shiftOutL128.i = _mm_srli_si128(xlow.i, SHIFT_CONST1);
+    /* shift xlow */
+    xlow.i = _mm_slli_si128 (xlow.i, SHIFT_CONST3);
+    /* shift xhigh */
+    xhigh.i = _mm_slli_si128 (xhigh.i, SHIFT_CONST3);
+    /*movss shiftIn to xlow[0] */
+    _128_TYPE shiftIn128 = VEC_SET1_VAL128(shiftIn);
+    xlow.f = VEC_MOVE(xlow.f , shiftIn128);
+    /*movss xlow[3] to xhigh[0] */
+    xhigh.f = VEC_MOVE(xhigh.f, shiftOutL128.f);
+    /* cast xlow to x */
+    x.d = VEC_CAST_128_256(xlow.f);
+    /* insert xhigh to x,1 */
+    x.d = VEC_INSERT_VAL(x.d, xhigh.f, 1);
+}
+
+#endif
+
+#ifdef SIMD_ENGINE_SSE
+
+inline void CONCAT(CONCAT(_vector_shift,SIMD_ENGINE), PRECISION) (UNION_TYPE &x, MAIN_TYPE shiftIn, MAIN_TYPE &shiftOut)
+{
+    IF_MAIN_TYPE tempIn, tempOut;
+    tempIn.f = shiftIn;
+    /* extratc H */
+    tempOut.i = VEC_EXTRACT_UNIT(x.i, SHIFT_CONST1);
+    shiftOut = tempOut.f;
+    /* shift     */
+    x.i = _mm_slli_si128(x.i, SHIFT_CONST2);
+    /* insert  L */
+    x.i = VEC_INSERT_UNIT(x.i , tempIn.i, SHIFT_CONST3);
+}
+
+inline void CONCAT(CONCAT(_vector_shift_last,SIMD_ENGINE), PRECISION) (UNION_TYPE &x, MAIN_TYPE shiftIn)
+{
+    IF_MAIN_TYPE temp; temp.f = shiftIn;
+    /* shift     */
+    x.i = _mm_slli_si128(x.i, SHIFT_CONST2);
+    /* insert  L */
+    x.i = VEC_INSERT_UNIT(x.i , temp.i, SHIFT_CONST3);
+}
+
+#endif
+
+#endif
diff --git a/public/VectorPairHMM/src/main/c++/sse_function_instantiations.cc b/public/VectorPairHMM/src/main/c++/sse_function_instantiations.cc
new file mode 100644
index 000000000..550272494
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/sse_function_instantiations.cc
@@ -0,0 +1,43 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#include "template.h"
+
+#undef SIMD_ENGINE
+#undef SIMD_ENGINE_AVX
+
+#define SIMD_ENGINE sse
+#define SIMD_ENGINE_SSE
+
+#include "define-sse-float.h"
+#include "shift_template.c"
+#include "pairhmm-template-kernel.cc"
+
+#include "define-sse-double.h"
+#include "shift_template.c"
+#include "pairhmm-template-kernel.cc"
+
+template double compute_full_prob_ssed<double>(testcase* tc, double* nextlog);
+template float compute_full_prob_sses<float>(testcase* tc, float* nextlog);
diff --git a/public/VectorPairHMM/src/main/c++/template.h b/public/VectorPairHMM/src/main/c++/template.h
new file mode 100644
index 000000000..ce4dbfc86
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/template.h
@@ -0,0 +1,320 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#ifndef TEMPLATES_H_
+#define TEMPLATES_H_
+
+#include "headers.h"
+
+#define MM 0
+#define GapM 1
+#define MX 2
+#define XX 3
+#define MY 4
+#define YY 5
+
+//#define MROWS  500
+//#define MCOLS  1000
+
+#define CAT(X,Y) X####Y
+#define CONCAT(X,Y) CAT(X,Y)
+
+#define ALIGNED __attribute__((aligned(32)))
+
+typedef union __attribute__((aligned(32))) {
+        ALIGNED __m256 ALIGNED d;
+        ALIGNED __m128i ALIGNED s[2];
+        ALIGNED float  ALIGNED f[8];
+        ALIGNED __m256i ALIGNED i;
+} ALIGNED mix_F ALIGNED;
+
+typedef union __attribute__((aligned(32))) {
+        ALIGNED __m128 ALIGNED d;
+        ALIGNED __m64 ALIGNED s[2];
+        ALIGNED float  ALIGNED f[4];
+        ALIGNED __m128i ALIGNED i;
+} ALIGNED mix_F128 ALIGNED;
+
+typedef union ALIGNED {
+  __m128i vec ;
+  __m128 vecf ;
+  uint32_t masks[4] ;
+} MaskVec_F ;
+
+typedef union ALIGNED {
+  __m64 vec ;
+  __m64 vecf ;
+  uint32_t masks[2] ;
+} MaskVec_F128 ;
+
+typedef union ALIGNED
+{
+        ALIGNED __m128i ALIGNED i;
+        ALIGNED __m128 ALIGNED f;
+} ALIGNED IF_128f ALIGNED;
+
+typedef union ALIGNED
+{
+        ALIGNED int    ALIGNED i;
+        ALIGNED float  ALIGNED f;
+} ALIGNED IF_32 ALIGNED;
+
+typedef union __attribute__((aligned(32))) {
+        ALIGNED __m256d ALIGNED d;
+        ALIGNED __m128i ALIGNED s[2];
+        ALIGNED double  ALIGNED f[4];
+        ALIGNED __m256i ALIGNED i;
+} ALIGNED mix_D ALIGNED;
+
+typedef union __attribute__((aligned(32))) {
+        ALIGNED __m128d ALIGNED d;
+        ALIGNED __m64 ALIGNED s[2];
+        ALIGNED double  ALIGNED f[2];
+        ALIGNED __m128i ALIGNED i;
+} ALIGNED mix_D128 ALIGNED;
+
+typedef union ALIGNED {
+  __m128i vec ;
+  __m128d vecf ;
+  uint64_t masks[2] ;
+} MaskVec_D ;
+
+typedef union ALIGNED {
+  __m64 vec ;
+  __m64 vecf ;
+  uint64_t masks[1] ;
+} MaskVec_D128 ;
+
+typedef union ALIGNED
+{
+        ALIGNED __m128i ALIGNED i;
+        ALIGNED __m128d ALIGNED f;
+} ALIGNED IF_128d ALIGNED;
+
+typedef union ALIGNED
+{
+        ALIGNED int64_t ALIGNED i;
+        ALIGNED double  ALIGNED f;
+} ALIGNED IF_64 ALIGNED;
+
+
+#define MAX_QUAL 254
+#define MAX_JACOBIAN_TOLERANCE 8.0
+#define JACOBIAN_LOG_TABLE_STEP 0.0001
+#define JACOBIAN_LOG_TABLE_INV_STEP (1.0 / JACOBIAN_LOG_TABLE_STEP)
+#define MAXN 70000
+#define LOG10_CACHE_SIZE  (4*MAXN)  // we need to be able to go up to 2*(2N) when calculating some of the coefficients
+#define JACOBIAN_LOG_TABLE_SIZE ((int) (MAX_JACOBIAN_TOLERANCE / JACOBIAN_LOG_TABLE_STEP) + 1)
+
+template<class NUMBER>
+struct ContextBase
+{
+  public:
+    NUMBER ph2pr[128];
+    NUMBER INITIAL_CONSTANT;
+    NUMBER LOG10_INITIAL_CONSTANT;
+    NUMBER RESULT_THRESHOLD; 
+
+    static bool staticMembersInitializedFlag;
+    static NUMBER jacobianLogTable[JACOBIAN_LOG_TABLE_SIZE];
+    static NUMBER matchToMatchProb[((MAX_QUAL + 1) * (MAX_QUAL + 2)) >> 1];
+
+    static void initializeStaticMembers()
+    {
+      if(!staticMembersInitializedFlag)
+      {
+        //Order of calls important - Jacobian first, then MatchToMatch
+        initializeJacobianLogTable();
+        initializeMatchToMatchProb();
+        staticMembersInitializedFlag = true;
+      }
+    }
+
+    static void deleteStaticMembers()
+    {
+      if(staticMembersInitializedFlag)
+      {
+        staticMembersInitializedFlag = false;
+      }
+    }
+
+    //Called only once during library load - don't bother to optimize with single precision fp
+    static void initializeJacobianLogTable()
+    {
+      for (int k = 0; k < JACOBIAN_LOG_TABLE_SIZE; k++) {
+        jacobianLogTable[k] = (NUMBER)(log10(1.0 + pow(10.0, -((double) k) * JACOBIAN_LOG_TABLE_STEP)));
+      }
+    }
+
+    //Called only once per library load - don't bother optimizing with single fp
+    static void initializeMatchToMatchProb()
+    {
+      double LN10 = log(10);
+      double INV_LN10 = 1.0/LN10;
+      for (int i = 0, offset = 0; i <= MAX_QUAL; offset += ++i)
+        for (int j = 0; j <= i; j++) {
+          double log10Sum = approximateLog10SumLog10(-0.1*i, -0.1*j);
+          double matchToMatchLog10 =
+            log1p(-std::min(1.0,pow(10,log10Sum))) * INV_LN10;
+          matchToMatchProb[offset + j] = (NUMBER)(pow(10,matchToMatchLog10));
+        }
+    }
+    //Called during computation - use single precision where possible
+    static int fastRound(NUMBER d) {
+      return (d > ((NUMBER)0.0)) ? (int) (d + ((NUMBER)0.5)) : (int) (d - ((NUMBER)0.5));
+    }
+    //Called during computation - use single precision where possible
+    static NUMBER approximateLog10SumLog10(NUMBER small, NUMBER big) {
+      // make sure small is really the smaller value
+      if (small > big) {
+        NUMBER t = big;
+        big = small;
+        small = t;
+      }
+
+      if (isinf(small) == -1 || isinf(big) == -1)
+        return big;
+
+      NUMBER diff = big - small;
+      if (diff >= ((NUMBER)MAX_JACOBIAN_TOLERANCE))
+        return big;
+
+      // OK, so |y-x| < tol: we use the following identity then:
+      // we need to compute log10(10^x + 10^y)
+      // By Jacobian logarithm identity, this is equal to
+      // max(x,y) + log10(1+10^-abs(x-y))
+      // we compute the second term as a table lookup with integer quantization
+      // we have pre-stored correction for 0,0.1,0.2,... 10.0
+      int ind = fastRound((NUMBER)(diff * ((NUMBER)JACOBIAN_LOG_TABLE_INV_STEP))); // hard rounding
+      return big + jacobianLogTable[ind];
+    }
+};
+
+template<class NUMBER>
+struct Context : public ContextBase<NUMBER>
+{};
+
+template<>
+struct Context<double> : public ContextBase<double>
+{
+  Context():ContextBase<double>()
+  {
+    for (int x = 0; x < 128; x++)
+      ph2pr[x] = pow(10.0, -((double)x) / 10.0);
+
+    INITIAL_CONSTANT = ldexp(1.0, 1020.0);
+    LOG10_INITIAL_CONSTANT = log10(INITIAL_CONSTANT);
+    RESULT_THRESHOLD = 0.0;
+  }
+
+  double LOG10(double v){ return log10(v); }
+  inline double POW(double b, double e) { return pow(b,e); }
+
+  static double _(double n){ return n; }
+  static double _(float n){ return ((double) n); }
+};
+
+template<>
+struct Context<float> : public ContextBase<float>
+{
+  Context() : ContextBase<float>()
+  {
+    for (int x = 0; x < 128; x++)
+    {
+      ph2pr[x] = powf(10.f, -((float)x) / 10.f);
+    }
+
+    INITIAL_CONSTANT = ldexpf(1.f, 120.f);
+    LOG10_INITIAL_CONSTANT = log10f(INITIAL_CONSTANT);
+    RESULT_THRESHOLD = ldexpf(1.f, -110.f);
+  }
+
+  float LOG10(float v){ return log10f(v); }
+  inline float POW(float b, float e) { return powf(b,e); }
+
+  static float _(double n){ return ((float) n); }
+  static float _(float n){ return n; }
+};
+
+#define SET_MATCH_TO_MATCH_PROB(output, insQual, delQual)                       \
+{                                                                               \
+  int minQual = delQual;                                                        \
+  int maxQual = insQual;                                                        \
+  if (insQual <= delQual)                                                       \
+  {                                                                             \
+    minQual = insQual;                                                          \
+    maxQual = delQual;                                                          \
+  }                                                                             \
+  (output) = (MAX_QUAL < maxQual) ?                                             \
+  ((NUMBER)1.0) - ctx.POW(((NUMBER)10), ctx.approximateLog10SumLog10(((NUMBER)-0.1)*minQual, ((NUMBER)-0.1)*maxQual))       \
+  : ctx.matchToMatchProb[((maxQual * (maxQual + 1)) >> 1) + minQual];           \
+}
+
+typedef struct
+{
+        int rslen, haplen;
+	/*int *q, *i, *d, *c;*/
+	/*int q[MROWS], i[MROWS], d[MROWS], c[MROWS];*/
+	char *q, *i, *d, *c;
+        char *hap, *rs;
+	int *ihap;
+	int *irs;
+} testcase;
+
+int normalize(char c);
+int read_testcase(testcase *tc, FILE* ifp=0);
+
+
+#define MIN_ACCEPTED 1e-28f
+#define NUM_DISTINCT_CHARS 5
+#define AMBIG_CHAR 4
+
+class ConvertChar {
+
+  static uint8_t conversionTable[255] ;
+
+public:
+
+  static void init() {
+    assert (NUM_DISTINCT_CHARS == 5) ;
+    assert (AMBIG_CHAR == 4) ;
+
+    conversionTable['A'] = 0 ;
+    conversionTable['C'] = 1 ;
+    conversionTable['T'] = 2 ;
+    conversionTable['G'] = 3 ;
+    conversionTable['N'] = 4 ;
+  }
+
+  static inline uint8_t get(uint8_t input) {
+    return conversionTable[input] ;
+  }
+
+};
+
+
+#endif
+
+
diff --git a/public/VectorPairHMM/src/main/c++/utils.cc b/public/VectorPairHMM/src/main/c++/utils.cc
new file mode 100644
index 000000000..9f83cffa2
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/utils.cc
@@ -0,0 +1,493 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#include "headers.h"
+#include "template.h"
+#include "utils.h"
+#include "vector_defs.h"
+#include "LoadTimeInitializer.h"
+using namespace std;
+
+//static members from ConvertChar
+uint8_t ConvertChar::conversionTable[255];
+//Global function pointers in utils.h
+float (*g_compute_full_prob_float)(testcase *tc, float* before_last_log) = 0;
+double (*g_compute_full_prob_double)(testcase *tc, double* before_last_log) = 0;
+//Static members in ContextBase
+bool ContextBase<double>::staticMembersInitializedFlag = false;
+double ContextBase<double>::jacobianLogTable[JACOBIAN_LOG_TABLE_SIZE];
+double ContextBase<double>::matchToMatchProb[((MAX_QUAL + 1) * (MAX_QUAL + 2)) >> 1];
+bool ContextBase<float>::staticMembersInitializedFlag = false;
+float ContextBase<float>::jacobianLogTable[JACOBIAN_LOG_TABLE_SIZE];
+float ContextBase<float>::matchToMatchProb[((MAX_QUAL + 1) * (MAX_QUAL + 2)) >> 1];
+
+
+bool is_avx_supported()
+{
+  int ecx = 0, edx = 0, ebx = 0;
+  __asm__("cpuid"
+      : "=b" (ebx),
+      "=c" (ecx),
+      "=d" (edx)
+      : "a" (1)
+      );
+  return ((ecx >> 28)&1) == 1;
+}
+
+bool is_sse41_supported()
+{
+  int ecx = 0, edx = 0, ebx = 0;
+  __asm__("cpuid"
+      : "=b" (ebx),
+      "=c" (ecx),
+      "=d" (edx)
+      : "a" (1)
+      );
+  return ((ecx >> 19)&1) == 1;
+}
+
+bool is_sse42_supported()
+{
+  int ecx = 0, edx = 0, ebx = 0;
+  __asm__("cpuid"
+      : "=b" (ebx),
+      "=c" (ecx),
+      "=d" (edx)
+      : "a" (1)
+      );
+  return ((ecx >> 20)&1) == 1;
+}
+
+uint64_t get_machine_capabilities()
+{
+  uint64_t machine_mask = 0ull;
+  if(is_avx_supported())
+    machine_mask |= (1 << AVX_CUSTOM_IDX);
+  if(is_sse42_supported())
+    machine_mask |= (1 << SSE42_CUSTOM_IDX);
+  if(is_sse41_supported())
+    machine_mask |= (1 << SSE41_CUSTOM_IDX);
+  return machine_mask;
+}
+
+void initialize_function_pointers(uint64_t mask)
+{
+  //mask = 0ull;
+  //mask = (1 << SSE41_CUSTOM_IDX);
+  if(is_avx_supported() && (mask & (1<< AVX_CUSTOM_IDX)))
+  {
+    cout << "Using AVX accelerated implementation of PairHMM\n";
+    g_compute_full_prob_float = compute_full_prob_avxs<float>;
+    g_compute_full_prob_double = compute_full_prob_avxd<double>;
+  }
+  else
+    if(is_sse41_supported() && (mask & ((1<< SSE41_CUSTOM_IDX) | (1<<SSE42_CUSTOM_IDX))))
+    {
+      cout << "Using SSE4.1 accelerated implementation of PairHMM\n";
+      g_compute_full_prob_float = compute_full_prob_sses<float>;
+      g_compute_full_prob_double = compute_full_prob_ssed<double>;
+    }
+    else
+    {
+      cout << "Using un-vectorized C++ implementation of PairHMM\n";
+      g_compute_full_prob_float = compute_full_prob<float>;
+      g_compute_full_prob_double = compute_full_prob<double>;
+    }
+}
+
+int normalize(char c)
+{
+	return ((int) (c - 33));
+}
+
+int read_testcase(testcase *tc, FILE* ifp)
+{
+	char *q, *i, *d, *c, *line = NULL;
+	int _q, _i, _d, _c;
+	int x, size = 0;
+	ssize_t read;
+
+
+        read = getline(&line, (size_t *) &size, ifp == 0 ? stdin : ifp);
+	if (read == -1)
+        {
+          free(line);
+          return -1;
+        }
+
+
+	tc->hap = (char *) malloc(size);
+	tc->rs = (char *) malloc(size);
+	q = (char *) malloc(size);
+	i = (char *) malloc(size);
+	d = (char *) malloc(size);
+	c = (char *) malloc(size);
+
+	if (sscanf(line, "%s %s %s %s %s %s\n", tc->hap, tc->rs, q, i, d, c) != 6)
+		return -1;
+
+
+	tc->haplen = strlen(tc->hap);
+	tc->rslen = strlen(tc->rs);
+        assert(strlen(q) == tc->rslen);
+        assert(strlen(i) == tc->rslen);
+        assert(strlen(d) == tc->rslen);
+        assert(strlen(c) == tc->rslen);
+	//assert(tc->rslen < MROWS);
+        //tc->ihap = (int *) malloc(tc->haplen*sizeof(int));
+        //tc->irs = (int *) malloc(tc->rslen*sizeof(int));
+
+	tc->q = (char *) malloc(sizeof(char) * tc->rslen);
+	tc->i = (char *) malloc(sizeof(char) * tc->rslen);
+	tc->d = (char *) malloc(sizeof(char) * tc->rslen);
+	tc->c = (char *) malloc(sizeof(char) * tc->rslen);
+
+	for (x = 0; x < tc->rslen; x++)
+	{
+		_q = normalize(q[x]);
+		_i = normalize(i[x]);
+		_d = normalize(d[x]);
+		_c = normalize(c[x]);
+                tc->q[x] = (_q < 6) ? 6 : _q;
+                //tc->q[x] = _q;
+		tc->i[x] = _i;
+		tc->d[x] = _d;
+		tc->c[x] = _c;
+                //tc->irs[x] = tc->rs[x];
+	}
+        //for (x = 0; x < tc->haplen; x++)
+        //tc->ihap[x] = tc->hap[x];
+        
+	free(q);
+	free(i);
+	free(d);
+	free(c);
+	free(line);
+
+
+
+	return 0;
+}
+
+unsigned MAX_LINE_LENGTH = 65536;
+int convToInt(std::string s)
+{
+  int i;
+  std::istringstream strin(s);
+  strin >> i;
+  return i;
+}
+
+void tokenize(std::ifstream& fptr, std::vector<std::string>& tokens)
+{
+  int i = 0;
+  std::string tmp;
+  std::vector<std::string> myVec;
+  vector<char> line;
+  line.clear();
+  line.resize(MAX_LINE_LENGTH);
+  vector<char> tmpline;
+  tmpline.clear();
+  tmpline.resize(MAX_LINE_LENGTH);
+  myVec.clear();
+
+  while(!fptr.eof())
+  {
+    i = 0;
+    bool still_read_line = true;
+    unsigned line_position = 0;
+    while(still_read_line)
+    {
+      fptr.getline(&(tmpline[0]), MAX_LINE_LENGTH);
+      if(line_position + MAX_LINE_LENGTH > line.size())
+	line.resize(2*line.size());
+      for(unsigned i=0;i<MAX_LINE_LENGTH && tmpline[i] != '\0';++i,++line_position)
+	line[line_position] = tmpline[i];
+      if(fptr.eof() || !fptr.fail()) 
+      {
+	still_read_line = false;
+	line[line_position++] = '\0';
+      }
+    }
+    std::istringstream kap(&(line[0]));
+
+    while(!kap.eof())
+    {
+      kap >> std::skipws >> tmp;
+      if(tmp != "")
+      {
+	myVec.push_back(tmp);
+	++i;
+	//std::cout <<tmp <<"#";
+      }
+      tmp = "";
+    }
+    //std::cout << "\n";
+    if(myVec.size() > 0)
+      break;
+  }
+  tokens.clear();
+  //std::cout << "Why "<<myVec.size()<<"\n";
+  tokens.resize(myVec.size());
+  for(i=0;i<(int)myVec.size();++i)
+    tokens[i] = myVec[i];
+  line.clear();
+  tmpline.clear();
+}
+
+int read_mod_testcase(ifstream& fptr, testcase* tc, bool reformat)
+{
+  static bool first_call = true;
+  vector<string> tokens;
+  tokens.clear();
+  tokenize(fptr, tokens);
+  if(tokens.size() == 0)
+    return -1;
+  tc->hap = new char[tokens[0].size()+2];
+  tc->haplen = tokens[0].size();
+  memcpy(tc->hap, tokens[0].c_str(), tokens[0].size());
+  tc->rs = new char[tokens[1].size()+2];
+  tc->rslen = tokens[1].size();
+  tc->q = new char[tc->rslen];
+  tc->i = new char[tc->rslen];
+  tc->d = new char[tc->rslen];
+  tc->c = new char[tc->rslen];
+  //cout << "Lengths "<<tc->haplen <<" "<<tc->rslen<<"\n";
+  memcpy(tc->rs, tokens[1].c_str(),tokens[1].size());
+  assert(tokens.size() == 2 + 4*(tc->rslen));
+  //assert(tc->rslen < MROWS);
+  for(unsigned j=0;j<tc->rslen;++j)
+    tc->q[j] = (char)convToInt(tokens[2+0*tc->rslen+j]);
+  for(unsigned j=0;j<tc->rslen;++j)
+    tc->i[j] = (char)convToInt(tokens[2+1*tc->rslen+j]);
+  for(unsigned j=0;j<tc->rslen;++j)
+    tc->d[j] = (char)convToInt(tokens[2+2*tc->rslen+j]);
+  for(unsigned j=0;j<tc->rslen;++j)
+    tc->c[j] = (char)convToInt(tokens[2+3*tc->rslen+j]);
+ 
+  if(reformat)
+  {
+    ofstream ofptr;
+    ofptr.open("reformat/debug_dump.txt",first_call ? ios::out : ios::app);
+    assert(ofptr.is_open());
+    ofptr << tokens[0] << " ";
+    ofptr << tokens[1] << " ";
+    for(unsigned j=0;j<tc->rslen;++j)
+      ofptr << ((char)(tc->q[j]+33));
+    ofptr << " ";
+    for(unsigned j=0;j<tc->rslen;++j)
+      ofptr << ((char)(tc->i[j]+33));
+    ofptr << " ";
+    for(unsigned j=0;j<tc->rslen;++j)
+      ofptr << ((char)(tc->d[j]+33));
+    ofptr << " ";
+    for(unsigned j=0;j<tc->rslen;++j)
+      ofptr << ((char)(tc->c[j]+33));
+    ofptr << " 0 false\n";
+
+    ofptr.close();
+    first_call = false;
+  }
+
+
+  return tokens.size();
+}
+
+double getCurrClk() {
+  struct timeval tv ;
+  gettimeofday(&tv, NULL);
+  return (double)tv.tv_sec + (double)tv.tv_usec / 1000000.0;
+}
+
+inline unsigned long long rdtsc(void)
+{
+  unsigned hi, lo;
+  __asm__ __volatile__ ("rdtsc" : "=a"(lo), "=d"(hi));
+  return ( (unsigned long long)lo)|( ((unsigned long long)hi)<<32 );
+}
+
+void get_time(struct timespec* store_struct)
+{
+  clock_gettime(CLOCK_REALTIME, store_struct);
+}
+
+uint64_t diff_time(struct timespec& prev_time)
+{
+  struct timespec curr_time;
+  clock_gettime(CLOCK_REALTIME, &curr_time);
+  return (uint64_t)((curr_time.tv_sec-prev_time.tv_sec)*1000000000+(curr_time.tv_nsec-prev_time.tv_nsec));
+}
+
+
+#ifdef USE_PAPI
+#include "papi.h"
+#define NUM_PAPI_COUNTERS 4
+#endif
+
+void do_compute(char* filename, bool use_old_read_testcase, unsigned chunk_size, bool do_check)
+{
+  FILE* fptr = 0;
+  ifstream ifptr;
+  if(use_old_read_testcase)
+  {
+    fptr = fopen(filename,"r");
+    assert(fptr);
+  }
+  else
+  {
+    ifptr.open(filename);
+    assert(ifptr.is_open());
+  }
+  vector<testcase> tc_vector;
+  tc_vector.clear();
+  testcase tc;
+  uint64_t vector_compute_time = 0;
+  uint64_t baseline_compute_time = 0;
+  uint64_t num_double_calls = 0;
+  unsigned num_testcases = 0;
+  bool all_ok = do_check ? true : false;
+#ifdef USE_PAPI
+  uint32_t all_mask = (0);
+  uint32_t no_usr_mask = (1 << 16);    //bit 16 user mode, bit 17 kernel mode
+  uint32_t no_kernel_mask = (1 << 17);    //bit 16 user mode, bit 17 kernel mode
+  PAPI_num_counters();
+  int events[NUM_PAPI_COUNTERS] = { 0, 0, 0, 0 };
+  char* eventnames[NUM_PAPI_COUNTERS]=  { "cycles", "itlb_walk_cycles", "dtlb_load_walk_cycles", "dtlb_store_walk_cycles" };
+  assert(PAPI_event_name_to_code("UNHALTED_REFERENCE_CYCLES:u=1:k=1",&(events[0])) == PAPI_OK);
+  assert(PAPI_event_name_to_code("ITLB_MISSES:WALK_DURATION",   &(events[1])) == PAPI_OK);
+  assert(PAPI_event_name_to_code("DTLB_LOAD_MISSES:WALK_DURATION",   &(events[2])) == PAPI_OK);
+  assert(PAPI_event_name_to_code("DTLB_STORE_MISSES:WALK_DURATION",   &(events[3])) == PAPI_OK);
+  long long values[NUM_PAPI_COUNTERS] = { 0, 0, 0, 0 };
+  long long accum_values[NUM_PAPI_COUNTERS] = { 0, 0, 0, 0 };
+#endif
+  while(1)
+  {
+    int break_value = use_old_read_testcase ? read_testcase(&tc, fptr) : read_mod_testcase(ifptr,&tc,true);
+    if(break_value >= 0)
+      tc_vector.push_back(tc);
+    if(tc_vector.size() == BATCH_SIZE || (break_value < 0 && tc_vector.size() > 0))
+    {
+      vector<double> results_vec;
+      vector<double> baseline_results_vec;
+      results_vec.clear();
+      baseline_results_vec.clear();
+      results_vec.resize(tc_vector.size());
+      baseline_results_vec.resize(tc_vector.size());
+      struct timespec start_time;
+#ifdef USE_PAPI
+      assert(PAPI_start_counters(events, NUM_PAPI_COUNTERS) == PAPI_OK);
+#endif
+      get_time(&start_time);
+#pragma omp parallel for schedule(dynamic,chunk_size)  num_threads(12)
+#ifdef DO_REPEAT_PROFILING
+      for(unsigned z=0;z<10;++z)
+#endif
+      {
+        for(unsigned i=0;i<tc_vector.size();++i)
+        {
+          testcase& tc = tc_vector[i];
+          float result_avxf = g_compute_full_prob_float(&tc, 0);
+          double result = 0;
+          if (result_avxf < MIN_ACCEPTED) {
+            double result_avxd = g_compute_full_prob_double(&tc, 0);
+            result = log10(result_avxd) - log10(ldexp(1.0, 1020.0));
+            ++num_double_calls;
+          }
+          else
+            result = (double)(log10f(result_avxf) - log10f(ldexpf(1.f, 120.f)));
+#ifdef DUMP_COMPUTE_VALUES
+          g_load_time_initializer.debug_dump("return_values_vector.txt",to_string(result),true);
+#endif
+          results_vec[i] = result;
+        }
+      }
+#ifdef USE_PAPI
+      assert(PAPI_stop_counters(values, NUM_PAPI_COUNTERS) == PAPI_OK);
+#endif
+      vector_compute_time +=  diff_time(start_time);
+#ifdef USE_PAPI
+      for(unsigned k=0;k<NUM_PAPI_COUNTERS;++k)
+        accum_values[k] += values[k];
+#endif
+      num_testcases += tc_vector.size();
+      if(do_check)
+      {
+        get_time(&start_time);
+#pragma omp parallel for schedule(dynamic,chunk_size)
+        for(unsigned i=0;i<tc_vector.size();++i)
+        {
+          testcase& tc = tc_vector[i];
+          double baseline_result = compute_full_prob<double>(&tc);
+          baseline_result = log10(baseline_result) - log10(ldexp(1.0, 1020.0));
+          baseline_results_vec[i] = baseline_result;
+        }
+        baseline_compute_time += diff_time(start_time);
+        for(unsigned i=0;i<tc_vector.size();++i)
+        {
+          double baseline_result = baseline_results_vec[i];
+          double abs_error = fabs(baseline_result-results_vec[i]);
+          double rel_error = (baseline_result != 0) ? fabs(abs_error/baseline_result) : 0;
+          if(abs_error > 1e-5 && rel_error > 1e-5)
+          {
+            cout << std::scientific << baseline_result << " "<<results_vec[i]<<"\n";
+            all_ok = false;
+          }
+        }
+      }
+      for(unsigned i=0;i<tc_vector.size();++i)
+      {
+	delete tc_vector[i].rs;
+	delete tc_vector[i].hap;
+	delete tc_vector[i].q;
+	delete tc_vector[i].i;
+	delete tc_vector[i].d;
+	delete tc_vector[i].c;
+      }
+      results_vec.clear();
+      tc_vector.clear();
+    }
+    if(break_value < 0)
+      break;
+  }
+#ifdef DUMP_COMPUTE_VALUES
+  g_load_time_initializer.debug_close();
+#endif
+  if(all_ok)
+  {
+    cout << "All output values within acceptable error\n";
+    cout << "Baseline double precision compute time "<<baseline_compute_time*1e-9<<"\n";
+  }
+  cout << "Num testcase "<<num_testcases<< " num double invocations "<<num_double_calls<<"\n";
+  cout << "Vector compute time "<< vector_compute_time*1e-9 << "\n";
+#ifdef USE_PAPI
+  for(unsigned i=0;i<NUM_PAPI_COUNTERS;++i)
+    cout << eventnames[i] << " : "<<accum_values[i]<<"\n";
+#endif
+
+  if(use_old_read_testcase)
+    fclose(fptr);
+  else
+    ifptr.close();
+}
diff --git a/public/VectorPairHMM/src/main/c++/utils.h b/public/VectorPairHMM/src/main/c++/utils.h
new file mode 100644
index 000000000..ce9ecd8c9
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/utils.h
@@ -0,0 +1,75 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#ifndef PAIRHMM_UTIL_H
+#define PAIRHMM_UTIL_H
+
+#include "template.h"
+
+template<class T>
+std::string to_string(T obj)
+{
+  std::stringstream ss;
+  std::string ret_string;
+  ss.clear();
+  ss << std::scientific << obj;
+  ss >> ret_string;
+  ss.clear();
+  return ret_string;
+}
+void debug_dump(std::string filename, std::string s, bool to_append, bool add_newline=true);
+
+int read_mod_testcase(std::ifstream& fptr, testcase* tc, bool reformat=false);
+
+bool is_avx_supported();
+bool is_sse42_supported();
+extern float (*g_compute_full_prob_float)(testcase *tc, float *before_last_log);
+extern double (*g_compute_full_prob_double)(testcase *tc, double* before_last_log);
+void debug_dump(std::string filename, std::string s, bool to_append, bool add_newline);
+template<class NUMBER>
+NUMBER compute_full_prob(testcase *tc, NUMBER *before_last_log=0);
+double getCurrClk();
+void get_time(struct timespec* x);
+uint64_t diff_time(struct timespec& prev_time);
+
+//bit 0 is sse4.2, bit 1 is AVX
+enum ProcessorCapabilitiesEnum
+{
+  SSE41_CUSTOM_IDX=0,
+  SSE42_CUSTOM_IDX,
+  AVX_CUSTOM_IDX
+};
+#define ENABLE_ALL_HARDWARE_FEATURES 0xFFFFFFFFFFFFFFFFull
+uint64_t get_machine_capabilities();
+void initialize_function_pointers(uint64_t mask=ENABLE_ALL_HARDWARE_FEATURES);
+void do_compute(char* filename, bool use_old_read_testcase=true, unsigned chunk_size=10000, bool do_check=true);
+
+//#define DO_WARMUP
+//#define DO_REPEAT_PROFILING
+//#define DUMP_COMPUTE_VALUES 1
+#define BATCH_SIZE  10000
+#define RUN_HYBRID
+
+#endif
diff --git a/public/VectorPairHMM/src/main/c++/vector_defs.h b/public/VectorPairHMM/src/main/c++/vector_defs.h
new file mode 100644
index 000000000..2aca9565f
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/vector_defs.h
@@ -0,0 +1,55 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+#undef SIMD_ENGINE
+#undef SIMD_ENGINE_AVX
+#undef SIMD_ENGINE_SSE
+
+#define SIMD_ENGINE avx
+#define SIMD_ENGINE_AVX
+
+#include "define-float.h"
+#include "vector_function_prototypes.h"
+
+#include "define-double.h"
+#include "vector_function_prototypes.h"
+
+#undef  SIMD_ENGINE
+#undef  SIMD_ENGINE_AVX
+
+#define SIMD_ENGINE sse
+#define SIMD_ENGINE_SSE
+
+
+#include "define-sse-float.h"
+#include "vector_function_prototypes.h"
+
+#include "define-sse-double.h"
+#include "vector_function_prototypes.h"
+
+#undef SIMD_ENGINE
+#undef SIMD_ENGINE_AVX
+#undef SIMD_ENGINE_SSE
+
diff --git a/public/VectorPairHMM/src/main/c++/vector_function_prototypes.h b/public/VectorPairHMM/src/main/c++/vector_function_prototypes.h
new file mode 100644
index 000000000..c0fddc394
--- /dev/null
+++ b/public/VectorPairHMM/src/main/c++/vector_function_prototypes.h
@@ -0,0 +1,44 @@
+/*Copyright (c) 2012 The Broad Institute
+
+*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.
+*/
+
+
+inline void CONCAT(CONCAT(_vector_shift,SIMD_ENGINE), PRECISION) (UNION_TYPE &x, MAIN_TYPE shiftIn, MAIN_TYPE &shiftOut);
+inline void CONCAT(CONCAT(_vector_shift_last,SIMD_ENGINE), PRECISION) (UNION_TYPE &x, MAIN_TYPE shiftIn);
+inline void CONCAT(CONCAT(precompute_masks_,SIMD_ENGINE), PRECISION)(const testcase& tc, int COLS, int numMaskVecs, MASK_TYPE (*maskArr)[NUM_DISTINCT_CHARS]);
+inline void CONCAT(CONCAT(init_masks_for_row_,SIMD_ENGINE), PRECISION)(const testcase& tc, char* rsArr, MASK_TYPE* lastMaskShiftOut, int beginRowIndex, int numRowsToProcess);
+inline void CONCAT(CONCAT(update_masks_for_cols_,SIMD_ENGINE), PRECISION)(int maskIndex, MASK_VEC& currMaskVecLow, MASK_VEC& currMaskVecHigh, MASK_TYPE (*maskArr) [NUM_DISTINCT_CHARS], char* rsArr, MASK_TYPE* lastMaskShiftOut, MASK_TYPE maskBitCnt);
+inline void CONCAT(CONCAT(computeDistVec,SIMD_ENGINE), PRECISION) (MASK_VEC& currMaskVecLow, MASK_VEC& currMaskVecHigh, SIMD_TYPE& distm, SIMD_TYPE& _1_distm, SIMD_TYPE& distmChosen);
+template<class NUMBER> inline void CONCAT(CONCAT(initializeVectors,SIMD_ENGINE), PRECISION)(int ROWS, int COLS, NUMBER* shiftOutM, NUMBER *shiftOutX, NUMBER *shiftOutY, Context<NUMBER> ctx, testcase *tc,  SIMD_TYPE *p_MM, SIMD_TYPE *p_GAPM, SIMD_TYPE *p_MX, SIMD_TYPE *p_XX, SIMD_TYPE *p_MY, SIMD_TYPE *p_YY, SIMD_TYPE *distm1D);
+template<class NUMBER> inline void CONCAT(CONCAT(stripINITIALIZATION,SIMD_ENGINE), PRECISION)(
+    int stripIdx, Context<NUMBER> ctx, testcase *tc, SIMD_TYPE &pGAPM, SIMD_TYPE &pMM, SIMD_TYPE &pMX, SIMD_TYPE &pXX, SIMD_TYPE &pMY, SIMD_TYPE &pYY,
+    SIMD_TYPE &rs, UNION_TYPE &rsN, SIMD_TYPE &distm, SIMD_TYPE &_1_distm,  SIMD_TYPE *distm1D, SIMD_TYPE N_packed256, SIMD_TYPE *p_MM , SIMD_TYPE *p_GAPM , 
+    SIMD_TYPE *p_MX, SIMD_TYPE *p_XX , SIMD_TYPE *p_MY, SIMD_TYPE *p_YY, UNION_TYPE &M_t_2, UNION_TYPE &X_t_2, UNION_TYPE &M_t_1, UNION_TYPE &X_t_1, 
+    UNION_TYPE &Y_t_2, UNION_TYPE &Y_t_1, UNION_TYPE &M_t_1_y, NUMBER* shiftOutX, NUMBER* shiftOutM);
+inline SIMD_TYPE CONCAT(CONCAT(computeDISTM,SIMD_ENGINE), PRECISION)(int d, int COLS, testcase * tc, HAP_TYPE &hap, SIMD_TYPE rs, UNION_TYPE rsN, SIMD_TYPE N_packed256, 
+    SIMD_TYPE distm, SIMD_TYPE _1_distm);
+inline void CONCAT(CONCAT(computeMXY,SIMD_ENGINE), PRECISION)(UNION_TYPE &M_t, UNION_TYPE &X_t, UNION_TYPE &Y_t, UNION_TYPE &M_t_y, 
+    UNION_TYPE M_t_2, UNION_TYPE X_t_2, UNION_TYPE Y_t_2, UNION_TYPE M_t_1, UNION_TYPE X_t_1, UNION_TYPE M_t_1_y, UNION_TYPE Y_t_1, 
+    SIMD_TYPE pMM, SIMD_TYPE pGAPM, SIMD_TYPE pMX, SIMD_TYPE pXX, SIMD_TYPE pMY, SIMD_TYPE pYY, SIMD_TYPE distmSel);
+template<class NUMBER> NUMBER CONCAT(CONCAT(compute_full_prob_,SIMD_ENGINE), PRECISION) (testcase *tc, NUMBER *before_last_log = NULL);
+
diff --git a/public/sting-root/pom.xml b/public/sting-root/pom.xml
index 171eb7620..549a99ae6 100644
--- a/public/sting-root/pom.xml
+++ b/public/sting-root/pom.xml
@@ -335,7 +335,11 @@
                     <artifactId>maven-assembly-plugin</artifactId>
                     <version>2.4</version>
                 </plugin>
-
+                <plugin>
+                    <groupId>org.apache.maven.plugins</groupId>
+                    <artifactId>maven-enforcer-plugin</artifactId>
+                    <version>1.3.1</version>
+                </plugin>
                 <!--
                 surefire/failsafe configurations are global, even across poms
                 not directly aggregated, for example package-tests/pom.xml
diff --git a/public/sting-utils/src/main/resources/org/broadinstitute/sting/utils/pairhmm/libVectorLoglessPairHMM.so b/public/sting-utils/src/main/resources/org/broadinstitute/sting/utils/pairhmm/libVectorLoglessPairHMM.so
new file mode 100644
index 0000000000000000000000000000000000000000..2620557f0cf685ba9e238d5db4bded7d2d28aad2
GIT binary patch
literal 443803
zcmce<3t$x0*#<n2L?eQ`Dr&s4>Y~wDO$bOZAPFQo3lm5oC@PwSBuFqMX|jQ6sYVi%
zaakKJZLPI!YHdr^e$8jC#mi?mAXjezZ-`YR-ZtPRqC!L^|MQ%4W^*!Rz4Y(@k4|Qu
z=iJ_N&U@Z-o#m!{>yn{Eh8WJ3U|ehnv{EuT%Ask>VU8Cg$H+1c!{5`4lZD@;n9HFr
z52na)&eJe_!V}Y=OS^J!PdQ8Q&a?1j0S)iEk@7`_8w$j5U8l-;yH1tioM)#H-Y}eJ
zvI?DuC+}9}?tc1}Kj%rmyb9k9mh;{Bq|BxJ`LGnjaGp-MA0nJ`67hW7A6-u7I05&i
zGv*lE-u}4g=d15ouy_34`Jq3T=KZs|b_C-(9Qim$<>hJM86?$p2cG|ny9f9CxPOX!
zH2j{1=f83DT8{fG+`q!jwEquxHtuD(d9~yI6YlqLzlr-8l@?x&cX6-9T}q%`qm-ZF
zc#cr-zl8hOxQ_?E8PDywug9%lqXGVidm-+#R5;!J1jRi7a*OVu-cN?RA9qCIjd-4o
z`v`D8+<#C!ACKa`7`IbT<al}E?+rXZ5lH^ojmIbr4}~A+T8fvqaKEmIZafd-J_&vn
z;Q2D{X}F)l{Q~Z-xC6KgabJl06!?1*PhJnnN9^yBDxEqox8lx-xeR>yvx2>N{t)+3
zDjexca6iWvTz&E({+<CpnRxq5aTC;YKb~XNJ0B}?p9;S%8b_UbT;aWVK7;#caBt)3
z$Nds+1Nd`3)wM=F_u#o1_vvuw^$6}$a7PJnor(J--2cFRH|~Gpeh2q3_%FtjSGjx`
z$Kd&?dLM`94Y)7I{V&D+LOqiZ_8#?~iud2E_mOy?s@{*r^HufE$5psD;ZA{{=SgVS
zPW8S{J%5JhiSRcI&o0I7!}Ar~J8;j#oecN0aq}v`eJ0*J@H`FA1l*6|J%qamH_h;e
zc=Bq*{W0z@asL+g2HcBqJJ<bqxf*v3?&A>dMdffOo+seGOX2^o9^N<+pB#t(KD6gM
zcurM*k~F`^YVU_@?}NSmKqC*+-UoY~G6;DjxHA-gDW1Y85904E7dO|13C~g7Me2Df
zo>}VMd7Q3ZhT}QYA@Lle-mlTP6ubv<=W85at6X@F!au?DM3-AUm;;9^HOETzelDKB
zR`2O}nz$PjUZI}T@tmaIN8%Y)@6KbQdikA0;F*B?Hr!3P_3J2r`M8fzWIdjL#a)a0
zUd3I3=W*(NHlDZRZpA$rcLnbAaG#I+FStu^^ZGgNCAcrZeHrfcxZRfpVznag(;SE5
z{l~bU)wu8a`Wig?aF=NTeuVd3xSMg0SNwx`UW@y03OkSg!OL~HZ&Jh;c&<|Kx8RwJ
zyBc>I?!~xy9l*T}_Xh;(dO|&qcL+THj{7j!m>U&049`U1hw=2_*{1kBJUi99{;+j`
z_hS*}BRqfO;@vO-wOhDsAo~`K{~5-ShVN6!dzEt$j2`(M8dzRu%g69!$#*_3vE%=1
zG|Xe*-*|<!W*9m0VOW02`*zBB3Kd_KK>pBc7>w0m{Bjr-%G2gb_i!lWVE(g}Jl@M>
zf{vW4j~(3q#qhxRYd@AUIsOYyk-YDpQvMz#a*xVa`$Ux?<cHTtl-pqPgyYB=KArwi
z{y&rPM-pW`7sM%tCtz6UKcYJRi1co3gONHKRww5rY4!RPzfY8d0@~xMGX|Hl?j#w1
z69+c9BH}N`U@F}b4#;qI$%k?OX@ke}R}>57NgWFTaM6bH@}VQ4{9SiR?3D8}!zG{o
zjO2}@<nuW^M7~~@`GWe1>-Vbsn|h=mO{(1PRrTKLs`pgX59_!6k21WI?z5w1{DnIQ
z#(z5u>R|QQg@(*{nm!*GPZW@HHYqvRDt)-*Oqs9Ntx`@$|A~AuiUEHi&Y=7!5O^?o
zP7>udAPNDBk?zsxMY~Q^f~bPKA9_XkbEZjoe9GWYM|rbens&>$A}W{<13ICfU6L=6
z591#QKA1d1V9W;N&r;>k(;?GMSMm6Tf7lJjP^#wi(-DKm!+JZ$7;Z$nlt&d$RK=hE
z%E0*NBn=+V+i}Ws_$XDs%pfkN$18|Igs=}T{&}I#(vSXkE808#7rOLh81$2RGFR!F
zQd=V%FG8>Gm$5kM{vYare8i=<qvF_^r{k2{1{4?TF=wZYKSv4s${Ca=#i&h_?bK;s
zBcT`c->%wGy7J$0vf^uH`Q*q4Ba!hd|Aor`P?XzX`ruXd6>;f9yNbW{`GMtswz5mD
zFAn7Yt@zFt2J&A!`u4Kqo&0_Tdp?*v#|rtC(AuL}*;U`?nSxE+C2Q<XWe;;6lzRBc
zxiZj?oOYzjxefZqt1ph8n1{*wZGS}ibLzca^}nt4DqoPB*DTc6VDfh>dD=OF!qqPR
zB3-42&Lq-_|4n5lyXH#ynI5n65&2;8N0i+wQTpr?zA?U1@%UW!cAcun&N?YiMEUoi
zsZ*~?UQ+o|ym7kZYt=%MGV8`~<Mh{OsdNojy6?v+=X6o;=y&dx={lLbL*=XIGbxBu
zKED$B?+DlbOcL!2?fU6~{`a7s*-lGb^*9~H%l!8IRHoacqPj+<+vQ64Nm0MB!|Mi?
z&tKy7M;FA=+nI6f!{aDV%9;MD6r^1hN24mw+T~IoHk>2fe~yQ!FO}aMNgFd&IYboi
zQ~VD^x)?_(y-HX7WYxdtY?Xvl&i9U%@fYUFbW5Ngy#A^Dcd7bSYGI(*ApfD)@01<L
z;X)9uLY1%aamwx25P<n=>Jr|uFe0BHsd8womGX3<e0d#(e5qGSsK5VI{@Yx7xC(}p
z<=o>MuU-zh$ag7w-ljT$ai^<tzEcVwQSm>3`l5X<JR1q&a{7xqARhY>uWNjDTAXp?
zO@39*@5uPuWcG}^m3{E4cAX<q!P<yuN09TE(tnTge^wm5x+hM*GfCBNYxlr-UW+qs
z{2S6``9xghw&@I64hvoV)ZZa5%fWPw54)8<_^M^PUGibPpvFI~U&)O6RDL^D`P6!4
zMmy1-d3_c~f1X$UOZ!aeKceElERO%PVNV9rpH`J_*IP0IrFO>rIQ4kHGtPe{OA2^U
zhWl9ATccLucIj%|rp6CB4@kmkciB#U|1JF&s`~w<YIn7&owliX#;J6TaZ(SHpF)Ok
zm7`t;>o3BpU8K9(#j#4?T9v-}L@by$3ww+9_>m;K6#vUO{m}t6PBR{n@|P(8N5(1t
zp+e3h4X<mQFjLi|ccUsdRSr{?|MaIM@959p6P11{JKqJ&t5D_F-Jgz(Q;%P$_*-4$
zpYv4tr0<jQ<{T!U&*DjY<-1Gbh<q5gh;$Xu9=nkbwxhQDCE2Fj%Hx#h*%&{t9nDhh
zNaorw?m+wHJR;{r)gXQ=Bf3f1f3au{DqY2YjMA$TH4ZOS{8g}HgXu{o%5N}!IqVGO
zZ&&Tqz&MiEm7?6_yZ$#Ehaao#Kr0vDd8zuk4fQVON2Ad|c&UMJ20EC*<XIFa{<=8)
z6G)Eo7piuLS8=^^x~#`eH4bsw<7cXU{m@nZ$0++5c|*$YQ{vw0lku0h^gkL$o@a!f
z9BH`wwb5sDj`K;Mq52UiCDuXXjN9iZeK3Bn1Zk8ZmZ04+zfG#XoP2#M+O-pF|8rZM
z{$d@<iF)3)LHcb~^|dR`IOl(rzBPR?uznky`aNCAsp9b|`<Ct+hun|;pXug2Dbsb@
z^};ym&QtZ}`{Du_;47KVm3T0o&PSy@PP=#<`bEC!SJHdCG@r&>O8)lALxn?|lJj~|
zk0=K<j>?h2jM3oPPA%8`@i=AweQLbjuKX{;xR>?P^`Ml;S(mGfV<+$TN&gX-UX6oz
zls{d~Yn=LhM97n3l(_okE@!;=v=qegUl_*@EKqvx8-j#z)vEULhOz^`c~bs%)rsDr
z`te$qzWoCA$nt4Y`kW(TGmIpRH&_n7zsYzCVNZEIpyo}5+a&K3tYHjC{nCHQY{|DO
z`_PB_687+XrB`TIyp9$5mGAoB&rX-+R=8cp<CMd-%6@jK^6{xae~qJWQ{c|>?^-E6
zI`RBMjhEV8<E675y;62KN5y}$s+SU%{%0sV5K(%iyc<`l^6|YqQ2x|7{n|Au{z6y$
z+0YZp->&90O)@&;eH0_hx$}<$^R+5T@`b9Ob@IE~iH8OjSDW~27+0Wvgr2*~p+wpL
z!cOVmr~D_x(Zj1xr<{jg6XMiM8RQ(y|29?rt;3~0cPVu_5*ZPC^|4ID$ya@xc%E1J
zZF9{Br-N5bVSum`lwP&D^r~9P)AODxHz}5J?r5pc#(X8<g)+L`iG%0sO(jpOOP*y;
zJa?;jpqIQF5fAg*dcVX@e%Ctwy~sGO9AytTqA=;dU5yW$ge&%U<MdMovO~S<QSBlf
zddVvg$G$C4<HlCkI^MmCZ&Q4Uh{Z4_;7NHpUG2^TJ2P0lPf>QbbFnPvLKV-+uxFIh
zw_XxWs{9wAxCV>odiXyb^FGrx@5>eQFZ5Gtoa~h6^f>WMI#Z?_*(~Kz&A_<Y(FbK8
z(v>`6L^zl{U#WVmRqZiH<?C`4f7dfI{&p2l6UMQF#q;Rt)Hn1ODqp6G=idm&^6{>f
z@i_CTo_KZ!a<X2$pUMcFawrkyfN_`7&vX_4pU#l!E>ry!vLmj?uwKV_npAsiMR;D1
zBVS@(>FQ^X7wdb{kN!79&0o_0AX%q=y-1h&D*Qj0uN;-|6G9&j-H&@)m4nYEzfoL#
z?c$p1;`(4|U9h;=C|*!mT?w+Rv6Qc+Rh2hX7{$|;6wj)-wz580Q8%@!w7$Ng-YCAZ
zysB`?>|$eD>5|gon!0O?=hxMgmRDBS2P=aO!3xA!S$%DBL$I={zPPruvTotx#l@FZ
zlm%<*teR`9D(dSCL7D{x#fz#dFRcg`l$I^5tga}!z82|SIcDs&6~W@gk}EDNtu38j
zSydUVtf*gNTw7dLv$&Q?ENG~zDz2@onO|I9(=flPVo;|ARW+qSxZqJ<9IRYiQH&f0
zD@D%g{wvZ?mEu^H*Hu(iF0833XX(tC9lUUf$ZjAjSWzD=E3L1XT^g93UYwtwF}An>
zr3>LvTorY}{23Ea4b=@O^~Q|x#l_V%b&E^kh~h3qc?Aj)YW5feTs&(!URBu-Ok{R(
zV0LgU3p!Akkx{&8{`J9%+`78b>kCWsneJEw=kvn<DE$kIXJ@JOFJ$^ztR5C-VHW?^
z*H)BKoQw$;O1TJ3pudbWG8$^jONB<12J^>c4dP{XuryeoU)`{HF)C_dX>C<a5PC2L
zMOH8JAob=DH>;xh+TcQ#_Js1v1q*~gv-$<9Dz9j)U0_tzT$_=;;6E>|yo~%M14AED
zq0-Bo>ZO&{<!CAO4T~!bk-AJAp{tiJ#^2e&G3mv{!G(1-ON*<7@WmB%bv1Q`(?#+1
ztIW4nWxr4vV^p&$o{#c6RN3;zIO4l}e#g|tDa9F&r-*BD#p1;^OV~=G<E}UlDVdB3
zP<1LxQEhQ)RaH$H6*`VUhX&3>;PMI;t|Fi9fW@e_t#2);(%JcFG*nt))8@mBRl}eJ
z%NE8mkcZ}3S95)FX+vYcnxCGZkJeZ&IW)akGycY;SUUOnONxqTPjQl}s}L2f60U$|
zILV^e(8{G6%!gGH8B{vvD$wtkyk1G)r^x@4=ntus@lK^2BKx=4qi;~nZwZ-kh!A5T
z#DAkJx<qw)?C)x-|0_{Wt*WUP&1G=&IIgy?vO36q3|#{HOs91?-Nz!B?L}yNF*D>U
zX2(6&&a*0O>V+{FODjAz7H%Lf;}eYn#<{UF7;6vG+DdcsjY`ix<@;!xlJq|b;;!#S
z|DD?I@1{(r*FkrJ>ZqtHUQk+(AxOpI`U(~e3Zks0A^2ZWi2hW?XzG&6imLMZ-0E^Q
z1}Z46zfPoBRgXSBBcp6#X<c!!uCy{(A1KSup9L-xw!X5gxCVx+qI7Yftf)AD_PAo%
zjf}~vjCH;kB2||Kp~%IxHOy6Ay|kY-;}%pk)Gwr}6>~g?vEPEy$||618ykyj;je~c
zzu@)7OVYnrmh&p+H(WbyM&Qsf-t30?YM?Z$qO`n!uykqVl8WkB=_6c5Iy!nepex3>
zp>$yly3+4AQj0G|f6*7#Ro2w8)aQuN$<&IfDpY-O{gTBPQ`RgU^Iyugo?y-V*f19L
zi{Vmw9`a|3`~}MM$7J?bTp>oaG0*vxg{8AIit&Gb#<**XF;0@BUV8tpiwVifOAFZ>
zRhOzpHoLUCe11*iAR~2QaW&_`tf%HY$Vk~8gEW={*z%hEB^7no2Qfdmc1CFs`ht3r
zZ4|0I1~ZMi>ayDFA#p}}d5tqWC@h=5Xud2RO@jXFh^butH+cG{_L*^EWqon!lE&it
zhT7Vix?n{)3oRoHEW{cMxd!DkTzoo4M^hW>FtNH0bDN4F$I~?n%1fCa4zR|`re3+g
zY3qZS1YzSB)YMi~e~&<8=|3MfgZ892fIed;h{ZMK&d~0=q&yzE74e9?XTlm`lBK3Q
zm>b02iUTu?F9}%rETQqj7ZQs3q)GcOsrAP=UuM+lBg@f8mj4G6t8%s}POHjAd^J_|
z`TcK;V%%b5L7CHue@9Wri2zPt{+)8y-^07Ir5rNGA2RVpri+UEON9eu2n`X_>&q%D
zs)LmaD$7u~v7SGcqryvc8o^jIhmPl+a{V5ocoih>*v^U4-J_Q;Hc(_`*KxMMHUN3D
zf;HDwRAU9=yXpu0IYl?Sp0nNhe37r|v+Kv!BOX~DK;z12H3$dx_0o*Ym|c$+g=vGB
zT9(yRFDa@CR0jowTYo({)mrndjdMU-{zmWLwOM{+Bm<h|>>vgbY~`+z1PW;I;Y3k!
z5fozf_+k{nd@dbeY*B=UB2?@94ocL__B$2T;Em=RbJ|}Shtzz(lWW8r(+y2YCnz%u
zwLmu$-`2`PQ|f^-9mH~0*45|F!XlbzPv0-zn8;K>n$#I0y{R1A7v#<@wgNNqi>>?_
zmll~aekapqQm*g4vQ*|6Kv7N8X9pd5YX()B{7m#sO0dfDXsMX6U|wE^k)tE3BR6w^
z&IKw&HH*2c9HODtUsqYXv|cwu!V^nxQ0p{1SU0FlGUqfAYE+DMN--+#S7Wyp&p^`_
z#<a8!(yPUndMp(<?=dr?$~9ImF^8BAeeWViNY&{$21Tw>(Adc8*3@!L@i(tdz`$|Q
zA(LkRQ1jg{<o7V({ej#jdbXTBe7ly6<zzysiF=92(bVrDkrTu%PnlW_ay4(K&SDed
z!QK1W%Eh%+qK4~(Sit5as3KU7wcN!9mSNE+8TIvLrPWwMbd5T(gok3EAeU>=y_6XX
z>MGcAjTv)DPtB2HePF?0-E|z_<%4(bgZbu){CAHVzT?C_*a%}#k!NINOs&CuvN1S?
zi;m^_85b@pEvuPdSz3)5Tu~_&<3*D{)Z1b%y%p6I@WDyWAl?>yx7g?{er%XA1gB!+
zoH365Hzu^01jm<aOcpjkf|X?j6^rM?Z~rWz{F18DYX_C_TZ6==l4Ge68MSp4j#4bf
z1Yb-Y%4bcFjgc!W3v<VDB`v08^%a@LbrrQ-gAn7A{s^%%B9;i`j8UNa;srHz#avj1
zqUrG#mK83pWN$R)LbVPrlc)DG40whA%2^rXr&MASrv5st{;1ivkVgcEP|mz~K~~({
z)E|-?jG(oE-zK#l9?35HHmU0&^@W<$VyA~fFA|~kwBu9(Tf!ki)2IwuurA-<TCntA
zIcrRYCL*Xo3U@H=fKR<Vq;?D_Ppo);gBG~Le`|TtKZH$p342JH#@Xa?hAV?EarXC~
zS;e#FV=1em0z-3WX%T%fR@uMP_%I*-uoYHOg^jh0`d|P<R8V8No5-;~MgnAD7qD+2
zx7Laqsw;ogP{G0cc+p4dJ--^^Bhr{$Soklit5}Sw6J_eBt1&GWE22;i?BYyt^5G<d
z6%w@7`K48*)nyg)<AlXDYZi7)MNb`z`v2RK$UsS8uM}H~<=j8vcvaPaphS87|0>XU
zch#^4$Mj1DYmH^s*w!cO)2X`w71Cc%7>>lPD9xd=+Ns$10Wg9ZP%qHY3B`eOPNaj^
z3k@5nY#4oEuk~9>xL$N0|B1Hux0}qxrL{<(6{yxpzHw6IY7=T-7^*L}fwirK0lDq>
z_FdEYj_olEMTD*F`ft&|Osura)}S|NlyQGK43PIb)Xq1jENf;^la(>1ykT)|alKsm
z%*U>>TFP3qNGuBt9w?)n%iqQQOFsitvtI)T(7I`fvxA;4<E2RXsKomD^No1B=rc;O
z9nTg$sDxr7srqEGFFwZUC5dW@sw(F%mb=o<LM2GKN>WzafVc8Wv56};xX-uLGuOc2
z8JpP#95H;ZH<r{_i;b-X#sV0idh%j{5{?zsnA)m1(eH>A+_Hsr2I^lr2^q?2YO(!L
zTGdctVBR~W_%iH#1ZK_%6kOs+S&QM{LZr!&xd`GAZp@7h_^YnLDG<oPjXf0tNj6~n
zLq$Y?BBFux;H-19fJGpV7@VIgUmOBhMF)4BPT;7xc+9v99k#Bl_E1u7d<=A>Oy}3v
zoPVK#x4Ix-GZ2dylP#zy4K~!_FboE&gK;Ql?(OxD!{oT3xT0|oa^VD>%n~Dv;tHK~
zLdQ6%Mp|?ZG2V$v5&dzKs2$@9LSjG=5dA^0BeP(v=0W0t?pXsRU655=6_XPF5qu!*
zcP$qpirpqhXhm_)uec7&1OxcmL%r5wFzxbMk3<J}6ol@rW@&Zt4e7<?t4arWEq8|%
z#2{hG_lNCor;b|0+G}wml?RQqEG;djOV^fRA=FVPE%4&{{)Uc#s;xRZqL__Px21ob
zoQ6`8Y<0!b*u3RXe+4mr^=SW@-{7;*oeWy$p=pymByEtfWMWe&DT}kKixU}T3oB;x
zj2p_PELJS#ReXgttl$PDVwqo$O&uPQ165saTnc+MwRp_=W6mFETsn1Xapw8y#?-lU
zbEgD~GtSSH&U5F29xG4n4Z(3z`QK1uDBhf#T!MxYfXLB(;C~Lo_+%W?eW(f{!zHSa
zj&H^;T^!&2vG&IzeK`L5!|HMlWSvy|V`EB=+)hjb)710ngk!AzCE~C$E+XmP&pT4|
zrzL$6J2|Cnx&-oFhIFUp#CK>4PG0(59A;n`JtZj%(@2Co(!b*_nf}<ESo(bqF_J{6
z!(w5b6lEwUggoy_t{rDdc|O&LyWyltoD@CGxDe-=dC~nVoP~DW3(w-o-y~y-=6-}Y
z`>cmg(83QjK2+fu-wS`c4hO0ejcF=O@SHnwGJdErN5!{R{VpI#arN9KpAi@D{FvHi
z7w>&q`tNk{h3Y)=4j12gx-5q-7vFQ0<fCr>N0RSx@onn+>0TF~^C}L^;)<LoKg4kI
z72GTN9WK82eaZK@_(tVF`J{pIw0$Q1`&|4xpG!W~#ebmqbQk}b;<H@*SBlSZ@yYvS
z{HBW^srW({e~RKuT)cyuTzs4QeT6O;U#kv?=bSvS9BS3~F>NlsM19v{oHEeAPkm=u
z;^Mm$-{|6v&t<(wTzs4Qy$7HAT}r2ZYhRN7vs`@PIkMbx;_zl1zAz3yHx6Io;&YCd
z=`M`J*T&%+<M2%`K3#o(<D8p!%Hg~om99EZ@9<fQuXXWxif?rBMT&27@#TtN>Ef3u
zzSYIID*i4Pf6pgU&Ner%{6}2;GSwb8yZ9Exce?mhPJ4Ips}<kn;_p#>)WzSY_#PMk
zpyGR7{KJYjQU~gPMDfWkezW4eF1}OoDK378;(ac@OYx~LKC1Y17vH1!EEnIa_#78+
zd@Ae9bn(fGFLd!<#m{x|DT*&~@qWcGbn)qmuXXWF%1$=A_*IH;a`6*YJS$y%j^bNg
zys7xRTzsM8+g$uy#jkPkC5mr%@e38d*2UK<KH}mV6~EcVHz~f;#jjNS4i~>l@m(%{
zwc?{L{vO5mxcK`N-|ONZRJ?J{K>dGM@yRa!3B`L|{8Nfgaq-V6-sj?9RD7z7|F`1P
zUHm(W&vNk}C_cx<f2MfT#eb#vLKmN?#tCy>{BXsWxcHHZU+Cgf6kqG&Pf>iMi}xwM
z$;JB>ztY90D!$dlpQre{T>MzYx4HO<ieKa6^Az9i;w{Cmb@4@tkGS}Gir?(w%N5`0
z;%gPZ!^H;`-{s<$DL(4rTNK~p;#VoY*Tt_^ym9V8{l7=?$u9mr#d}@+gNjda@eeEB
z=i;AGe5#9oO7ZC~{u#w*x%d|qpX1{Ht$5SLM-^Y_;y+XTTo-RB`&{DUhbw-ei}xzN
z*2SkNzR|_|72o9I(-ptc#b+tL)y3y1{w^19D!$Fd7b<>@i=U_Xb{Ai+__Z#+O7RgF
zA5{Ei7r#vLoi2W*;&-_C)r#+O@%Jb`>f-NHe2<HNQ1QJk{$a%%uJ8Y!P<*nBe@gLQ
z7r$BYDK7pQ#rs@*r{Ysx{ELcDckw$EpXK5WXZ+*hM=IWQ@u`Y0bn!WgpX=iNYF^gl
z;+^@|N*C|UzgpeAnt$Ep;+^?dn~QhmUu#^vGyiIL@y<MJt&4Z&SrHfS%t!80^GD9c
z#)+A@{L>bPUlWIKkHfEx!$&lJx|Z(dIDBUuen%YMr{=lLSGyK}Y8*a24xbf=Z}Z9i
z;xJeIO`88bTDmLa@U3z9yW;TP)BDra<6o=!|D~30MB^!|b8U{pcgEp&#NoR%{scLt
z7fD3p@I7((-Z*@UT2ElqL$vsP8h^8sDLhl-@ab{*tT=p*#^0&MZ^q#Z<M4Ci@J$+z
zpDu`9E93C3arnF9@NF8ee#%3nu_g}R9*18Whd0#v2CF0-lO8|Ar14*Byf+S?5{Hjy
z{B|v#%^I(MDnht+#^HCw;oC>`w<GnF0V1BY8jqg}h+Pql$4?`~uFV>cpN@!Kof?my
zu8CbcH2#bji{E3`cq|9UuBgVVC1By!qw%RR--gkv@o5@wX!hznjZfD2i5l<K_$eBn
zqVY2{-ly@iH9l42OEf-R;}>dtiR!1QS2~}i`44LTb2R>XjW;#^MvX7j_?t9-uEyIM
zU!w81Y5YQsU#0Q28h?kzH){N9jc?NUUugVFjsKO#w`%-fHU2J*{~wKCqw#;&_;!u|
zKaF3j@lR=dMB_JT{AP`RTH`x4{&|hxq46(je3!<npQsY9QH_5?^WUTKT^ir3@o#Iq
zq4k^ZXneB9@7DMfjX$XI3pM@Jd7tLLPxGIu@k6!#D_!IHZwEM6trow|XKDVA)%@pZ
z{3#l5YP{OQ5lIwkyz@^3&>=^yi!ut27Ei76e>ix#qDbHPT_BC8n{zd3yt9@~x0M=?
zpWcaGtr~x1jK#m#qVf1is@T=0@!WHBt~DC3|E^NI#^WcWV%J)Y9~ol}{4T%j7nrBx
zHGZ?k<0pJ#SEt6~C&yyf4voi8aK)}JjmJ-0#jdEv<0s!@SC7W4pHLKTy&CU}`Nqo`
z{qmo#@yQyG?abKa)p!|FI;Cj*IWgbZ!_@e5H9l42_5LMY<A0#}&(iqwH9kk<FVJ{X
z<I^?1P~$T-ey+x=pTrWbB^p0o^S@BzvoyX|<M~@s&ef>#7da%JO&XuA@hdfcvc|V+
ze2&K7rSZ8M-=^_XHGYl8=V^Sq#^-DNT8+O%<0BexYW!x64`_U+#!u7u9U5<Ge3!--
zXna)TXKH+p#usXQug3pS<Bc=>^}k5tlQn*h#(OpXGL28s__-SI)A%bjK2_td()e_Z
zpQrIz8h?$(=V*Mf#+w>ns_}&yU#9VMHNHaQOEi9g#xK<PN{z48_(dAusPWfne3Qmk
zY5Yo!U##)18egsPcWHc$#<yvFt;Vm>_&SYm*Z6vkU#sy!jgM%2gT`;x_$3<OsqsrS
zeuu{2pz&QAzf9w!8sDVxJsQ7U<9ju}S>p|Vzy7yqe6q%`(0H%L-=gs;8h@+C`!qhJ
z@u?bryT+$${7*GLOXFKLK1bt!rtzl6|6Jn>HU1YGKUd@L*7y>Q|Fy<1)cAWezE<OZ
zqw$Rz|67f3()izL{7Q{))A&}6|GmcFrSbP_e4EDqLF3nG{CyhVuJM1=__Z4UCykG2
z{2Gnltnq)*_)d+#U*mUZ`~w=_rST7Hd{pDxHNHpV|5xLCHU1%uH%9mC|HB%etnvTQ
zc(2AkqVXvjzgFXY8vm%qr)vCT8lSH5k86CE#y_d?IU4^jjW;zuqVa_q-=XnyHGaLu
zmuUP(jbEton>4;w<F{yhqsBj{@l6`vsqrf{ew)U(YWxctf0xF;r15PU|FXuf(fC(1
zzFp&YX#84@e^uin8vk#N->mVkYka51zp3#%H2y7(@6z~P8Xwj8cQw98<KNTxUX6cW
z;|>19D!4d*iHbM*Ct2h7XuMbBKhpRVjsIBVeH#CX#;0ohry8HG@t<jYmd5YX_#BPj
zukohF_iB8h#($ylb2a{e#+PXP*BZZ2<8h=jcGYS;|9w*DYSeiCo2Jgyr1AW>TAgd9
z#viHitr|aE<L}aV=id%yTx}Y!|NFLUG~TPl)2{KyX#84@=fD5zToH{wPUAOg{P7y!
zsqy?bVx4P;#;bqQNH}$Ay!xl;1RvFS{`<ww)uZvwKLJ3uUXAC!9UHsUItKOMr}4=e
ze}=|;HQulBDH_jzE84ky8h@6?r)oU^ZC&Rwn?Fd7{`p8W#wo+`r=WbOVKzUNyuNST
z-up%yeWO3aU(cu<yb&*Cu<outT%&grGp6oNfp-ye38p(D@J`|c;&y?z6DJb43A~j!
ziMUnZb;O4eHwpY0F^j3YR^W$-lZi_NzMuFA;zEJ%B_2kcBk<kC$e7WcF7Tbi$fMEi
z6Zkgb5yW1BmlGdFYzTY<v4^<lAc)a*#9rbqffo@UP24H)eBxt>BLZJZd@OOhz_W-)
z61NFFjrcg?R)MDwA5YvQ@I}NY5Z4MkhB$?|MBsCYPb4lB_zdEch;sx!iTGsVbb*f{
zK84sP@G#<2iM;|3B|eSV5ct3!fJYJce9iptCH4__3A~&5bmC5dcM+dK91(aY@tMT!
z0&gew6SoPxm3TC9tHA4s**SDK3H%uG*~GO1KSZ2LTq5xO#ODwf3Vbi|xx_gF-%XrG
zoG$R4#OD$F1ip=!OFrFRftM4XPizQ$1MvmKJzt6XCr&5s5_l1D263mr^NGh0M+Cl-
zIFq<t;910DiQ5F8Mm&zVRp2Sa7ZNuKd=c?@;#z^n5N8pW2z)N_1mZ%0&mg{tI7i@<
zh_i{)1wMv&BC${4VZ@V&y#fy<zL?k$_yGRttc8<_d%hI)Pn<*CCGc+IT;fiFcM(q^
zjtIPycq(zbz}t!Qh}#6-N}NyJD)2huONg5UevJ51;#z?pA~uOj1iqg*KwK#By~NXq
za|FJdcsg;qz;_Z`#6E#<BjyrMw^!ih#50Hufo~w5N!)Wl)IV_{ahJf0h<`}jDe!#a
zS;P^6uOyyL+%E7e;v(WUfu|AAA#N3T3h`ycO#)v;d^vHgz+;H#5|;>kF7Xw_g#w>J
zd?j&?z$X!3MVv11F~swTeF6_7zM9x8@KEAwhz)@c{2sWNxaSK||HLK4T>|eWE+y_1
zco*?};)uXIiOY!F1>R0vPTVH&R^kfcR)N<MFCcCb_%Y&ZiE9OZh?pHvcZtCF6IT)!
z3Vbi|BH|o@?<T&EI9=d7iK~cx0^df=rJioDz{`oNi4B2oAg&?q=@s=)Tua;~@FL<L
z5qAnapSX@VBJh>O^~CK0&ms;Iw+TFrxPiD;;3>pQh?@kyh<GV+t-xc58;MH<K9~4<
z;zEJXAijY(N8po)e@vV%@G->8h<ySNBmN1oSKy(<Hxe5HA7}%<iMVIKsDI)n;x2)A
z6W>hSDex}h<-`$zcM>-fw+p<TxP`b);H|_fh+73-M|=x$lfaJ=-%4C7@I%BaiAw~&
zpV%fY6!>1^+lX@nzMD8ioG$R4#H)yX0^dd)CiV)vocMNPL*N^Te@fi5Pt-qgD{+^=
zi-_+a?i6@F@twpGfv+U~8F9P7vxrv{w+TFr_~*o}0#70S1#y$W7ZLxGxK`jX#CH*w
z2z)N_uZRl;K7;sf;v9ibBK|dTy1>T}-$U#Zco^|-h`j<2CH^h3A@G6U0soG;=W|j2
z#BIb~0`DgNJ#nYNyNK^4jtIPy_z%SG0&ge2kGM_Xt;ByMZWVYP@t=sB1b&S8&&0I?
zKSaESxJ2OliT^@eDDb_+_Y>y`d^hm}#OVUxN&FzOPvF~#|4Qr?cscR^5E}yDK>Ro2
zp3g-66Sot03A~8-e~CK<o=^M`aYW!NiT_UAF7Pbkhl$$+o<{r+;#PsD5I;iPB=AMV
z|0J#j##3AzubZKy*MB+MFjqu^L;E_#aJ|*J<}^*(@xW-qFzt79i||vsX7eQDF5uvB
zGdyY3ouiHDI<#&xeCqnv(S{Ws{V*Pg@2?1Bo%6QY@nwS9yl03xVMo2sGYY-6*&G>S
z+DT!!=k|?!3SO7v74CKKZcM7i>yWE*=WSWPz%z<XoBk)&B1&Tp1PGo4@7YSyqmcgP
zaM{w=#redR^-|*XPC(D7CWh~R0gaCy6wWQmos)Z6?&Y)Rm^XjWIK(hABlc?lX7~))
zUwi(xZGq?Gh-J6<BVg=R{v7z&*y0y6Uie!J)`Tl(JbY%UXF8sqbMpMPo^x9KP4L7g
z+cuwVcrNg~+~Q|thgwu5dH#i-R1qT2@AIUt@;AZNbB^Ut_oS{?VT=4Zp459p1fFx|
z`3ud^Y7vQP7x_!f(8GSFYucZip?joAX?x7I6K;Py3;!Qw?*Gv2I55=g_<FKwZ!^=L
zHM1@M!X+n|AtY^vM@G!>@E1(vk&)~<)!e_+3_l^GNhqQZ%kMK2UW$%E0cQ4@Yah5@
zT<4nmKNj(ptrEp%W^Xm^C;Xg)^T|1=X)p8F@=qff=F7A#e@eZ{q*KiBc{ygsy9uVf
z$6WDY&~I*P@jEkVGn8$v=nE!AfAT4ms(F1%!-r-_ME0QYV}|GXYxkU=8KJb05|M$(
z+(*f!1h2AM7+v%v^tv*zh%t>Z!W%7q^eBu-@-yE-%^m@-hGpO9@4>VA36UkkbBjO8
zFd$bKNM3<ZK0JNQB98!~8oKc4Yvp{?wAVu|SFeV`+aCu)1t8uqL*BkSdWX`n#UF)N
z_^5OFDAc@AGvH;W+e=D+ES=KJd2TPhelIj;h~)^km*jpgJK#mj3`Of}or_%L+M8Uw
z8D1?)r?0i=Fqsj~&NWYr>rhW613ihH9THRRKu;oXE>G*Vltji{?i&iq`Z6O;PpBFU
zB^~oK*1!QXG$~oUJ>f4zD$~Qm|7CjeHb03x7=a;X4pq{GL-a~0M1JNz)HxeD>ik{i
zCzNy%LbKZDf;B@U{s0?SVDGg;s{}JWocK<lV^^XT8d4BC(F99dFuiPK`}EMVlall7
zi5=7uk_^Hkv(P$ODt6IE1XISt^S9MPzJR?fl4?Pr7=j^LGzGS`F5QXSvgdWcM60H0
z2RC`2JRFk7VuFi_FadjBB!x*bqJUl1;fprz?d!|!+nC$;R9^POBA1@!=c4Pe5Tr+B
zwnem>nc;~y%?OR{onZ%ik<!D0oDm*-Fc7*dIS@L^gyl0RUfMRa{6yM}UIuSIkhJ7f
z6FHJ7QW&r=iG}axDIC-8H23ddY2GCQM3VU4hIda3Pqzj_mw3&z78!d-Z=#v4T$itB
z%R=4IFFdo~V@iaXTg;B=<R=jv)M^=XxX7CXtFY~Wxnld09F`UZ&Ie^5G!uG)M_6`Z
zmSyK<C7aC$dxFFG>gAslv#$evk`HFA?gcYEwm?K1zNF6)rTzl5<Gn<tEs7vvBXb~L
zn|r;%V<-U;Q<~C)yBB#%j`>j{n;l(=W`YW*N}zjFqG3!64L``ZrHxoE^u@H%L;f&U
zkjxC58Y{d6Da}9-suWw6r4%M$U+*ojb5Z}Rr5%JGuu)A9B_6QsxjxITO{Ju?k<&tB
z5196hbkn{jiyepL62GKYh=yh_G(!(c1GmAJFP7byW8$4!ll`DDlAh)7!-&Q#>ave$
zZAXNED$F32s2yq1JS6iuBsYugS=y3-jeZ}UQ08_tUpm8|G|Xn`)ai%;J<|rT1{&^G
zbIA0Z=rtIzWPS*BSWDV-3x`!KHtIUMfDZwV8;XGJ2`297JI0gR`KiY{VpHKz!*jt_
z&#nCE9z@b(ApX^ez@K`KUhQwgOSB$?Q#eTkI?wO*q^^rTBj}^0;=&ztbglHdN~qkY
zo_U);^<24SujlAhqTKd+ye;x2*K>5@2Ynk*P!!j*d=}cAlf&rj4_Q#hmEX>6s$375
zk{<mr%#mjDSbCPdD|1U<YcEU}E1JEUWq;z-nVI&q-YIvR9lO!le=(V@v~R0fw%ZDq
zFE#=l?<Am`^{iY0QKp6R&P<+`mUt!_P@>tl*(&QTunz{H-vulB8ZVj_N<35aVOJZE
zqQKBP#~v046&;q`_cO{6Xx`Wp=zG3#m?OcS=bSf&oMt2PK=V^kv+r5WPss7(WWlsw
z4`ja)#5m+97;>_+Z{33;Y2J_$$o{CI+qCadUA^k7&-j1^HX<`DsyB4%xp*<{Hy=Z3
z2)&Bl!4kFKR0aWqg6K_(VJ6J7)xz{e7b!A<WC$ai=v**X=sszzF$73Ql$jrrVVj`+
z6-A!?RxmG+_Ka58%^fG0`yuHI7~iTge>D)A=$F~)*bRC5HlQd{%<MgN?>P|`tavAw
zY}xNe+vowUO=zzuf!oR4{8S^7z51%$;@oR;ug;yf-n0|_)DcP({q@K20>D7gH@X?a
zM1OP+M>VP;K>0(*ty)FBVjF;B=J}JMl}T$0p!NLsUZa2N>FWcZ=m!nQ=r0f)Sm~|D
zo9K@=3(6~X`bn55LzMJhs5`pWzlKH|F^!L&fU4<E#OfwRXoJ@Q9RQcb%(c*cULG@T
zonulx%YzWc31en=nx0G7nF;Gm8#0;M>*~g8!Lq^Cok@F<j0s8u%oyKjPdA}WB26d*
zm_27}VMIKkW%Tzxx+}ayhodi~M=#A_FGFzzsrt3%T|JD}YbJEEuM^JweGli1j<DaY
z?_mW0-M&YNlpy*ZDV@{z5cT&x1?a4y+FmPrmFSf`Et`b!vOCP&5=i@EE%XN(veaXC
z9854fKALES^Dg#e_65-WTJ}bB+ehY#eM_zo<q@#gTM2IlkC_%4=`rn*htCKVd7!~X
zhohZ;*%KT&4cLpx$l+ePq|in7r<>59K35kJvY6pS*{OECm1HJtGs9+IAbWFthS~8J
zx>X1ZlGY&T_Xa{Ek3c#Z1tIGQq+?~sik6-_ojPFU2SPU{3yqO_XJ*SBdRpFQ?$Vt6
zN+WSdX7|a=ZZfxhj3&F}TIxibC@9%Q2kaNDgg1i6SfSyES@!VbEgC`O?s%1ND`Xvp
z(SvoomoCir@iN~Vk?-f3ZzWcEq?Yv#D?F{Q09l_B5Ls7ECZQvE25pTPQ@|=vkU%K$
zh-r4BClCrAkvz=~dQcF%#2`e7nXoPpx)_q1Fc85bqJ{6V1;SRapaS;soEasvDF*Dz
zpzjY01JZp5=5d%aKOGoqL~nnGt%24BldEVttWWpP*jhn#{}L~rQO<lB>jP+VBSx=;
zSqWvBq1<FMZKLWw%rZ2WPSF-uY+u%3+2#He^zD{iMKPYW>>$NBXxS6}0sEB#F^Ad@
z6&0P!^w8ME>7k;;<Xp^7(7W_I!^H=Z;~Useb~)Ftx9n~!gy^jh;<lhG$rkM`B}y7{
zD?5ZAVbF!4H`EbBr{<?pxrD&=hR~!hZW(QK-xHO~0CP|T=C84A5qg)!F>WH>&G2z^
zZf5=_9gnD@KN7{6G)6?*5wIh0A1B<$odzxwQ_@NK!ZFpfE0M#6-smJ5W(ksl7&6Qd
z8D_rVVqOur6@jnr9)=(bTDA3v<`3rP+Amq5Nox@zU_Y}l&u`+1@nO<wU<yKqTcHsn
z`DS05Y=+<z3D~(9pw~c#-GR^vR@(MJ*|Px*(F56A>rv*L1GJN&q&HV!R7U%{jzO(Z
z4uTKuev}1lZz)LI>S^J+RUmXJ2ICt{7=l1{2aGhj&w>?Of<epPioT^|_vC-kb_5c(
zWxj@yHmnZD+T%=2ixYZ-Xt$>zkMmMd_<a~)^A&Y5FBJ`Aqa0xG<p6tPgS0=F_F37R
zmmDVybi&7G^Vi-WD)8za+!#S4M`$8e!n0N==?n;uJe-V2fju+1KuC{)&^j{>x`zc0
z<aH!^z5^|+$;6cygC}>dg`luzmc7Ab_PDHvI9{Qb&|GgIZHMT&vtRWrPvqzdQ+Q-_
ztl9iUis$y7==3am6P8HA2*xobRxh%m_rDE=3E>S9-Oh;Yk3>n@I|Jc~D?wgQGVNuv
zdDmB_-IyFb2P%gFK=1-H?R7IeHNo80i-vQt87@kJ;f3JM2asAXQbXe&igL`{7tKc^
znXlzzz;?@fQs!*L3YA04%tO0MXCuoAgkYBT(`4q@JJl*gXvER*3A!M3m<c-``eAA=
z#*V1NfW1Kmu<VceS~<i=Bh?s|l>^^{bbiwrrpLm)Cl?8x#H0-QewC&h>c|nu4BJ1%
z3XT3r^Jrs+T{Q&NbDrNS>%!1A*UtNm5&aAqYFY+GMgi5rljX^Kw{N{Qq$DSM9+tY6
zXJBlA<~mm&_Qb{vfwXnd63?v@F<dCf-e%cP2RxVV3?%FfWbdpyMeFdhcPt%Yu6V8C
z7_;N;#LUQ^iRR;C)WLBF7>o|lt@uq8AiEWGIif~;#V86j3VY6h0bI=xym4gk5~{HW
z;{i4RShnY|0@m@-<Xq9A1QI@B@4oFId&;c*%+~_;_JV}Y;1LD(DVT=M^P-zLfHuHa
zfzbvw1)4d@JXrUF6(0E$(T>7(XamnJIf2UwfrRZ)2XAl~wXF`Vpsu$dGztyY%6{F`
z@-I<myEFF{q`i<UJ8*lfKM=kFx$A>2eLQhSxab5ATfSw#qI$J!gsNEV7wmNbh<D7)
zkUyos_8T)p<tfPpcDaGJ3OPr@45z?g7a3l<z)QKoRx2gmUl*a}&9TCXvgvlbmxQK~
z9thW>AKzPlmY5!+H72|qJO&+jCQ2H!hGm&(&dUx%JMK!H79NRt$Xn>NmtuJLk%@jG
zby|4huz-EQ)54E$tk67vYUVx*?F5554#S~kLBEfGk^|x3(Wo#C4+_Flk;mSIKu2`q
z%y3=`0WzHE4{VEKE|1KufUJnXbIUD=LN=A~*rR2`fdjj1_8jxrk(49;75jo-XzaO`
zeSSfx>Rc#CwOk-Lnh<rD$|p)>VRE4FDYJQ_kA)IwUgs;wej5dY#^_@+^yNW$(hn&o
zRP}h4lbJo%Uw@93u$5&6YbweLs&;+=gB|GI`7q#B8KSIaghw782u()kj!}g_Ie3cb
zriHpzz7aD(iGGojfPJ``us&d4ii{;4xC!Pbl=LYc1@`5Ro$P)=%+e>ln2T=zm;YvC
z`y$b^iu-Z}=%||C@&rc)_IIFx84Xo|{jUa^JG_C8?xBHjE>>eUFPm$^_(uYmQ#S8P
z5G`XHn#2-s?xw^hgfYy%2s(?p9<G}&nCiJHaV26%w6L1;iJ864)BHS=hu>D|7gK<3
zbv@mWfy~^#=MAWzl7)-G&2K{%bN_lNi@E<bEC74Wjy*$RJRwUbW!Z*yhk0-FTae{d
z69u~BwI$w7d7Rt|S<LM9N*2#eFh7U^Az!5|TRqKxK(d?igi(jw9bEG1>Asz^Y=JC}
z)xiWBV#4Zd#IY5~YuZm^egc!Q(}dMIQ}YL_Gm=*4L~3oakf7u3p?k*1jL&2k9~gFJ
zd}wGm1Bo_a=s`V&$r0TNEfXg-pfJbTf=;qEc%kfz<e-qe)*G=!$09rS^?{Kk?fnV6
zfeogZ|7=S13%Nq+X4*$)$A^%n3ajR^;E0x8zY$&bmZMw=SgIGI2oX6Y5Z&8|yAiL6
zp&aK^sb&ZRpR}kGqc0ZESP@Sio5gVp83JOYVm;?p(;klT+C@-oj97pB8dD>YG*v{q
zPFi0()lAr9+S6b=Ixx2Kimh^L?6M!5_Sa_fyFx=Y2o0$;_rH!+184|x70wshid`aT
ztC>dYt+W-3A4@!&5^oj7&=)bYH`IM1loh)AH-tyH-F16~uKo)ZzA2Ggq)-o`s-JW}
z01m49rn9Yt@f!AyE;H?y3b0~sKV#Zoa(Sf%%?pF2cRVd8;>8SMcLTNl5k`)Gz8ELq
z!Xxg%1KlbeS42E5{FOko*=v@uOqEYt`mDnvU^5QQ{|f2<eBFPA^gl)T=a5bhFir;e
z`o~%Vc{0G!G61ws5AZH>4T+x71B{XZx+YPg9B73efLqOG=m)=+0W2FshvN>wCo=mt
zKJ0v-9v~QiMpVOdpc!><Pf2Y^zCv{RSmy|x`mRbgJnm_P75ZV>ebJYp+$^8wr;?@L
z?)%;Z6P`3@G7}oN7oH!RLP5eK#!N)OIj;)mgF^6eFVOj7>3l4mFO<%*PR2b<=WOZx
zSvH(ckj|D2{c}2JN#~d7+`B_W{yBK0y@bx=r1K+mepNdERyto!=P}axmvnwiIxmGB
z2%Sae3#4-+oqsKz^Q7~MbUt4?UqR<(aOO6qDf)(BQukFL)-Py{;pr}%E%CtlMZkWM
z&DRXr&$CA@6dL;zp|LZ)+SXyHIGJV^Yg}Rn@e3|0TG_iix0b*!<_S6fmqXcLwJ;XV
zyPy|u=V91hbOA;#Md$SdLe>RQ7@6~;fzZ4Qx-bnmugh%y(ATh?HpSEvf)IhwT(tLB
z&9vvRG>9|<_Dg||uf@8WmDXL5{ekC}x0qUNXLDxQ{|>xP3lFE#VkJk4nT7`>g}R`(
zV%r<J9Rurx=<nI<p_4A835-ReZ;!%WT(^5IM}el9@H%5qVFRH+@{DleTUc99j$R?+
zDe@Oi3n%VEf8=SIibh5op7XC9%3)8-0h)-?urBH~L-Qu0H0E8@1JgDUrBQWJ6jDq?
zX#_7qX?%>*Fq_wzh^XQ5?k^C&Anjet?g|!h8lRK9Rz^8H2a7C;z0>TXgx+Z(E3s#q
zZ6)+f3k4ISSQki$P75td?3!jTOXvzTM@5wDO|0xTJSIz;*%sv+%QrT}-hoAbI)Euk
zz>ZpJ8w2}c#}5p}U}|yzQ!1y}76}`TBAFh}`w*r920vW10r|~CNpg~%y&;${WL3E@
zMDB~2`=Tu5-eT^pEaZM3b3ZRDmiw$&?jy+khK9#o<9{nOK9Gj~IJS{Zt=J<p@lm<A
zeLKdy*ws$MK<Zg5`z_C{e_%zVy=2*M1+rg6Zw-g7?A}M4Yhxj@H!nRNy(?D`3L8$w
zlq!767WB^vd(JRp(F#Y$0eTR9Nf@9F1-j-0<i<Mc3TlcXdkL)wJ=}Ioot`z81Wfxp
ze;_n7C-+fDDW-=k4{FdF);m2E^q>ZV!+Nk==s^uG8y1}z%JX#1u=9qY2D=@lKn*@l
zVFt7niv|C&srvLlr~!F??vMsEJzRwS5Gwu}nlqu){bfmoC`fqM!a`1e)w4md`e%g8
z-!-5ESfsXWzuyX<w;f~m522ez^ePb<CWq6*i64kTsqD;;if(&>$-qUdL9zXu%Q?7d
zU+Hz#EDX0b9>&bGoyM$*@tSroj%;9|#=#hpBk2C_A0t-UH?BX~G%)@YEWU=a%up><
z?_jXPOxv$7$#2AxJVrP?@Nf{S@iNEenAE(;)hH-BR--Uu!e)n9IK!sH$%sF|Rr-x7
zFfn!SQ?JFW0Ap!R6GLM$I>{2l733nddk<vh3#1i-JMudA_-VL9-U0U3<Q4(!ZMtbc
zYa)FN7SR&?S)P`pn9YqHtKj5FRHtThG2-;xDh?Th3Xq9s%+MUeO4}9a_zF8V?|4=u
zVnUA5dB;16*vYmMU|Wz0jAfYl)Zl1BOmZSYtO}z}Qq52u$`<9<ybe_p@xo_Amx<LD
zlgn#<KX*Aq5bdxB%<(G$`@=v-pR&kbSlM5CZsEbF0F*I&%2jMcmc83b`_i<da*mz-
zwWp<uS;QPB$FyI@N>Q*pfL<k#HVP{*i6{um9%I>cm~qv4JuCPl%bciNHjKt$X2K4W
zJIVGnSP>qDwuB0QHRxm{+q5xZpNfze^KgbBGV&@i!WGZvO)1D-3f3hp2(jYFSO(}8
z3;0k2Zy@bWPs>J(9w{Z{!czB#!Ry3S&`K-E;-xHC%Wl93x&bLPK(@2spCt_0L<wVc
z<q|k8!1zgwl#5Wr*;`}cO%URtbqVo0lz3aEc--YO`<_;E6*1S%Pnr7K2ec3>4wYej
zu=u<vVi;D`5sJA0BFE~+O8XR}W$XyD+PEFXdVC3%QEf?e-*{f2c|#N$9>uPnW$%mb
ze-S#|_bhUK)4SAnlp_*h{D?b{@NX;o?cnif{AM_aU9>Im%}p$@4ZA5*3R;7wWg3b!
z`ug*tH4G5lP893ODbX%8t?pZ}u100Tup+h;g9%d+tC^Pd#~7c`YM>agjMbgQ$rfWk
zI;fe0QI20sEHFj4zrq)8=D?#j`ZMs++nGFkM_0gcj~%_8eptiZI~fnl5B&~GQZ)Xw
zH(7qnYeDwASR%X%`9nv>#RX5xBvyirwg(9RpL0#162lf4jkHtzF=f5bvX`Jvmp~zY
zO|#`FYrY}0H6P2c!(sL@Wrs3g5z`w}h!aga#SC4K1R9~Q0~7+GP`+4JfC+lnv*LOb
zl$0H^zzm^oU=-j4lY0~TWo-Xk4vBw+EXFFyPcw!{;HzPG_hrm|e|a++6NP@cQ|O0@
zvLp)|m(@Lq393Rz-Va7MzDx;F=vRxESfQVWaM2T=lfI)~ICdY6q@u^u8&m1Nj8SPR
z(}ZSsExlZ}ocE)vM1){vbw7kp0-TgZbz8z6DZl*^Tu^~RFOsA8fsg*~S?N3a3pjTF
z@@r7{&>L&FJ9R*wX$K)tDiY_@$3H1c&ve8{63I|Aq>dCoo;gN$2NnUM0g*EL4!vJ_
zRGxaff7pQD1>=k7V3Rzz?&a!j+RFhP`O1F5@?5&tO4w^<@2&HgYn^~rcF&SwfhQd(
zroFK?Y^FW$3}4mOJ)3;NihZ6H^AUA^=7%_@#%?2=I4cldMy*}u_XTfauLdK>xivNj
zFsCjzMGx`3>>&=oTysy~vd^~cYoWK-LT~>p4B7iIWL;K5FYPQliW|K_*cn(`b`w@;
zsAXfUHw{5dS2saFw61+mH{8OMQF2&ngW)$rr})MGOcr~FmJ4ZLu^^IyW&&|(9%Tnm
zA=dTNaGvICbO0Y(_8FEv9|_HeY`<q`(eW;26CFTQb^z7r04|UnKzHzTis%u?2G|4S
zBPe?StN@4}pu6GCfjt0bEMIz7+#qzE?ULeBR@&_>oI(s>7!2VTqGd8STxj)*K8u!4
zE7~$MG##BUiuPD5ZP1c^o1G!Hn*ZOF?0VP%ly3Ix4b4(gNZ=FFg~(E%l;Bj8Cp=?A
zhUN_z^nAz;TJ+9ePqxy&jvb-AXe$ReShQRZ<M6&5;2{4n;;#iq&;p+b52{dbXae(s
zC6=8U2+w;KwN{8inTvuQ*g0wK8^T%Hy*ODD%X(jQ4Tnf*R}dR5kfnwq>)y@wsf-M@
zHCigXp{e(7lm6iiEj9Wm_~^r1r0?hh!jbl0ykN<ef=?9fHhMldp2xJ`h&Ce>Ha0AK
zuXL(^8nIM6u~ay*oTp?<kM8Ycszo#b?482HXYoX;$TwOThR)%!d!j#p_dRQ(7cw|2
zqI<~zD}$L0H72_BQYtM5<<SR4LPE`um+tYfQBJ0z{|BR0jvxtmq3FnRa&#j=v|}^=
zJOio3P__GN1|3k+u%x|9e<&5KFFHlUq)anPS(&hNG>a;V`GCkL3h)l`qN*i1I*Vx*
zFwMDi(Cw7x*8MPq)58;&U|%jFx&!XmJQ6)A%@BL*?wT(VC_Jep4deJrH*y@`!iF9j
zzsDQTKd{Le&qJLL1~0Jea*oTtvN&C`Kkq+2vm73s9!+feqUS!(4^>RT(A$WucU&do
z!+2Yq=H}2odmp-U8srdG@i7z)oo1%t80p10#)ys0SGci>u{9R_)_HC{9sUYJGq4S^
z*-G2Qjf6mU#B*y1qk#Yx_IPdt>vXrjPh*z-<&q;!oGeXy!OA{xBgB8xbIbF{vT5%`
zw1MnbJgXvv;d(67a<KXw{cq(Y1pbdRvp@0N!Ve$Jv`+%r`#r1p5eK*E(3Y{Mgjr3(
zMzyQ6tv3^E7Br8MC6_V_IOu35Y~apeXzWQ`v$n@xgqi(Guzh(Kp<t|&cn;wr3>Jz`
z;yHwiIQqqSbaUNvmO6J42<KoKJGum;Tb`T9OX&&V++z>MDk;6#^vS}y&Bfh)!tljJ
z+CD%eOq1h?bRySD?XeRe(uovl0!2EJB2A!3CsL#d5UB$qbqbN@pn#3<BogNjLS)np
zHg-I>-^Gy{>f)FJ>^9jj#5fVbD%pPHC{ZP^A!gyUQ#zq$wtH4>U}1-^Q#JFfs+pG<
z3^mj3x#d23Nb3${@Aj;^3-4Gvx6mthd^j1qBN*~;z_FQay=v#L<BP=1?T}{4r52`i
z^pntSZu{B_C9-xbI}x>0#M&uh?aX8C%wz48vv$gz+If~mA&-Ux!n3doxK&N4xD$x*
zsG*{ZP(#*9s3EK+b@Q{KL*?2&P_8Y5%Ec;zT&SWVR#6eFXdbI*9;>LFRaEX&(Mv)u
zRYgKBYR%v>iAEMW4a&o2#7!-<FtKNfeG+t~e-g#ICv&?vG+>4cuvhs7)@`~cV)T8E
zhX<(+!g79YZu<~}fhA^vz16}&ARMTjc;YmB;t@inuq<)}#>m{HgmpjBiv^P-Aa&k}
zDRjYDWS!KlmvH7LJW&X4_B{{#Qhypx7Kp93R~YBWQ2~481oZr)U~{Yq_=Dr_7qgk~
zIb5~(Kmv^2jmSxlnvY>&8VAm%!x_d;b??YpY+!$^X=9LzPEHJ!oQde`nCXc#eUGi{
z>npI&!brU!;r#;47x(<ed<=sTULM$>r6;I_xzN2By_VROzj)8Dq7ih=j#=e&1S#zA
zz7Emp>%CXG@N|XU_ScP__)eDo2dq~#iqkq+^2@bfL2LFGV)q9<T?r2bEW{B3oJd)y
z&hT<-H&>n-U{_`eFRpU~JbJ`aJOkXGasoXpKZIe_GMwq0Q((Brz;O7;qCec`fo>Si
zmE_|v6vUW|^Y?y848;oi)1QPtG@B}a>XMvHEc{^`t*;~ZwuxhNv!BmhIWZkg!tc$y
z%^GLquN*#x!-tf-+fK>MTY1WOdiLeqHZh(4?C0vRKQ$twY&5bm5u@cie@W)PKI{?8
zV;F$gVyD!UOq_1w(F;s~`(=*61^tC^bi45YhH38})Q#nb!xV$Kq0lk-9@L>wu<Wnr
z%CxxQg&wp~TWL`1SC^qLU%LdSo_-u*zdr6kykjFLe;yv8Nr%mcOKAsOLP_iJzR@tQ
zaF*+2x3B5X%^&dR7_d)QU_S!|!pAiwz>xkutLzgqyjnmLr@->;^?j`oEM1v)i$9fN
zKyqahCD=x&{PufFALwb#A)drAC215y#F@naHV<*I&6~OJu@v~kDV>x+XetIpEq;^O
z-dqs+q0cPC8dQsau82A(%fi9WLcW8`5zl-4S$IYt`d44yTJ%MR`569iL)OUiq$V9Z
zdMIMT7-oT|I+7V#kmsrGG!|H%>aA$UpXPer<ELa>ay_Y$1)h0Z7vy@b*&MwUWjqDn
ziM`_uG(R<TLB8kU*1*kQH6g~jXL(TfeZM-W%O$DgXzx?8)4DjK>!mR7V$>rJ>@s7y
zO?^Z7^^_0qygVy%Al-`BJh#69WWON}t8{!cDnD~e!l&B~;;>3BQc3iOry`DXH}eQG
z%Y$cGZ~#(d9_J8QAbUO6bXcLIr-l=cFv}vjeI0q(&lT8->#Wd8c&xWVllStF`zH7)
zu=CcTO97v^9#7$rw<)<UGBsRu#E|fmzU&=KF7107i6G7ONPjpEA76vSoubEgI!KYH
z#3_u4o$9jfFg`E$S|JZ2-G=9}OwHQfD>Ae;9hnO>9~^Sy75v<Vb%n_J<%6hP#KZXb
zH3M^kWf_>VAz09P0Rx?}FF=5Vy;D3_<RxQR5=lo{;;_oZ?dVAY*)Lo6;me+5)UvnF
zeVj>oZePlQM_G%%o$_J0%BmWBrmB7`Y!0E~QdjtihR_{Vviy!hX3ohhzP4i|5Hgki
z(dT79=Lvs}WGq|8G1K#8`MG`hw*^n?%e!sau)h3@_CsE;^^UjUC?tH``ZI>2dgg80
zb8K$Y!5P61pae65?|D+Up;S9(gvwv)oe>JYf<MbTdr@rOc`x?vor+RV0Jy?>h1}eE
zFO$1sUPAJWkiT=UXYQ+eJy+~xA)oRhLU%IsOCnf#f|sF-5>go4|1$rMe1*wCh`GBM
z#E&2oL5=OC&tQU&kE(=JdJQ5WJgShaXYS|pJ@yrL+SxCARvn9eklzHb-~uTA=Jn|X
z<lpB^3nPBf24a?BwJNapl)*E&yg1NoD5JMp6megx%f}i~-j2PbqcDm$KeZ4J1MFf8
zY9ltE8DQTiD(o8;;tT9&Vc%GnsJQnEc;1d*xA03kehw(inb;C{q@lS(e;;$ghbp=g
ztqz-U%pKd8Zg*-7j)$QK5@s!W;^TuFrrUhf%m@7`@IHub+7QP!?Llm?O^F|1&Db$b
zUpFCtb<a`Xix8{$hQNYOGwSG-FlNFO8AR54eoYsFsaf%wV3WbpIC=5p<++{a6GoSf
zg;}BbVU`O#PmV-aeCm93IZSEyD9XQcT4?x-u-aLmM!W(FjbL8li}-tVUNTmHW@Sys
zh8jkVJLw6VYsqt`-ZnC8<+j}060?SGZhGscKwrf3$d-c8m55^A@MlcVlUpr&JCyTi
z>qw+G3-kYx&rG+AhULJi6CK=JSFz7C!6&|mk6Df=#7U-fD|@|X`4v!Act~ca$ZqOt
z2>20gCi5W`(&+oy0EJsE@`gqCL-my%qJ2Q;Z+?oJH9!fS`7}Pdo`abN&dESJ`-P?~
zd<=Iz?NKNx0}Q5%p%JMRyewxphO1a;PPuUmw!Kh%@AFLSX{P;r^a3m=Ab=q<IO2;d
zm3R2X0ufe9mu=&a)f+ur`r8rnFydLfA`KC-@6d=}{-=oe&kPV6(H0ALy>DQ||0Dg~
z6!S15s70K5Xv9B}0cOaEFO7w}K6PNkbELnsVjf1EtVNuDXvBUQ;PWel#2@j&k_%m*
zu1A~{{pt~svuB0BMzIf=6dnJhAlH)Q0VPaBH`;R(`_|i645wye7X=Gz_M+sz4R*CR
z+9=}qfi1k}r|{r-(lRH-6_Fbk0#^a!ICWVg&M{%hC0_(N?lKYNWivDlE0Kxa=%CAP
z^rDV##FqlcO%RT+2*=P^?E9Ru5vTCXvYW8hziAo1Jx)4-KKeF@oMlIs{Sim>A=swq
z`~RT)Kj@uH`SX23pgjaqd4xc(0c!$1EP@=jK?I>dzC#6CBOED^56cvT33Lm63?k5F
zQlM)^1o^2#peqS9fu;d#0-Y%Z8Y_ZOAdKtWC3J#tq(G^01p55)!3EmzuqdII>1^kx
z3xT!}XaYS7tO<0d2y)yXL=Xyu-Cnmqw+KfHgcaC9OQ@Va^b!hB#ID@?iP20MeV&M6
zN)|RYn;VB4H(s5&C3Aabq!nkU&Y=^=GFS}_*gFDPltK?1x(;5gB-phZ`EvM<0$4Uo
zeTQ_>BH|?>>iFq#{PY%-nZpCw+m_uA9eUxi(MDg=q(vO`4}oc#C&&Gnk%8m??zdqx
zwBJ|gp8CW<obdMnnEfe#dcnud2>UCX^~uC&?<0Kh;_quU#hhRR=0avT(Vx4P)2Vzc
z`e*K2mk><3Z5T4vvL!fjWis?Vw{LUsWbh5qXgV4V);@y6$7~T!0i2%L#~8&q2AntE
z-Pc-(sO1-e>_5F{qbuDKUHTAe`{t)8%hlqGy9KSB4{ff*tmit&jrq_Mc<1*YGw}#b
z+E>J)ek!@U0JS2HEp(SXIv{`D^#k*tTNE9Fp7k-<cMMbCX^B{#{9Vx*P-4vL%;v2_
z74sFMk<1XuU@rk>-a1<x_x9Y|(S1tuTSM&4SE2Zu5SP<GIPN#U#eb8#qkE+Ek~5fl
zGTe`Kx#N6AiX2o#&p~PIH9hBIX`2szBzVn;uTnVNoQrRy<@)P@@ld0zM0WFCoFU=j
z#4Fi;+WtH`4SCG*Jn|uiB8BjWo%U3*YdP*OsaQIm$fC!fhvE30w+QcP$sU2<qCmaj
zFd^c3jE8EY9W>d5(Zf-aEjT@y3tyf`URyL|E{c>#3GVZ=4n2A6v0;WUIDylF`Ak*M
zMx=u;OL+hjscyytiBc|u-<~}z<p@9FPlrqN&33H*pP)V-<4Sw@Vd-!Qq{cUK7`ZTB
z%(PbhWjNBo*Jn)6vtkB9TlN?IXO}p@6{_BUvI84QPsR=<b@XAsaj%)MAD^WU@hsnU
zI7%b!6{)Dr2ZrD%6C80mb#Gm&ew3+a>4{hvYB&w6XyK9gGzW)WF@0T$)Nz`rKlboM
zxV;ZId`ioF9S$Yq=Slmu(^Ult`vdaeOaKRG0{DI<Ja)SkKIM}FY_}Ad_}0G(L31C=
zVdY}TQwtQZc`R-9NK~YO5!A6bnfCBVp8&yQduD`MMnY?hnRec>(HWstBe|<K)3%Pq
z0jJ%*hK&U{&Z8Yjk_FU%7zqOw=O`NViiz{0AZ>WJaL~%adn?{?HtAWqMgN7?D1Q0?
zmCzq`LE7^cb_L|=zyP*aaf+QYGzR4dcQU$>hz>s@Afj8=VX~~4CZB6$8ZU`7t`c@w
z`sC1+j{UJrgl)%g7U^3~1Q=1B>PQ{^>;ItSoiyQ7B!SXoweX`z<j4t3&0=j*qxMu`
z6E`@UlVz5>IB19C{y88fvhcBzKN(vCt0(#dD4GmgzG@;19~OQxEd0Y0S@;1vIJrw4
zIo#;zE)L3I`AF(91rw>KX__0@|8c;689IT3fqjz;()I^#K1j3aS@9bPh8=2tJ|?Oq
zO9+g^o2&e$cwOahN20_L^<0amr{!*rTb-S)QM4L4@Xrf-<epoX!bC4k<2;zTK?)6L
z(GT;<3#TqW=aW{09`>B$yosU*<LEkFqbGAD1+Su*nhy^5+<pgaFujt2>WIkrxed0+
zp8G4S2Xj#&e-D4Nq9dB%cy><QF*+6}+S~?861^1Wz)E;nkcbJj#JE|U%ox_X(ezgN
zSsnN_jUIfP#Y1QaEw%Otnm~l1JChQLujmVe6LHW(eAv14LHbC<j<u?&G^t}0M5NH)
zjP`#_Q^VxNLIRSfU@Qq@){Cl5d@(ec60(Xc9Cbh_*3O>cdVQEUhn3cW4YLHYQMmI$
zE!7`|YWRfdi$Et^X+0*arictXu;Eq0v*_Q*cOqo;_adK4@_vaS163UdHV!!i;b~dQ
z@(U%MUohIhuaoS{+&3dU5&dIdAAX!c{Io;MG2*8kmKO789exbZ|FaGY5jJ`cnydI(
z2O|8e0~TQL!e4gSD_lU72p9Zl16`u8$pEVqEq~l$&mssh0YV^YtoVB6%og4`QT^g*
z=d=2m|LaVJrBjPPnNemTN>A!$_{C?%!UaDSkwTZ#-~w7AoI;de*RPT)5Gx{1c87n$
z%J(4<e#wQE#WLd&m4SyHv-f(IKZAvnZX8`_zZ5?03yz6!jARb>h0)b*W*r9WF<iXC
z!Wf1}oX15`Y|%{Wn1D&g0{Vr@t@1a*KgK;DLf=h$IM%#3y@^fOj_%3-PTcxBel!Hm
zB46_5ille&61{W{<HDDd<Nk3f;Eo5-jp8f8QxA_NX`{@d5%BP4e-yoiW>ExaqQjr1
z1IB~VXM|XcY7wIf3l|DqPmebOS~#H!38y1rh!*JhU@~Hw^6$i5gNc_<@z(s=N$q&X
zIRTNx1_2%xa~E<IeTbd^Ff+^n$IA?%%3tp4yu&OCx1E#_zuAEL&}Qyzxzv2tSaf{M
z^It`=!qVIaRlyLmlJX=YcC0ogF1rGoPMpc3MX=bLyT0Pu6m8R3tRkO~w+%Z$!EIjg
z$_-v@VRzQ;3S@8eG+**1CB#Yu0%9~^4__y~$l6%<S$7(o@GayHN2GS<F7IzlUmBa}
zc!2I1T-*px`umZPXvv?XYbU+_h0-JQLgO%~f%5%7ynPQ`RM(Y1$dF)#%$o!aHd-Mi
zT~f`KRPCCe38O<YlMIG57@#4kSrVJHM5&_H1Qi8Zp5tU`SGKm5joA&m_Oo$Ix00Gv
z5(eifn#6#niAoYtj6OsoYE)2>-}ig&n*o&my8HS4KI=#3zW46A=l(nQ+;h)8_gvPB
zMv#zZ!c+?TB^{o|EaxLpC$N`_R_z7`%oRM#=bm_VF!X6<-%7#fV-Eg`z4o6r0GQ((
z*6deP+0b$3OVaczOMXsKpP#wrGwhZKoq5e?E|&56JJ)=s1tUIBxaKoVOZl1o5vrwh
z28Y@}J;Nd#N20RUf~l8%^(@g2ty6;+?ZtKmLeAmo!~p)wCPW7R&gMmDP2*>n#G+e2
zHh+PSlq7R7P&<EceozNIC$rN3jB)-HEjjtZ!+skTg*(k?AUEsK&BD1f<SR-%vafsN
z(BajfOS4Mi!HpO{sKVAPLFV*7WJO|h72^L-ORW{Rhj15eVUR^+xneW}jjWu@kuF3u
z{@7kl2SJ=BrCF`U<JJm_q}jSL9Z1!B(CG8*e;dHp{P?r>?9pG39TD;3h~m*;`B=xm
zM->3<+0n81+-2kNnrHvk=x^X{$xC>O9>=F2V~O{~gJ6%osa^!;55S&;%P}#yi#hLK
z(LKVi-UGaOad3a?JEcTtO=lSBcL@O63m`ZdREv&q<*nI|?J-b!w1}#|P?(Gmp|C!3
z_7>2`wF7UEsknHB#yGwa1p}KrisAg$Gi*A4+*}UrwAV;`O3>@P`2xvo#=D3B>{h})
zuVAMT)=pS3vd;U#LWZt4VaqhRzw;`{M)_B8W@7~jJNqj*Anl)$Y#tRx7Y|eN_+<C<
zO%c0)o#u{m(U=xLSVU?eMS_JE-WZiHMz=Kac_>z}*ou*t4H7yl|LmquAnTKc&|HBw
zr6kK2FP0N{lq3^(ip;_jb~&hzxrAL&)`(M&JIxdS!b)X8Bcy=MJVfdlw($F#01y?u
z6@L%nv4D`R-Q_9fZsH1MRJJq596JcPUm;H&0?>nxdIoey%OlJ}0dRc^)x~yq*=1Wv
z=Mc~t5{;b$t0KhD^3azc)QrC6spdn-j@|_^1XykN#C599flE<-n;*j-88u2}aWtu7
z6olQ$ZO(T98BwuI9f+2BiAgb<*jx|!r}UVQu@;=L@WH(B>c9&uNn<K)x0v4rG4yYD
z_U}aII7<6g*L|L}ex6H)x&I+^3Q47GdyFUT&|+xDt>S~7Mw@Q}nMnJXCE2?&OFp@M
zavRPMKgepZ41U)roZeJIIS8o9+|F8CAIy1Hc~St0@@Oni6AIkFT@~g{L57osA!H**
zL~Up4R3;$0VhbHVn73N!B-S@4f#?<uLifjO(RnO%(?aO(u+Z^?*}PE|RbqW}5{WK(
zFuIKLQ_8i5+g}1{q8StFRt+5@nuSuhV!4B*M3g-P=dPyKp+U@Z<S7E)i|L5kj%~sK
ztwA9%?+`}VPzI9}u~3+u*`AUV7UePKufsrz1bP@iliSLcM?@?sRzR?zwZA<js%%G+
z`8FD+e|y@K5etuYJ<eTAQW%bRaI=S4Gbi?W0;i+AX{U<E!g$fV56G}j1jEEriwA(9
z;(__hX|wT_{(cum<&bVi{np<|cEgrnepX?|g$kpE3Ul{BVUVaGoJb!gQ9>xu74(Hw
z10?#}aH8yC5+#Nb?HrOQFPvxs5~+et1$pm?zTF+_C^H-Vs}31hf*za4yiX(th<64b
zB!<=e8vu8~t?G;~ZV*QM2!gkGiw2nT*Kq{M{I`D&fp3#`Hb38h6!jsAO{i=y3fWa1
z`XqGx4nM69eM(^oUdN}-LbO5XtBmJ=;@8Ld)jwmlRB!6L$oDPYT#holVnZ2jzqSld
zqYRyYi$qlGJ_cQFDWUbNqK#9{@>wlWqKahJMTj=vLqlO#o6id5Hq>3;4;o<VC$_6%
zu~9}K0!CiR=C44YgU?H?I?0;A4X;Os@Ul%fzL|`|VEY5Frj!CsldN!)71kj%XS_nB
z(M#^9Y97Kv7=D9FhlOc7;OHJ`LvoL#gfb8zc5xXIVfu&x$s*XAU$9Ml(SHMU&@fVu
z$j=NpFc`AiUA{z|!YaPo{<Gy!R8GbU5gJ@`bq&)h4hvbCACFVVt<spcVCc{z9IN5g
zJ2==_6K~q*#SSvm4rUF8N=tAY+IdZ4GcmN{=pE4QTWWfu`npC;?l*bw3HU>W2dqB5
zJ`yvhFM9EPT&sc+Z;=xFG;@|}nS4a>E9(q%GD-r{pc8vtzKEIr_$YVUr9~NN4bly|
z&~`sIlNQ0rvTYex`%KpL4T>NB_+{bNMXM6rd_*-@&x||JCOD7=o&AzK$&}e@YvM<g
z@1^Tzm1BQnW&9}2fxgkZ0G>8t;m5;PE>=~pybl}o>Gdc&)DS4c4qH@2|Mqn7)ry-y
zp){nBYM|o|Bij5ki3@Wk-l;g}Cc1ndk5(9<Us5fj%`pVGV9n>*aUn$Skp=i%q;QgX
z)Kb%21{`efd8ib2(N?4Qa?F@S{p7EiFP5uY6xqfJuBrco0Y;PwY^7yrB}yh2kuxbk
zb^B}LDAQg+GG>zrd0&K+n-3w}MTzzwZZfC|Rxa|Oza%8Q<V_r;OM~B3eqMMhR~<zJ
zz#5ESBA_I0>$-OkD0)*cgaFa9^6sCmlv+nPo6v~CLgb&0GmP7kml7%F_0b$brF;q1
z)$to8j7iC%NznIard_d@w^7|j4K7Q8e?-z^A%W2;<f`)IM!cJ?Y&+jJd4XDzr%bRg
z>H(6)?=lgADD1JlR2<aVc*dy)oHk)D0Ael-_cKH>k;5^*H{;!0VCBFUPgziMK<dTN
zSt^JS`q02cWC*Ffyak<yF>HEJPo`$d)1Ch%UtddJ51ixz$Pnk|tnR=1D>cYjWF`rX
zV@yqDBL<PgH-32?mE8i$;jI5^AEU}uttVP+j|#bp#-C&<7P}RoorfW!hj>1RoB0cH
zOwydmnpapa8~L&xV=7FIFG-tBPd0B3Pj=4%U#1Ths~sL#(1$tFql64`q!7O%o+2Q1
zPkdcS76z_3q1YE?F8U|5lJ6<>;C_#941KAv&}rtPZ+QL5C%pRSI8JCU{}GcyR5*`@
z!Vw;DyDqdT4S3xXP5QQ?+>2enwQ6>mZ&iaingON(D`TC=^i&&Rt9BwC(?wxpeF|)Q
z-BIV=QGI4P>udp2^bWNs^HlKkVwZNX1ZQg%iy<kpA!P}#I3H<&3?D-6QB;q0m!|&r
zY9d!nO`?l74J%q2zfz)A`;b$S8t4!VCjw8Km)9e0sOD@{R)^<N(Q>EF<rW@c94!Q0
z73AzVjHXGtcJn%r0`Fl8k%F|;FOjgb1BArh>HHI-!vr4kMH<hHFx0D<J6fQWAx5~A
z1|w9;Y&nXrLtN)Qq|2~`GZkZ^b5-aQnnK1O&byR=*~u(_i#(_i%Z_LU67wnwX6|D1
z0F&7Wx)a#r^6<JU1e(I>^@k?P<K_tgKLnO*zJuf(ZXgn?=;le(!~97I<9s0M{GLn@
z*g0X9{L{Cal^AUyj9u@9#(w9GSF9SL_$^ZXt7b!}NZEV<Q$xucS#lRkZkK#E$d}Hi
zLjw@Wg-N3JE13VC%%3fV2yzJ?1A3MbfkFKwv(xw4ifN%@fV#Fas{^P~SKF|&<4qWn
zWD-Yuknjuq*ej~RVlf8jMUMN(FjF*pKoq1qp=Ou`z^@rZ12mfDLBRYOM$+U9a9=mc
zjl<i3B$4w}3ywU248a_p<yec##~UgU9u?#0b@Jdp68ku)hF_N$PZZn&gixpzMCUCR
zrK8N3IevAc^GT~oI-fwJ*(bQ5)ehaq05t+Mf7nEc{_Rvwte4$>79#9f$rt0cXY6_F
zE1XIE#mOm%Na3_%-uw&TF6+U`WH;1T-hyXv_!HdvT@+7fWLAp#PWU<1`~#k`$|uMs
zdECLr8hJGM_zQUqx_!*vKlPEzktihgEHm{plN+6L+`h-4LU=gU{2oUR6dGkcHx%Ep
z6&2%K>LBmE1jNM)I1{1NO~oVT**|WC$E|&)eOu#V91&{4)}Q%Z5|i(-R2@#P{u|(5
z2RPl_7xd^j3IEs8pCb{Z?Sw`EealmF|BW>7gwl`>dBXF*k;WHF^Q@!+1^)H2<%H7k
zrbcrtJF)<kniXTlg`YJuGW?uip8q*u^jV3M8_UvQQn(QWKqG8T&cn)qUmnE;@k4@{
zX@7fqn)!7M6(<j|W#gKSx2NA?-Yg%`zc}<LA0qKV0bmIVfHR<Z56-l_1<^CYS=M)h
z%Rc*rt8&s<k8g?Qs!Yb2mlX-=m6PC^V18nyYdq|Bwr3XH;7QwGvX(}xIG|EUR}#g^
ziDJi!;~ifEO<`6u$4GeEyh+02<_!pi(9A2SB-S}YDab$LuHHzH`_wT#kr8jzpg35x
z1tCA0FH|9+f5ruTNAyK}dW%=_Ai9>(vsLsvDtbSo<<z=A?x&3YmWr-a(Qh)E7yTgh
z4;Za6n&fZJL#c)#?LqcFu$|ml)_4e3DdoTr5%D-m)pPuw2y>$3G4&*#u}gD)B9|XC
z-nbh9<e|<u^rIU8IUcmnXW-1`jm1vSMLNZgD8}*Jso!MPeKX!g67ywtyKnRaCihL<
zBti6<RKCR>;hPQ>-%ZZ%Z#TDKR9cw84HTx=Sx?`LRm9{{nEotjr#_`H-6}!c{=t|~
zf^?P6!*sDKU5!fj4VCVXD&1Co43!|%5SD)PI{zjie<8nl8TyKA{DmaI9LnOo@E20d
zgWymgE#ZKocM$kz^-yMk2gEePzWT>9(9XHxD+kx?Ku?_!;Ys_{>w6YM;{1{ydG&K4
z=PmAu2bD}^Rtv!ulAi;;B<;eXEZ8mbJoUtL0(KCdl}xvuiT)Sx>}2gBzwHDzo$TeE
zXjGis#wHYGwwA?TcJAkgiCy+`UUlUu>x;3k{ZL@ez)PPUXRj^>VAO)GAfCo~6Ga9&
zz&l2oX<thpBH%6{dvPy#BPJ*h9B)EB7z;O*V$=xNf?v+F$2U4*nY;%-u05LkCdzLr
zPJf{oyBD^5(*C@Ni9Ujf7@ik?DGjEdc-U|If<9U4F}LhU5B0#mAUna}M-#wFjep#J
zH<o$O3w#fljN(|Yo(Lr>pBH}#QcV~nalsGVFWtTgXeO9NL=7yd&?&6X&uUS-%(U~F
z`pHcDgU2$Xj%B7DTR3R|jt&uU&rTazgXW2nZo|@H@$K+V5S1~xzYAxOP!!KLPA2#_
z0moOl5<~A2f|FAQxWDMAF*+3*|CB@0^&k}*CM!*^>IdGJ>&ArvL;IoUx_&tJm-``P
zTpH>Jc7yZ+e-il<?t`P!2S^a^1Gn$*yc6MT`wJAkKO}U7EHBKj$cS<!$7DvqmYUSa
zqxciQc-TJ<TZE@zI&lcdXfAOI<%=*63Rhyk`E6ZFt`cv8H<?+!aF5!OaoEnQ-%AHX
z^ek{)4~Dd1!7sq*eg=brYsYKoeB9+VGCsrSjl0x)SYDa)xD3{F;@W2%T?@%z-GriM
z!Z|r_Hu2zKF$d~Kd_%W;q7K>Lz>N%PpDua8t6xT&cqV=-v+HMO-#@SlFb=_B)(>Vz
z&WE$DlBqcFgYP`t4nGBu#{LEsRZjEN1pyd$z#{SHD8xZ75Xb011SOI9rC1STzACt<
zCwnIf=p|3&Q!(ZzsLl{n(AQqXiVYf{>`0tQJz@VD?>h5N?DgthnQ1uT3im+v2M>8C
z9!5Q&?T63ho!d#JR9gKf#uUi13%jvxi@yLVOD|xxcijHQVywTB8K*)l>9D@^OoUS=
zl=YZ-BTAMTb=o@--e{&IXHGmR>rTk1aJQwOFio&Xp3;oM2~jSto<nzK>i2o0E_>jo
zH50BY2G;-+&*_us)c^V!J2hngcpd)@_3v#!#`Bb+_fgh6>>+tR{Z2XCHE=$igU^j7
zRtkX6sr7z_LlBjsWh6Gk)ckjCe$F{mXoj!4sI6o#opwIi`6E@#&H@S3L*=~&esLH+
zO~DWLhb7*y-~uD9r+BhRL6-A%oNn!-9)3NVomzVMx8mN6Yp{Q-A-=8b$OY9%5iM<4
zgaL!ZiAeLiKV|2E`gpH$RrvO_vXki{?^YfiiWJap*t^wxWIXgH?#sc5wlo0y?LRvx
zA}F-8CCQ2AL1v0V;VcHy`smQqw-kf+GMvA8;p~%F$HB#l-1Xv>1&M#07*5eMEN<G0
zIz)2ES^V--!sk#{lF7}YI>3}=E|U!CNruXcGAfk_zxYGR)yffB12;rAIOnnOd;IYq
zaPMQ{<xHGqocIO2ynz{I#c+JTJc@ah89h)`VK#w+_NtkLcJcJTkLZ=3cYcOJ18-v>
zUn#T9j0cd0Z}3mtUwkWhAr>%+;@rvn5Z&rUJL5#)PE`I95G~%PnuX;Gmr@Ei@m+7)
zc`Vo9yb=80UVg7s93>}msXPvxNPWx_;AQ^-?+&RvQZ9y(BHG)kFdH51opv4^7MwOK
zrZ|hUKZ|D0#=vAkCOXkI4YZLSng^jmf%_ckGjSUAnK$iR@tAPR_;AW|a2h2Y?La?t
zZFB2b3CnvV-aGH3sR2Kc#<((m7=zvI1DPH1tCA}b#oPyI^Pem54bWyaBD=P-F||%_
zXc-+s5fei3%1{(lMDauj#di_exlkAvv0T0uOOqr<LGp%Td5Bm>hp@yF%Oqe?WqF!d
ze7NL<H)IVG4aAo)DE~AU)@e|rehNkI2{)`{;C1%S0nvcIM4%!^drVYjcRD6UXoD8x
z@aCzmDH78_Zi{~q3kJdXr>p64A_^38*1>KjE5;mRpq0_W#oy!#2~ti89J6qgScH;j
zKE@iM1tIldguuBE1{dEjAXC9a*wJ44(in?Nd+g<>NpV<ua~D%ECk~7`@E0@M!Uij)
z(3tB%LX0_<LLrsmE^f~9Kw#&fn%OC__VOo$o=NuCm-9c$t#S?!^f?kVifI)X*nD?m
z?%^wLKsi@Dg>EGMvu=dM43}u;47Wc&0WX&!j$AZfLP<Sz%T6l4yzrz|w!2|8R~$!x
zORJe7(W5mr_`ZY_OdU3-xB)|dRO>WD>Ke3N3JG|PNFkt`BzchPaxC2p{%L+nWF+7Z
zWhw*|<qHlaSSp3x+T2(svjaGo`3Z{0LuQ=$;myp9MfJ^JhOoRG!ZOFoE7g2giYv|P
zg}DV?b)x&>%f~-uxA`)#b=65bb$&dE;K78hnyn#Z&*4EfkBZTg953cKfK-;&oevF4
zCDr{+DAl*+Aza<BGu;=fP&xmM?|+W@`1aBv^Kp3n0}#%?de5py5^!`OLY*tYyDukU
z)e#QMRl6fV5PFU{ezDe5kGZjDR(7-<he&)sLQilhqkoP~$|4%#>zmi3TV(oc*n}sq
zUcXU-+A0JYn1-FcOq=en<D35xo3pjo>CcID20Fjy@;f8->Z)_xx~_0znBn~LJvRE2
zEZ9p2R&;w$?}XL7?HDVB2{6-ZcTa40(_>XdPapf2(J8}4o8f3Ta=tEgdpJ64xabIJ
zdm_)hF4}{mr;_j7>!MJs?l9u#hKt_M=mK2G!=RpZckA#LgTU{-8`>y;5mWi6sA(73
zTwCo_!ZLgR(&6yOgbMC29WJ_#+4~!KowRjS-^>89Y^4eS+pb3M{6?d<s5!#8v><w2
zS0uuf6?G^iLjOjFSC7@mdmqkYcOw2&&R*kGeuwcX&f2$O*dd``0M1;kmIRkpR`Wgh
z>T*Z<=gb%4oGo+&zfMf!jLSHO&&+y$V*UiQY+QC!q@wiZ55fO4^ecRy#@g(xNJl_E
z=v;Lavsvl#QO>fHk<POBuHeSS482DdyBQTnUA}74o73)k&k08|0rP9RzY!m1`QxX7
zz8>_u?j505HxtCa^!`A9bl~(?{Zqc8*KftA2mIdqBSDIe^uVPXNQ!>jFVL}-h>}x%
z*Y?OX_K45V07KbV&%OmguV-_iMst>9AC$*;(eCZ|=JwaK8O$eFqE!NmzL{xr`2^Tm
z)@VahRJ22bYg~S67q)b9R|zWXDQGeJavF_3Gz<F=w^rEKex48!VO+jB;4EwJ_7pTu
z-evS@)e`NimtOWYkQTf?KPe{Iu{@zMQrV9M1Ir!p0C&WHfFIi)zGv@B#B=rs{KYC$
zeM*;4{B`X~SD)s}C;qzj%oW#)@O$*1c$KW7tmV=Cf?aTPw=grapwaDXU|Hzn*jF#4
zsfvTED0adWY6r9)0eTY9ZFJ<b105Z^lLsrY)!Nk+JEYP+8St2DeAO~Ieg1B?g|D6?
z+3TxN<9(W&3sE=(z0bq{)5;pE(BzT!mmO>_5bZ0+BGI0>u_aT(^+#}0k(r3nS7b@M
zUd7c2hi`?If!;H@A11-xf)?<%t%x&v9Q8uhJ&pz;>lau0OZk1dqe4?*bqff@rPn5q
z#&z6BQ{RJ*bm<Meiyay_j9A{%?$s-rk-!UrM4(s1$hYbie)DZsRjXhWNQ!_#=h!7j
zF{;Lo#s*igX<1V2jr@(b8)w=s8_&0G4+fm`Od}x&Czk7(L2#DS+fo(mxW{|3%D8jh
z_*2J`F0gEV^50<)H&g+o@#4ygjSMfXtSw^L>kv+4EOS)1kZNCCS<{FxICI&ppV-T5
z$4JwS4`OODUR+SiC}YJjKU)_3pq5F3fgdmWBqkVGniUKNp3Q4DKF>ReV%`x99$9wB
zE>ho_NaKa<9mbsOkAi_2O_y#mt~lzu(PBns_MzbR84owr1!vv$aC04C$8L`_dQw_8
zMHb&~bT!58Lj@v?-W9tp9x!_UcJ%vrT|DZ=k#B;m`(c%_3k+-bO`Apl_*~QIf3tu;
zy7(D@<2G8rZ(G0@Hra~rFglvzRuB%&vZC2}aX%o(FCk>yi=&)d1r*95a>93S+7zP@
zXIh9`1U&9R3$cP8LE!l)$$Zpq*?b_J-)@{KJYgIz{4(eqx#WV8wPQ!6(W5m85m}8W
zJ=JI|btn!AxPt&b-4zUsZF?WBck3Q|`Awry_nxdkuwePv_af22DF>uoI+{lR38c(+
zX_a;vUys*o+hw0>m#(JqFI&K$NxO`$w19`UOIy?Ed4yxTw5WEu<0(R3*DfEbb^+q4
z7UKQVE~CF?As%R#W%C0=+vUwryCf}XL%Vz=?ZQFD_Bf)UJ!)l$^=WrGIzYS5q$OVl
z1Cfh9iveNQ%c!f*Zv=7P@dbbSNn)+WnMDU;6tT@3ov;%vH793(u;7J+K%~)-ec9;C
z{=hijG<5<H#u;;RJ~E8#9l=0G_9de}yB!>$o}(9GEk|?k$nslfj0UK^`~kM{;=Iv+
zgSQ{{=NikkJEr5219Hnz6z*{E{1)S`>_bLv)8<qpy(t(NpL;GCxFi2Pqwm-SQuE2k
z;P&NXuSOcnicZG_oy&@@mKr~AYXWthiZLSF_Tk}ZsnOcD*ErDDhNkaoGL|3fHJ<P4
zFwQL5g#>M%1f4%VeKP3uv;p(7HpA%4+8NwF(z`PPv@jYZ5FpR>P5tIq@4%d(#qQ~{
z8E0}hFdFZ{z!(G(qafl5(TS;BAZ&vnj*S%@;|Os$r%ge`2t*^TU43yu1z`&Sq8HQB
znfN2d;dm2GQ!S0x@npjJNMma5XTj}vJ$$(cjoQHPh`-B;y;n3{t#o25I0in}O3Po-
zs>u!5gP-u{RM0s(=fhyfv&2=MbJdsuHsQP@8^h_2>?THD4F*Q%GzSAOWbZ`pa{3ca
zjJAGwmqu2<t{s{6IsDArJhYtMtHr&;kG-1WbDdYmA3B2f^Etwbf=8ZD??Bt`Fj^NL
zjWk-X3X8Lvc$aEoyQ=)42HX{DVhiF_!nF+u2-U<E#JdV2nN55k=O~&O5UPorRTKYK
zLBz6&*^vk0&p=sWLk0X<Y|75~uHfG<OR6d2%lZ5sBdP7K^Jv?k)A7Q2Ooo(=jf`x+
zH0jg5D^3LQbHQDJJ8H3+aVZgw;1VGjaLx=C%t_c08FbEgyfqjJ!N7+8*<8i+tuLGp
z26|U?885DQ?frH#`xjSiGvwh{W48TS9wNt-pXWnn!9Gvma$<0MMnX#@N^~%|YPn-v
zEYqI}z6t~ao>>sUq0q!&Qr?(#pGtbr0%xLN(u*tB3ThO-T|V4BW`kr(6o-uiFPy~m
zkkApyGA7$llGj5;+M<f&2o*^mv(_q-%B&+gp*51liJ!!hY!L9^t51*F7RKKhDj4Dw
zx?qxLOu34mm66aa*~U&mw(COKDm-qV2>iyKV^j@|q%p5c?!j5(LAgQaa>o=KB;G`C
zT0;x!WncX@Owlf%NC}v*MMUt4h=BQC<O83Q4}2mY_>_F$6Cq^sUjI@^SCAyCH=)hl
zaBR8y74Rq03=TT_YA8K;qnaTibt5lt6n1%f+)>SzP?8CE)?Qttay;Tlbq!k@swg-s
ztZoECEZvkeBDq;Gq!GkZnjI?ASn(t^#8VjX`bKw;rZJ?<XE;;|<z~ZHK|EOI0f&m~
zITVQvw#_P4Es=YD^&2IqVcopG>P8|~GLUo4lu-}b--y2@z4X{hJj6omKeEzUc6g;r
z|2QM9)n$KUhfBw1)ol1Xn%(R2uZ(osf7g$zMsdm;A}A0-+kG+k>Z1H|>HdfGDf@AN
zIz(}-{6juP(zAUQU95V^;rbM3t*3wTFrXjNr+<c22R*n+FRg}^vaim8q%dq(qAt>q
zs@ouELLGP&GW$Jo+}%FjJ(<g-XxC?G0~`%6fQzDPt_#8Ul14(T+fSN5XdHf_BeP&P
zZkS6X-73P9(GYy~`7v9p0d+tI6yjf(0Tq1p(GXo1WMUeGd}_NyR^hQ3cLTArcf|or
zsKnf=h9WQvs$kNcW40)Y2hicn0);s#j5!G-OvP`HOZXtt=yP~cG8FmI7^AbTJv>fB
zm{Fz;3iGvNEnMa;s?67nHI&(VDV>FWG?q&Y<4#~_nIH<ka597*1+&m6C4~wGAPnVj
z!7cQ!jvTXA6<k;W3Z8ulYnPqy-O^)U{WFXiu3K_2vi9=S|F<(S!c>Q3M(y-Wyol|y
zOEcHRM!><5{f%B6dha9a@~U%x?z9~XkAPS)cTK*4q04ZW-=)#)^yS}=g8g$t9lm)B
z8o0CsURmq&JfSX+{+#I0n!&#kNE<d`(EwL|7&$F?g5N8>q7Dz%*o2*SXf4UH6Ix3;
zeoWkI4diQ(A!+f^z;exI!z?Q+9L~0>Bs6@DoerL;f!$x$>Z_1JFfi+z%Q3?^DmZB%
z#3gzX&S^o1sC5ED4atpnpZWl~kz_GIh3WXJN$_BIz(~Ac{rF9e$Gnoi+qmng@jrk@
z9!Q_8!%uA%F)zo=jJ8KuQze*c$h4Sj(l`LUP{rfusYahBi(ZjM&cyG-vZ11i$q=@n
zpuvt8Fe~7#HWgpHvQRFy&TQba*J#Z-1q=<WG%A{&h@bB#8olxFLt^<HsT!Cn*s(a_
z&yhhTw_L#*hz)?{iR5GDkCnY~Mf0mqj*21{0d16p&?(xJnf};%@M5g;>$}mMZhv(h
zVW0qre*p>>Mmfv45)I0ZjIdZN4x6QKYa0>BR#N>|e(-IsLy0r=W6BAH%hw<ZBY%Ah
zaAx4ln%~b%oRA5;{t9LU-02zqr}{JOk6cpM;5Y-9qn&{+sJN@Ap(#MsD9kK>$>jb(
z{|)AZ1teJPj@Vzu2?=Z+Nqgbmq0jML%_gLr#_SN*bR)!?{WyCg3(vE09TSLYa}nc9
zwE9#P)>NrbiF6QFG`9P4t)WPT6;&#<I$nu<nD?ZsD)Q<{aZdeAFt9ie!tkOmF@MJ8
zT`~?YIu{9<ZF38;W6dhz_`JoSrMwEErT25s1_PP7A7n)B$t=Kfb56qMZU95@p7C&R
z7Sc!!jPrRHjoQ5BEfD;3_XLw((u$$>sLoqnW%T7zMKZQK(&$`tHO5$l#YS*@@0cd!
zyQl~2+8=2j1)VQx7>4l|Db4R;#DN&BI(lP*vwFvz!-8WZQ~I>VU?dQ~4_WAigpVVc
zOUdrUpmULijnr}7T*q~yT)ks<M@nj7?8eQXLGY$VAc<V`DYA1c>cj6M?Sr867VQfR
ztCY*e@|1(Yg3(w<WAvuHhu3!eoi_SXc8G`TZEPHj-Yka89ah&ktggWr<M$GW)ip{g
z2At}eKF4MaZ4W^u-J4cR7KQsN(N`cmAyA(XD5f=wI=3Ru!|O^Z*wnXx6zyxDfqkJh
z8+v`h#(au%smX9K+fpno#JsX`h6cWVqrpqaQb2x`IY1WVW03c>?0Znv>p7U~)^=zW
zHSay`WE#)h*KSy>jQr*zuKOEcX)Ga!YYUhZ!rCf^%fT~LSflmgUAUU4lQ0?-R}<lm
znPlH5dF9_Pc@<8>gha*$y;qh(SyQLN%|!~OzZ;=y0C+SWmW^p&B2%(6F!BL5){Qr^
zF&TrQu`!g5%_JMk8^Xqz>RL8NykujN4+d^3n$!8FXnHG-l9{Op@KFMyb?OlMV=Kt2
zGVHFyV0jtPv|q>1T+d0(z$BgGXxgxFgA|)H{Drnir$3{=tOu;lAZICndQZe5W|7J|
zlS&anr`m$Rn*Kms(?E9_`pFD`PQNp7DLP}~acAJfSDpRu$;E8WvMcE{ru5erF_rxh
z6iso#H`7sKaJGBN*(`pTS#XrRciIoZ=5P|Ihj%v#rz1Nf0)!P+46$rYWeD|YmU>s3
zzU7)~m=dj)t&0ZRtTFxy=1aaW*J@IwuQk7r7uX?N7+qE;fu-+M^H85wOB#cz6d0Mm
zh<FrNTLhK^_QWq(+2%nw8=u!}WaiZhJ;mkKS0NAftiK8%oTMIZAZckxrOIEOSKC6E
zz>~QhLFbdXr@_&V8-LDg$YSYE<$f4+X5@Ziyrey|Gtp?sYbYYH^RC=|h9681yzF?S
zp)a};WBgn+c#(_xp`;k4VWAzRoeIv1OX!OX&RRb9Gw_|Ui`s-aU5){|{2hsk=aENs
zG09QFZ3pz|1h8%}vHgG^EBy1GMJi1o5$fHb^EM4dP16i;uv27br}6L^A1>hGORk;T
zA-bl(mghtJTHX<g!D{sqMjTsjxuuU?ZjmoIo9ZQSGRAZImR@pLz2uPI5i&<SR@2~g
z4J~-IudPIXq5Cc31f#*%FekG}H#b1CB}z~hgpBZRfSO%{ufC*}e_n~`@P-Y1Hux%J
z6D9yxfY^{ARfP5qBvLkTRHVo(Ln4bXzGS<>SIy~hXv*hQWHitU%N&w&?m%Ssb$R9@
zlA|cl9z7Ig)<7yzLJvXd9*C4R<B-S{5R~Av826A!*}7w9zG|}bL3v_$dVR7<2ytgU
zi-i@S1hS9l)=xg^)<1ay{>2(Q|MfUH0}jDIhMu8zC@@IfSFjv9zRrI>g+9dI6PI$B
z!<8=Z0Acr1iF8Cn#BQMPyZ}g`{9U(ndi2YCL@*WkxN|b_TcUdB!x*n(FYDHuoqo@K
zSa^HwZ{zlo>F><;kK3E+i@%&X3Rci#JUhXDuoG&3J8J~)l19w9OLUS7{~Vq&Tp%_o
z3s8?IdiHey&Hb6U<i%MQm_hK!Fd}`Qr?tydb|f-$R4!~%o{I78JL1xJW%5=S``hVJ
zT&25x(=TDKR@@|&9ly~t3fIHx52U#F9mmCzL+qiN;o#$C1AN?DaL|L3@AkF-iI=h?
zSKyMpU@tY>XHG*qxTKM8yK#3k#Su?pgamF8PCP~OrmsiE<iki6o1$W4)LW{0)70BE
z^_HOC(&f#musSWQSt@R+g3OgSy)=}EXRi8C8UFB``cM`6;8ew0CB^cr3T#A#2Uj_)
z{tku+E~4;1#NDS%9rq9&Soj@!wVsHx!12GpUke-_!;v<fXFFiX=5pYwahD^(v(x2B
zL}GA+KuTuXzJ>eYPnVvqS3sL_vkeXz_n;qE9loEtjnQSDk^O;-2jnn$S>S%RbW)%<
zI?(x5ukZUQ&Zu31UThief{tQb)Prlrebw!c)t#l6ZHp7!BjcOhBeR=h_@nU$pR$`1
z;fuEo-oD{F7sRmNGcx{NIR0Mf+di57)R}^kG5i6-0ed&n<2Xf+3AojQ^!V!sedGQy
zV^o4m|C%#QkGVF+%<@hDN2h)nYXMu?aeKz7T+O9FmALOXkW6suOEpkpZX~4pUq9d*
z_e+<4sP(k7tRvDnYN<_MVRH)A-j)HMtAvXt+)Ur}Un+#rWydD~VLT8f3&O7fVLSmx
z3_=(<Jpve`fH4NQJt&M{1;!Wx-Y^v74Q0pg2S(K6sT9FD9vBlaV8#+SY6#XSV7(Do
zWAzoWz>0nX(pZj{8`0sbXZmcvaOzEvA#N;dUzsr~Yn)4eeA2#lr=C6zmJeb3Ka6jV
zmo7QV!tnx4&4+kVJ3%;0!qJieDWYJv(R%t6Chh|^sNv^h^fXdE9sz!{pI=s_;F@|(
zV0N9p02b9|GXkeEGcQ~5TvpI|&*?_S1)X=F-o<b3l%Vs@(_H8PpEKz+b^j~eOQGdB
zeUy)t&7f{*bdiK_2^hlM9=af4lY-7jh1y*r(eDwMaN`I^OsVo(8v5Q6dPocbOc8+c
z(0AI9%a>#Tp!5f&PIVit&s)3kV4z}zc`i0ov$@lyQuwxUtp&O9lhDH?E33KbOtg{X
zSRUF#52+ylmwaCr`hGO@FeL=w761->c`!o{(^yz(LgbJe&&b?o_`80K1+v~o9L{Ac
z(xpPV34C^E3*>Wru6iv5xs?z2vi{4^ml!MUT!=EjJdUx?<;rs*pX)Y-Ah%g*xAug-
z#9C#~O(c9#zN9MR?^fF3^I?6X^|0wm=!<5hO4kUGmCRrFH2%)@@;801d@ts2C0QjO
zHu5M6A4==2hpM3UP`N(@b20=&8y^B!#aj=RDb~Zr>3Hz0YD`CvnbvAweFr9Oa72*5
z;;mpt*YnmY@YW1HR?E=6nvFj({E2n$bZJ~xg10utTfDWAymcvf>l;^-L%emuFuZkw
z#aeBF&fCJQHF{XqddtZ8%8}WXHvGllFBX5=5U#r3IWpcyuKIJ~s=LI~0xH!B#Z15D
ze|8Jb&vfNOK!N{RJiGm)>wA)+3YoD4<uqHLgz0w34Xn4IRZKH}h33rA14^|M=$wF7
zifV>=QwB~`<ls=<hkZbx=O>#qnd+A9qXnt{ak$<AcIhXev(BH`KXc6_o@<(oDyC*e
z9h`}I<F+;95-Rg&W1?}U?OF(BJ}~%QBXQ#au()73l#v!#lIZrW#H|gDo~TRMk^3QX
z0zTKYs}HP+jdWFdQ+cq7$76UW@JtPVgXDuy`AIT=sr=tV`Qw3=HqPBNM>A1=ukQz`
zE>s}1pe-}%2<EuLulGN&COHKMv`~QssK5zMd=no)4O|0NFlgS~%_{JemN|SC{{6~z
zRWN$NFfXkffxnp=8b4&O{TJ=gs$#?*tqzI^WslZ~CoDd<N>IBA!GJwl3*T^cm^08j
z!ZJu3uME<Ppe%6d8Cz+M7DLn0Ypl_-kTNXCiZxo;A}n{9sGwymc3qTP&nQ)K&kYk-
zu@uCqqKk%$&I(5_9VR-XQY9@NCa$80NeeQ!!T^nR#j&G0TAzVb{FQ|FPw|5^K)csj
zpJi+mwEn7L&}OVxaqEYPtDs7W{kav}udruuRBYs;uJ<F+T^hYBDz@^y$59?#2N_)+
zxE7Fys?Y-$Q}U$<5AHHEYw`Pdtze3+=z8ufkNy_KUW9RfC*ewe9W_6&Y7=XY{Sn5M
z$D%iEC&<cb>Rb`llrp3q1|iISsA+{&FV^|d3ki8eYhVnJsuaPzZo`$k)9~hfV0@Bu
zH0Ye3e}L+n8fJxM#uHsee*T|>fk}Dqn)l?Xgpx()Rlj7}c~wA>wR%Spm^AomiKBco
zE5ic>o>g)agne}}iX)CTjZ0eeNYo0eB^Hs|jc-0p^k@Mzp6Rz<w&3L*91cN@7QH_R
zbI>Tnz&MVOY-Z=Gb{r2A+c^`qbIm=@{>BWw*Rq{!bopvHHefr~EMp_kIbQd-;|q-E
z?!j<)(C<xy@tjE*|FQ|V^)zt$HZh*tk53Qyv&DGstBKIy3>eRCL=@JDBZiI}jDStJ
zO>q;=<`!>t!K4xG0Mof<K(l^p@)>GEEHIMeXO~Za*zbwN2^AZv1XWTh-h{e*)vTmm
zJx!2kgD5JMTD~4_ZL~#NYoim@mvzw=jjf9oO<<3<A=)Cg4bc$_=Cx>29rArGn)(+Z
zzl|&$dyK^)_F!Nk?D-(A#-Q<~NX8`^^6j#}+zbNs6to&wU@-w=BQj;k_ev5dw|hqb
z+XIJT$rpe@6O17w-d8WXMZV?hy}mgcX+=d9afu^-4N%1Y1Ac5T^F4b_BA&DVfxoVo
zVOEYSk71YhAzlR$_qRM;8PP6pHZ<f=a1t}TGrN6@*P{zILa_b^SmeD7i##2K68kfw
z2L&}@B67)LTZNzapIU}_hhdmExDr0aseE%_$CJ|tT%|^L4sxg`hY}3!FeBLyJBOAW
zNU|?FZU8p4kK<<ijm6(L_;FHlSwj&Akp1PpM93ZmAK(NJuA*J6O!Tg3cSSeCa<8lx
zhaFo1024jPBxUVA-h%zG7^+A|pCD8t3KmtV>b<6lA(TT|?4=i1syzgl5jBEF@V%j%
zRC2|!xeD<X<<T?`skk|V08DW%DuTW5TnQT7NTFAx<JYU#KoyE$aaE@Nk;OVPah}vy
zK_F-XC5f+|2!hTRSJ-ag@3@=zJN-Msz}>QLfL0BH>5ms3vccvn3Bz>3R2_ANZBx=N
zBhW@8r=)$x@7s>?;i&Q3w$J!*+W1x5N8EnhWjNZf*uY=wyvwv0GV<m%8AUmVg3h9x
zb~3nBWKV_{!D19V?R~#4Sn#~}!^U98quw?c+~s-qHX^>Zoo#Yy!5z0Dcf4;-WV*xi
zP8!eS4{g?s_@MLAuJeej*BH4BJ78!d8V*v?14F`^xhkx#V+bT08KU8f5ModF)-(3<
zvtI+nLk%iPv9BXZu4psL;DjCdS1<`xo`Mr9&p8S8#75qF&?tFghY`$!`p}ivjLnpU
zY9hu)QGWK3pmR$0iJ)^_)2BBXJz0(D-s)6zYtT6<`y6zN5B0SNw~v14y>|9H$2s?6
zE^$D8@3?X0dk3N5t7(y}myhj;6f3*7rs!v><HihyWk1XW@Ay7mueGuZDl5CoO{1q-
zz{>hC`r8)p+h{AAD$@G!c32-qYZlzji-%}?_!SH89SaT(S+reQ*a2w=ebb`^%JMM!
zQ@pYSTP@&5s4nYSZZSH9@eUgV&ti3l@DSR<Ku=W2Bm^>0v)Rg;jTmnDUMrJN$MUh~
zRGr^#ivF>cqpI`NA6YrRY2`@6vK`?%yDVU<&i7fs*VTEP1!vWHj0HD*oliFmsdFb@
zht?UhvDAmwh0y3rU6#$?V|0$GmHI84|FLm+%x2cjph0GjR-evxvB=BVzoV}bOY%Y(
z72H_}?e*QTwCnJAKaMb#YW0oMG7D<il0jzzL1AroDBZYw$yqMnVS2W#?V|DfCEJbP
zpEhB(*JpUTc488!mOOeKH3|bpiR8Jmp_G_lP8+b7e|j4hUuf=TDE=4J2*8!^9R>lm
zprf{f2&=mZ42S_DY^OuQ0U|tz*S}1Jf3Se94%uu0U)Lc%3(o403JY%d4tdG~wums-
z0^T~92wCnB5wgO=5n+oWy6Scn)^w||Ho~g&01=-2)8IN!J%-n7>pVb&?^wWAo!_*8
zudDMfEjX*rKeyn9uk#NrV5`p0Sil2y1`$eqEFzS;SVSoGvxty&6CwohNq>VFQ~7Nu
z5t8z%q#1+`FD<ASsuB9bCj0ngNNA)nNm`s=AuMdxNN@jKWn!$ud^j+2$#IP7nwG0T
zkFhP&+)_t_!uxE($w=e1oIXktJ0gve?9;)(^z6@#{H8m;0pxMPKr(DDo$=Z48SAoP
zi(H)D%DGeKNH9~GL$5e$G%{6~$d11miR|TfW0%kPByY5o57IKDjl;0*Ezw4&vdo3q
z*vFof8vuXKKWJ=esxJZr3}sh5Ve+TLNY6gTji}y8V{XnDeCh^6PtWcP22!)TgMqm@
z`;9AEJB`%rHoc+<1QT>-!4MQ9<W!`Q1%vXAk=_rx`F<3$#hu<y>MWbh7Fx#n;{NrE
zWEie%@vFL`gU%GOdfj`^1;M0@V=cIs6kM#prHcJ*2u|5=T5yjkIGeytgP7D?6oOM$
zoEF?f!d=p)tb!G1bIt{oqb8=b`&G$CDv0TXXw1QYDcWZhEK$HLL`O~uqDcgU5H%>j
z^ub_%QeephqrAmpU6g8;LiijE`Evz{7O{mSw4n3vwY~h=WgOA^@rS*?JChD*{L~mM
za3-D7@DW>lNlERAc)AcQa3p=nr@g^~u}N1`(F;j?Q@K4V1aL(YnTvJ}2P2IybGxv0
z`B2|n$XX3qBoGkCV{gcOuZXoo^D9{l+p#KM;INL$Il~<sA>~Np^_-KSTLY`E>;uNO
z?5iNGoDO4B&c&d!F#BXM5D&BNj_8MWMR5K0U$DqQhJI#f;?`$w-o|~(kC3r4{)iBk
zz;ihgdtsT+u=DC?hV$wUqd2FAr4WnY;7n(FvzP=!RLH`4i#rz{7VF?Frugku5mWRE
zu3ap;v#fZ1Cxz|?)6*_=F98+ZS#SjkZZJKC;1u0iaA}0Qqz$5$5ZDmo;dli$Kz7Vf
zk)1_PXS=SYr`=Y$6xmt%y{o_m(NictMRpe0YYJ=}iHV{<&6zJsEyHAILB6OU(I7Ui
z5xl-9t9TfcBp7u5P=l@e54A?)gmwylptQS_S~NUCPJ1-zD4*Jb1$QPLO2iYWZ){Rm
zqVYrROt2t{)VJM{v?mqEQ!12{+Pk6=)B6j}G<^Obv!EIG+a!7ma3OtvB1!T9gh^O)
zk<h-(Z!u10*9y@cef*?M%9zz)*}r0ca8-$;5Z;Cgx^bWtW|+(7Z}H1I4^P`<#RtB=
zrJkQK*{xGwJcY*%z3{B@^b6;h`<Y<Uvia+(1!md&4Gny77vRuxZ=xl8B<wIMk^D6U
z(>wol$-_8M*k`zRd{Bu>i6~ARNJuJ<7y3}f%@o!%3og^@S}e6^&7hfcpg4aw3ys?!
znC)vdQd%Uu%vY6pFpyOEo|TkeUzZ~BX`2EMFrR><@MEKB$HB@F<g4NIc(M=!@|^MX
z05-&I3u7y{GItiXczw%DgU-|)M=FD}?x1l%WQn7AMg$vlZMZ>I^YPn;P)ocf$c*0k
z+f*Abn_nJk^|hfEU8h<reA>oYxF0fF;Stz3FGWA%gvl3>^b&V`S;?-IwGb?8(Wo`D
z9-=WUEf%gyp-RR>G2XkPZBV7xstTc4>r{mhkCPdNmj=ODO$eARR;7W%c(iawFp$2Z
zIoyOvsIJ0>CkvYs*jU~$Iz$chNC=&ya1V^CxS|dQB6hS^a(Q$RR_!H@eASGvg`4qp
zrHNo!Ld~f91f;ql)Qqo%n(_5eGb+M1@(K;ZQ}{9VqYAHp)(YY7FQYOTn6_g#ej|45
z3*{U@&e2$p8#DmpD%id{`V3kdRx&cGF#lK@8<=%9f>F|x3;`C!Tn$4#kSl>Kr+sQU
z?OR-BDYtOavl2`TvsQ#Zi-x&gZu0&L0wLy2Tw4#v<dt3=Dvauec{{Ds0ql<I@#?j*
zF87aH4SNH&7MAE65ofK<LkoNrPwGH?sl*Rn^5ZHlq@PoYNJ<--{&D4aBp1b<sc#&E
zRv){I_)>*0uyX(DP!$2y0pQYcPySwXbt+jc5y7ZkGV|52a%dOT1kxZG_BW=aS*GpB
z#I&78@7U6$$$LiH8D-*r0p{&Ab3fzqub_$h#nvy}QG3vsEQ&Ao<>0Fe^VJ9ewXotd
z_1N_@eQTw+XZjSUdcaq%h-KA_4p&XYOnu6)XX&vU9@K3NUr`qBY*G7a7I4^Zgyn{`
z^gx$ERTBgC4E9dHyosi+uyTj)Xu<fmf5!utFmYG*#FrMtf16s1vxcYbU2?SDApRFx
zVR3oT<|(*D%|^emstxX*E+rZm_iDI2-MivrGN^K)R&T)};p0wcp=s=T;i|AU8FwIY
z#WKjfArd6<_?@=nSf$1KVd!))hIw2N))N{Z<ti7X!7ZXVRoS`dV65?Duq`Vily|RW
zAIiiU#Z16O<N?F^!p_j_;!N4mRY~-!u&BhAa3yx~z^1XR@UswR)M;%9>AC^15U%ax
z6W)g?3~nZq8E_3W$Opkd;*Ox?qz1Z$6T|m73#<4G2ff0p*0~8g&Q}^&9I-!#trmD5
z#QTz;Lt)qig<*?*^^=%X!p86za|`cQ#_&a;15eaNT<->B__x-?rYc)_mrs@1rN^(9
zJ8%LEJABpc(0xtb1#5JKFxsKarN0hYt0(0{e>M!`vDf~GSd3&}Mjh0_*mcOL^VPRd
zVOCH<6>_lS`J^T-*s(0>V4{D;$Y96QNlmG4kdKTkXj-c{-44~+K|QyX^D2&MBhVY_
z_*-3yUyCQekRJ9$WC<aKGIh3dnI^14F2dUo74lMi0QevkGKVp~3{oM_RbK|Fkh9d6
z4Ff9VboFJB3ON;Du2&%wJJ<qS8>Qj^0~@NsWU1k}Z;4hRoE7$nMHEc~C7SI<{>I*l
zc|hawUag*0FeW`UKH)!T{yLKu{ZKY{^Q$EXBdpcf3{;9<lCUOKg|&4Ext{_4y0{cN
zV&Ra&|51X!V_xI#XI_(TL~6grRM0TXS`*7c3SM}Bp~cw!6g-R{UHp)7MH59gg*{og
zoW)`Rz56M8_vxh1A&KQBoyU>^B~-X7T2RtpM`l7p6&@g?IT~6J)3pG^0yQ;s;7+c$
zmTJ|EM}^Z9@$<vP;Pz!n&028#qe<Nw8cH?L_8%v;AjXpf$!+`dN&8cSvz$rIsjN7W
z2Dj5JEI4Z_*C%KcW{tQSRTNcl%j!Q=x++yle-T2bY&pT||8vYrm=Wqz*<Jo>4FUHq
zX3wy!{>y|Iq1XOB*2&gH#B(0V4z#%u0S*6so72%LV)35{d@kSet-#3@kuvuuc9{Fe
zz`T_?z}!D^z}%lHVD4{&iO+3lrA<R@{iDr)1!~LIKZ+K)zU3QX=wFM6IqSiq)%u>g
zD3BHQ0sdXO4ON7d|G%I$H%qlkH0cVws}@2lON&8_u4A*5X!ThttVmU%B9IbT`J;~9
zV=&g{)n_3OG4U^^iT^^H_}lW%8iyCc#J@+|%nDO)A>p{Z21QeO6+*G^(aPVOyJwJ<
zKZ^`wvKbF4D}TNkU&6}&wY&zBWia5%{lHj9lmFY7C6wscAQ^1vZ^L}>SuBWWOj8sM
z{h@~cp$6IKMePDu+8=4b|4}4U7Ow#bEgy?hPq6xr4bECN=5iEm_4{qcYOIb&0JlF8
zCNsS-<XNa)$k4|@#jXtfmyOvSB{9HQCx-rUvWqiv(Wf{b2}6Hmx=`B_bl$9;4mwLx
z&KV`j(7%_OX&CyKz|g-07P40?L;p9_Fsmq%R>sbS3a#F;=$AB3dd8ryQ}L>Iz%^6R
zM#^yi**g2$HL&lXxjw1UC)8-MNlOyL72U9vg^*WE{%T+QHnCyXt4gq2!XCGYz~%q-
z-@xSu1V6AaGGhom3VBFiK=PW6tOWF=iUIrU@Cqra2!L<4V?5!Y0lw(<76aZ8SI3U+
zacqdQ81R-jYY%TroW+2*#Z@VoZE?bYmuls4vWK_SQ647@c&WBFu81&89c$wh1MbXP
z%ssps3%!VYG-ZXPrkHRh*kC=`Ai72?9MO(VS}i}Zovg6<hIUlCBoe)&x$ukuAlP5j
zYFH0r-BVc4e)XHrk^|S&@e6H|*?iz?R_9e@sds-1<4X{aFc`S~sZYRtvyiRVmkGH$
zJO32Wdv9!KDYB6xy0KfO@TaQot=14$>|K1HaZqbRxx|kQx$F_}+PtI_;I)s6dd49(
z^S~fm<J`DzB>R)y@2<aBd=^6$!&Yi@Npq9ME<^esCmqzN2;$rfyoterdy;Unh1gSr
z9d{FZi9>c5xMc$sUI=%69p^uCc?lJ374```8kSXkhb6ay^A{oX$Nrg&)n#`zf(u)c
z`}J)0_}}p`LJL_U_f#T)PNp17YQ=ek2vjcx7L(SQgq`GoJd*$^9gU#%sG_AJg!E8{
zAhb%b78Ab3n+6Ug*wmqf+juBJxNg~%M0F@3iz(HigjAO1O-5UX5~3}xZ5>LuB@O&I
zd?<k|nJZHwKv+@45Y4YKyaH{QdKXg-d{>PG?pviAbF*qZO*JyOGf4<={yG(IW;a6m
z=JbMT9kb~2jX*2xfyWVgtbI7)z`YCAaRinn=uGBugmE~I;LTH_LTp|=$xV(Uu$VlK
z@K6IOQH~?<6PRsn6=4GTJdTi$;|S|;9N|NpJ0PK+<Z%QSjw5W#Yaqp9M=;@;pCwW~
zyw6xW_&kD*=Mlgm$z+4hukbv=h+)nn2oJq%BcA-9CPM$c=&FFjF5_mLN|<%cfdqi#
zKmu4U4kV~VtJH~vdo}13zp8bB)nb#H{I-NA5=w9)p(K1Fp~O0oAZM*W>l!P3#nQ-Q
z^pb8d2COb}SY3p%DqV#W3o72~BAn48Hv$n>0gvLcqJ^}t^?@sMV5kgWNdSQGIxM{M
z!ekcUuwu62Y^P!)C{N5RAOzshuvT7Ch`6xPg`7GN`y85LgwCQ`ezhdBY5>9dp~)%-
zVm1zqDOE8v@fW5!#QuM2IC4(q&}2p77+I+gjeKq(aw!RS2+q0T$T_7$V{#EgSNzwX
zZjgv;k3Fa(2%8v(6PFSwV=-StBi;rbLD<!~^)nLwz{<p0mZ&95X9~su4=B8I79D48
z^Kh4?f?GI|oi}yLXa7dL$<B5WKMU!A1UjEZGz^q5b#{(8Ej@qNt*@xLwDWaf9C{z%
zfInRLV5_u&o#~g|xbbotAL;JV^6cgEP4>;Q>E+38L^%EPBVGQvk>=x5AeVyWM7ZC=
zPlV#JDbYJOM#2Husd@JKjq|+r`Mc-2>_sgR=bZLqxDNI7E~h;Ow>ReRp69f~(bu=9
zLbCu*#3vJ>02(nb!+v$QWv{gGecp3<3CP5=m$~U4>mJNRl)?P<baL1B2mOUhqM*Gn
z<W5OD?gdUkEbf%VCC;n^Zm>y3$bU2a)1RZq16-+YZumC41TGIB@K32{yr<x*M3f=I
z3%7v@Fiy>Y$IzdCf=GCghpEUPVClr${K}5larx&>7n*LgSG<C6V!`i!D8`l6X<z#?
zKDhKRChwYfw(QuA7e8}GozE-?R_tAJ6ApPd_XpB;KLS5h3(w-P{v&=H96=to&GXpj
z2l&(C)LZ7c?elldvlsHOX<n5#Y8U=H{aGV2{8_dPf9?(QX4+TU8u4+S{lmaKJhwQp
z@Z}4?F|x&#wnHNMvY$^2w>s0#FB<JBfal)W?*1Kk%k;;#E<EGZyEAwVZ3iluF|pfO
zb`|y93&;5|-D#xb>55&bXaE&$z(?%AL5KDzDtZ>)zwyDPUx4Av#4|3v$*SxH*sI>`
z?1vYK*cP0ENbPTO!A$52siMdKXzD!sg1D{!92voC?sfX(QSid1LH6^ocEVANQe@=v
ze|Ln-|2><_|HB)knq^H=OI5|RJwt0KUrnj&HdhoXcwy1a{X1ssv5hPRjMDIB;TPV5
z_i-Sj4@YI<n;(H=MfAWPk1rK^2+Kv@O>TWQlnAq7<vJS&VrD1eFNL-SxU7IiS6<&s
z@HP8Hg4g$>L~I7m-bbt4c=(_#PtF1rx%AhPa}mPE6<FXL5;nN5`#|1r<bMr5z*d%Z
ztkid=ZP!1YxhDH>`|Yz$`|Qi5N8kxyugm`f>fo->%>;b?PU<A-_t!*%lJi|3CVG6+
zd9c@$hP%7J1>@Zhk$X1I%le-ABoVX@@926C%Df=KtN#FHUXW5!;r5|ixDiIm<x}N?
z$!v@`t%O@U`^&ZLbp3NDcc!uAJ2k<#O@_DcVH<MC-C(GR*B1e?XGWy66<(0PjRBGA
zyU$5i@DWR#XYJo?wWq-6S{rU?ZJOnu{vF<XS^%43_)s4Q1?sq~aG~L_;V?~pPmEX3
zzZ%1LSAWdHy$|~HzZ03^{}F&cUoruh0>IG>V_@)&NA$w|J+t+~&w9?zvOBzoV4T&6
zPFwM4rvCoJ{#cJE@HtMZk8AcunI69ftI^rM;>MUqeAAme`gb1j6>n!Y+Ku?hdmsVt
zO_J>mc!DWpKTOU8fLpj5C>vN27>VJ4hNs|5;`aI$K|K`Pj1EpgN2Ap5!o5DSdjMyY
zce$hXvtPcy0T&YJ#qb}E>*1ecD_M-uiwjhi%KPidb0yr8T!fG`GWh}yonqzw5|4(U
zUkE3cbRh)N(KiF>18cm|5l-mCpus(m>GPgI4%x{#Vxzi`7u0$`NyM436CjILw%D5N
z(ZDvzgfn>){!>dj(Z3~Kc%qMW)%jlBu|uxSyMtJ$nQLs{xVL3-v_0iWS8VB}*~J&8
z&n`Y|PdUt1n{<x96WDh7=OYm0PU_~%f|#@R+^)0sypwoy6kd=f{)vVc?FR`2C_c|m
zdC#09;Fkm{J`-~`!>&D;NT8J|c+Rt30EX!o&${fnJMrUiU4+Y8P&IC0p2wNFALiYt
z@3my>PJ3ON*}nRZT-(9fJZcH*7H&0Kv=H8`9*@4u1C9j)$>Lj_p<4@ZA4Y^z_*RDA
z?D6Nq+x9v5<s*O5JDd{_;Lwk2V#j3c(HzaJXvE0UdY0UQ?kJbp166_B7W~={;F1vB
z5VG);+*Zt)B}3m8hQr*`hQGb|u-~4t8+R5z<j;ri){EQiB(U-&_*MQA*@e#-5ey0q
zjX|-I$e_eX1rHnZj1j}2&`4lVY@{$KF{UBNO%Cw4FrYCg4kR)t34o>MeuBS0;}1+R
z7cOxd;W9k9a9!8zc~vv*Daa1L$PK^948JO`|0%vLKz<N^&G<WDPl3<$(c9597!i&Q
z(puiMV;DR>uhs+Rl+_b%9aJyZc36IoKm`D>g(t(!$cyeMY`~;|qk)eD3GI#%xG#-Y
zYV9<?IT2l720yhC#b2RM-2^iMU&64sV5<^oLvF5dO)*@Mc0LcPntY-2DkLNX9T2QQ
zV*}(QM_)ln!VVV#7F?jS7V>h~AN&ycXemiezl@%4<nT|lgd$gR$~^l=kTVcX(P*B1
zMS1cxyii8k%3GHp-q?8Cf=$B(3^qQ%8s1D_e0(cw4wmP#r;HB#64Rm!^W!EwWY`~T
z68Q<D)BXrZO#AWIjsbQMLlWT=t$4=VF49yJgeiM|hdu8-GZ}3{Y3lV<NK-aSQ}2eP
zskhF7b)5umu>d#ko!sAlj`EURNxC8QHU-5Mi*G`|4QSJWsKJ7kBx3aj<f##+_f9nJ
zaPrh-L=2Iqc=AihQ|BQ;Tq{o<#<wBzREvlixRao9K%nvzya$0w<Lr)^-Idk^VMbrr
zEkcIZZ<Dzk9;I}CXr@esaBoPa8Y=%H<sj*5sU=-um+pG;3V!9^#gK!1<@Lwz4vQZ>
zmbA5S%WyK*&j)0zL+t91j1_@uT_<C8MPDOh9mI#fDq|&FBV#2{#wxGAPR1%l{t-&P
zYQ)q3NBJt@TKS42<S)or`c3+58-y%<b}Ym!eRjMhT?J62Yox37y9T7IbPgv>gKmWX
zkJ6QI(r-cAaYxogMx3+fd)K872v_>Ie1+>$ec9!yF5fd7QbFmD*z}wjeL<{C|AD42
zh%Z?i604*@m{D1vp<>l5sL4>V3LeHGHf6x4)5A7oy-tQ)NUWlSRdEW!)e`49`!~T@
zcSE2$XMgJ5Ap#Y&z&O(|?rkih9I@|Y==oc1E<OKk8{fU}*sc|*fN2+Sv?_t>LA`MO
zl?U{~f4*`K0#)`aSN_`qmD3Wakd0=?Pu}cU5vZ8$O@jm~zzr6tcssy<SD<2FeD@y*
z2~@dgQ7>3Y3Z<#%<mL6`ED5(H&qX*`n&JiNl%@#B`GfJmINk<~{}*YBy><?>ZuW*$
zN>iYNgKVz9B2BT+DWE_yd`(I;AWFf*@E}p@1lw!MANcz>Y_(_Vx%$nWQpcB{fCh5E
zJZH~4k2gp08|*`EWek58#1f#So}cmx|3JV#JUU8#Z#xH3>Jg2<560s+FZPXdE(lbA
z#B**l9v$94+Cs9_v)9N{gK3qMA6wYI`pxTQsiz<pfmvtavb<(bSvzE@#^MC$#YS`|
zZh%UsEOl`|mYW*9V2^O&(lvi31gbOkwRea>b=Wzvx$H0ms>73a(X$1wG|GoSbqnfY
z^PwWSHr?GHaHqY$@KlBl9l&W2sRnuCbR&3S8Lpb5xKw<HU5oz@yO#eSxGO3*{<rwa
z|E*@v-EGg^&Koy9X(tzc+VypN3V>4nuRv%StWWGW2jrpEzN7U#N&@jLKvCsu1ELB@
zA=mb*{QgTwLZPgY7*RYDvP^O!IDtqaxSeDto^cVtZ*J%Gso5ZficAtOGKq>?8ID^O
zT#B|HDwK4shA7ekQ3S#7p|-Rn64fcm5I)FaL?T&cNhIG#Pg&Cz?`JD~5$8*N$OGp~
z=i(XXOXs`|R_U8DCWxR6_p`n5b*6Ad;QsHw;BUVQ?&NTsF#-AE?j!6WCgKS@ikbwq
zF$gkzW1PO(;4{@laAl$UQ~1sQ&<MEOpWyU=7w-1c@rCCcq2<<4M*2A)(TckbEsy)~
zO9$Wb)$1XBg;i@IkNZ_fs-nf0T}USviryHGZlucj+Gz2ABFLMEi{2DY-7;MC`f&9A
z;i9*OquYmzu0*uAU^DCPE~sX`QO5`bnf{W|BhZp2Qh}cPK+E7&&DRyaNbolUvU@oE
z;@U)KbkA_n-AwIop!P51b^n9JVbpM1wDvO9a7Twz!`XAL(Zao+M7a@O^@-P077Quk
zu9Tt@3*Uv99o-3ZN)b2V8={D-;I^50GXy+1xFLx^sIS<BZ*Zs&eozX-t2(@~8N$Bx
zufn%J9O@HVCVtSluY!c-()Z$&;Fp0D6CQxa!x6ezuV?t(_v73kT+elW6*N|fvSE|_
z=GI=_KMiT1L~y`CRCW}d>-(qQ4Z_pKJ)h-eKY~p~pE%c&kMip0XMn3h;OZO?rj8L6
zaxBL3VSk8?VMd~Lv4s8R12*hI;)6YBZ&~9Aw1}UIS1!WsFlR?r^wRhSD(flhhZZdk
zmP_>g&U0nhBRWeq1g}smQrO+RbhS_1riH{(NBqZjNBl?NF|C-YKi2T`5q?~)eEK+%
zulRAb^6BGLzT(H#nrhwXxA1MNFrKuXizZn)P2P)*$3b~v0>zar@jK98u>rBQ*}1R_
z8uuy`4rjf6ei=X5H<iMQ*L}FsU5_^yl&F!3<KU5Q{RX#wqesVuNs(m@91l=$(10J8
zm}$5O$>Vz*2kv;hJnoK0oXFN|*?eF+O9fL6(Zduic^ZDEz>m#Qn5w}(O+V~fV@q|G
z!p%n7F(^V>GN7ci&ko{mPlkV4WQP5BA2?e(Gou2teQ@>f^Rw6_Q1@D>%Vyg1%m2*o
zgMStPsAp`!ve<yFBP?cATNA#qnsCwjxdNXaKoWjtMQ8igp0}`U&s5$y<t{icSTZ)X
zSpyI~>%$w{)O~%o!w|`(o2tigL3%;sIs1a>x7I+m@%hO$T=qZS0HybQ%y`q1u)t_*
z#>!;HZp$$%rXM(FWu{nVj9Dj@04cyB?H`{S!DLV|OiRK~+kPh7pIOjDLu4j<tuK`9
zHG@xf$1|-O(#^IpT_@8)8{cL!U6<uvnd!DjCd_Wjrz%}>Ya-IExWQevBZg_Q5}uZX
zpSB*R?X`RxpL+mHT*+zP19tc}W?HIq!enS)O(P4m*rH@m4(q-qewt`HVGguK;63`3
zMxi|ec3!e;HMtS~uK>#Ru)pLh{TXy9`5|r$_Q}+P6XvOi1)Y-Fg5F2?J-FCQz4;#p
z2a*1O^%jvJq8Wj@83D&HtJqbzHyE4>pNAXgW5=;;t65mPHnpRY-6pqR%z}1iH1s$5
z7w6fZnsHDfgr3l?q&;k}Z$dCIM7H7$(p>gbEZjBMX#RTR_zU}5AbTd7zlCuTcE_A5
zu*??b=*X<IJDzN`J8BbAJG<kBjZWX=)Wgb|M7v{gi`}uj9X>V}-vw>yZm^wJyH=CM
zq&bkJ;`iAdHCd9fVy@tm$+_!ZG*=Jbm9uYqP8+px(6IsYObzL<g%A%;6H25|)NnA{
zwTihwIEy!!FgY9DU!Q<LZVRh!2aIzohCAv}Q7T#cix8NpoQ^O7M3gl&0tQTBHw8|`
z{D4&<_s?Y>*yER!a`M^^r;74c-K_!=5oD55Kw>&fMIcu{%kaz4`$7&)g@1E9AE`1X
z;zBe(OX)1zF#>z#?MQ`v4LCG?k`7JJUgyx1vp{CS1#GWR?58)=pJOVdh0_K5%O_C_
zFby^!whFGGExYjuX?wwD=H;?$;@=WGI=y(VnTz7W=IIii=ak~7o;?d9VS2sW8D*du
zStSgtMdu>{ASOxk?0K1W(A4BzMcWW9QnzE+jh@qj4|Vte_`DtX$^C%pH>4BCoXETd
zks0=s9-!bR8=Q~YQ$EDYoJIgiXV_s?Lkx)Yldur^!bZI1UgFRD;8FGz@CUdE1+Nlk
zxESa6!k=iSFF&a9`Svb!T>~irHEfrlej@^}FFydcSMlBRGLhg?BrDYqXISxP1Va<l
zVDQ$*$lEVRpvhKBlOa`;Lc2Wz97D_#&oK_oLLf0zu{#<-LgXl7tA((Z`NO;EMJ#db
zj?GythC^)b5!a13z)0Z`im{g6A*Zr|p-#nCv&@JUue-!pDmbK(JZTr~YoEZo<;gFC
zQEPvLUc*+d5Fb3+%9~K0Tsvmqin0cB82j4aVSCq_3}Bc}Ml&3HdFxi969(rA9I=6{
z6sMW7tQ^x8<clS?2f-~I-Dt@C9`w#r(F+h`P0O%<+K9|ROmz~}ljDH#tVaOGvlRiB
zv)-G#QNwnW0E65$qMIvR2Y>U&@b{TpyUBR8?vU_;=II77Mq!HtHH{L8zeqGQ#UC)5
zJ!sPitXI%#a!wF@c`?>#BFlh#>;?m(&>`(vQ7Y4qc%|&RAEhSkqYgy~z<fZJS$IPJ
z>EuA)9n67LN(+xTu@vUQmCztg1RI`q@E;;Vh89B-*P_CZP{ctUYu4UIi=Gr@sVsU>
z1gGC+!|rtvnF3f-#{g?`Hl&l8!RCi`(EL_`s#L{DM`+v@2?jGL@D31P71HPx8#xiG
zc?cB2H>dx>{y-1?j|NP-AEoC}l)4U47M}uB`dl$3i(8?&$dhLJOQw+_VI^($VQw0*
z@`;x+3%kLs(WS_pMa2NFCR&s{9is=Mm1VNy=p3pK8tIlmm=WkuIt1n(EJuG6D$S%A
zvS-2TH*4r^a-hws+i?t2hNC7!4X`8{vXlmr8Xwxpl-NRiX#_LNy~3X!e6G*JXM}Px
zkI{Y5WPbs!g$;zf&7?bitRUr)#U1C5iRj}<W3e!Co=qr!9ii-bBAA00eu|H|d%~Ox
z9Oz1nFf-vj9-p@fULT4B_$g`BAZ)-I;ojR1bMyJ$+rLo3POu@Zx?RfX5U&Oxb1^^0
z_sw(h-L5rkR8^>EGqWmeHE=CyZt|2Oi+j}y8v{GbQtV5PS^+>D8~~2!@LH>y#39+*
z9pXm<W2}*xg&CHZH4=H1eD;^Bv<*cF#g%D>d{><el;~ZuugtWo_O;|$R{vX!3Ee{o
zv>EQYr_a#{f>`}O;5L*yQRSaMN1_O=nWEY`im{H9m6VzRhepaOR^gD*J|ra<!&XX?
z+|ZP=z7Dk8K=EXTLnCEvt|H0ahDOS|UPZ3IE>d&?DpJ_wkOGN5K}FVGmvXBrEej;<
zc1TLmW2lr>LsLSkjKLSo7McX2R)HmKBEdqwN9lPH_BRNQvV9BG{cC!~Gyrw(#)zXC
z1h&uN@#TK_Cv;#DE6zcop5E>mh0Dn98*mQ#C{!-HV77pT9ejD}E$&tmW+{<y<B7ep
z2V&q$(xYd^$o-7skMMm8GPwVttQY<}>+u5ro#KV?AXLHB!_BiV!JbwVd=A<;I>tPd
zD8pmSL+(iRUZmdFtOtu!pT1&2q*xF!)_bb;u37KXtoH=#Jzc%ev~rjk$|1{&UuwbU
zs`oXe;T#{DYkjI5`1G9hiS7U`#8y#POHtjcnl>T|9^-Ib3P$C_{`lXx14p7V(+(_3
z;qfHh2Az#-1a{h8Bj8)rH6p>i(=~$f2S~07ZafbRapU=LUD(y!{m^mzue$NX#sIpj
z^Bxq9p=_CpKiRJ-|DBrUPxcoXzW6_7jDp?3m;wKt;!hSa<KD{955kY7xY2|o%NRJa
zwESpJpdU?;-*}Lp_>)zL^nK3OE+@zfzBHi?d<uR%=}$I8&$5O5$*%TIe@pKPm{IU0
z>l~FHt3MD6hnxD+Sh!j%NAqJ^olwfa@{f5tNYJUbq86e|6blqr6m~xLT0ZZxoPS~u
zRL%0oMqqb|?uM|(2ebD|mk#%Q{6WFtpbxtsm8fWTCH#hFSHjh2b|qYMW>+RMA~^#W
z-*1DOC<3-7v-+KBEla+REfLZHV5&~?r<*@t@~3B~s|w?vjVoSTSGs+p^Z!$Ick8Od
z69#v;Q!Q`;6P)|nU3zPvcfhycZYZo!UV5(^1@Co(+_t(#+A3WmT_`?&V)zrwAIrgD
zlczrb7pv<tM%v(D@S}xmu!Fs~lT*te`zY#vi=LtWHx~5ipZW}*-O&GTg5nqYUzAqq
zf8&@6`rnX$zQ5*Quy`|4{;&8K{0egVOa2A7SB1*^*Zc_vU;kh9CzylGt|>D2EFb}l
zxR$>Evc4U5fjqE-wSw{|sLV_2v+%(>R+izLBlp`v;a&<k2fm^Z2Zg)3=JvaTuDM-`
zXy`+yK?0!8eaJPpmeSqi&O&JV3Tf3%nUAQG?;b8%)S{wQ?-?#S0@*2*eFO@29deob
zC3Vbj(ONjQHe7UfxM&H(MYki`TTsu6L+Q?nqY^0ypmZN&gK{7dsi1Thi>~36?k$3!
zTJ@CS@FxmJMyC!JO??8pTu$^+Yyvjed{mT5xI#2s(4I$^A~C}vD`XGyoxRL39ibf6
z+Y2NFwhTayQl~Kbl_imsM&tfn!pEZdKCBVQ0m#TS0@(}2z<#C64-D9VB#u<N{90xJ
zUA~xs><e9!yA``u(a-)QWCk+XK~WZkK~2nmvR=yZ5;g+42e4)=VjxPAE(uL(ZMbW5
zq1q?NfNGx&V5#<7FNtP9aN=uF>ra4MA4kkOZ`149Rv_jgq@!{lE;Ql058uMtearhF
z6#RO_bBM6C`_uS1j2poJ!`|D#M^#-5-xJ6P2=NS>U~Iw0cIX|fSQKbc%q62iCmJl)
z5N6V-_?4<fp^zXbkO>JbLrA3-Tk5qf^=hSF?Nw_lTGW|jPDnsB3ExB{;qwdwB!EEp
zN}m7PdnO-(eR^;2`~IHa`#${0oPGAk+H0@9_S$Rjz4kh44~2#D2>MK%0scj}#rj(x
zdVr-Jh=czM;cq<Z^ClNHc#GZDl!gVKTSWwlaA$YQvIC3AShsRvQ@t;<OY4k*T-Q|Z
zFT}c;%bM!_CDq*qPX45As@q=$1?d$~5SSc^UOk>;1xcqH`DQPj^PHf=X>^^OCoEyk
z)aMC)^)1=c*p`*<YGarF!3Lu`h|pJiUF=jU4ldUphQs9^Tl+s@o4bUA;h#GA`3XOn
zB@RX{C$^O{KFu1tW#;veKsXy9y0qG`qJNW@%9?&MW(Wflf633_pR-1!#EjjPP(mcO
zt0+GD)VFgv6afd35ENryLPonWc@N7@5h}*yL&oG20OD+Z;HCUs!QVIe`?j2Jk0^a#
z#x;xaxA;12RtF}z<73|XCZ#bR(qEY=-umQ&x&bnb51br{lDz*cCka7F#RWyQ*FCHP
zhyRR>6tMq+C+{hLQcpfqE3{^JNinAcezQXHf!e-hz1{>E^_ku0>IkueT%#TfxAH(}
zZzZz`ZGBJ#2_&8+g5;v=1{u7gFQqQlyko9ndlym&AYL2ysknUhkKM+!u*7_(V%Que
zrl3k<HX~Xp2~7K3GOd$z$1y?kFF|T%jax7}JOk)%;y+^6Q3p>%kGcG)QFaX`WX2DE
zqgdz%>O*&KV`4Q@q@E&%ZyQ^KZX<__{yCq?VYsW_sI0=&I0qB)G07X`XB!J%#nE}Y
zjY}Jiyed4;e3RXoB!ea$H7Y+s2+d!665GFPhb9swp0nN)Jqa&#m{m>xNZhwcfgzt!
zB?Y!g0X_~(fus#YNr4Yy1;lOLFaiFS&RZkRQXkGGxBX?w-SY#nR1g&Rbqb?-orNfK
z68pDn?K5H(tcq2@a^{Hx{Cy1ECz=S5YidLYON*!OroTFj>Vu0glKKP|QOArB!Eu}f
z%qLquA!j373dQl1%Re#7o|X-li4bqQap`s=?|_ll7^Bh9=#N#C_ezs@DH;uLBI=7Y
z+8d|Q@b`3qgHqtIqS4U*j1~AIjfVbA=iRMn)P(H?4IWY=xzD3fW1L1qeVv7j`AxdW
zov{kK(`XkAq=~duLKf|w+6+}f64=2WO`B1@dl4jhU8EV*k>e-FL9B+!gu%?q!ZOe)
zo_w4lmNEITkrR<Q?7``9U(Vi4*r%7<n9TmT>yVMtGM;21u8hA-Bj*6SA8!bc!^=^l
z>@t=GhGY15rL6Cu;doin;H&Q_VAOrgaGgbjE|qBSaih{qF!H0vj30c)-*IDN7&PUe
ziw*G>E`&7h<d3*9j?cuI5(M8awh85<KYP)Md~n?K%V=+7GL=tnRNr0g%J9C<FiK@O
zp)=q<sVl<^I>R+8162wH94C=Md*e!ZT4xx%K&oKhbD?U=WW<zXKXvkGS0Ygu@5Zb4
zI}ni)*q261R6=`47+&e4G06v^tTO*JCM&rGIh&1~bw*Az!<cjY$u<0;4&;1n<b1>!
zSA`A;$8Sa!<~@<X(UWVv6|q4yS1UallM*i2X&S;|G6S_eX#x2lRYtur@mPT|V;B4P
z?dt4_?otI#R?|CTru(3J^_1IB{$7#snx)c4A%gnM=nW^U87^dm7}{4;%EvmRQxOA$
z1aazAjoj*y>5n>7jAF4&eZP>YOlL|~kQ&&}o8KUYu1ucLZ9Q1<ILO4qW4D^X92m^H
zwjfd;Z!q#VOM%UtNzC63xi(8I*xY#4diJ4jyy~MgrYo7<<YnCmzHn>gu9Yv`3Iz4B
z+x9f<=LRHlf{I*O65EY@Vzu&5Dud{4HLFW#nesA<!1;tqrn0?X{qZ8U{MBTbUk{Yz
z0fI&|XRr8k5?w%?FU5{mC31=S2p9nB)td%<tMSB3s#Xw{xmJeiN0>D&5`c*UaGSJ=
zk^007aqO08?2M_~h+U@P0AAq-7}46L76b20Kp9Nq)TeG0Vmh~AqoJt^$lNW@l1|KG
zHG<N*I7*}bQAC(iTe~5GQZQJ)bnBQfw#8Ub4t3ZImO+mSDswe6vCRBT!D_xP*YmZW
zm)V4q`C9ftOLxFMSRZ`vcgp%emDIC28{pD#tP2MB;m7%1zWz}x76{`5TiuIqx;(?b
zAM1lpS@eC98Q71LoHNP-q2dv-J}}+&R#xw}@|)g`@e9mmzicWhhZr9yO5GB;Y1Pf;
zt7Cno4NY{Hi3MijySJ9Vrur9_5KRg9Qqug}0@tj<q0Y;~4nTMhFFNn?{2K>O(wqeo
znBqDqptX|nc^DtarL9Mj#P|R|Ibv?oX?!s6F=c$v1aP|IO2&7W0Rj8~r*Nvz<p<T}
zF~b1q`4}S$bLyTa^qOWQLNCR6^C+Bi(7+3fF>ut+h3#)mRE7hh1_gO<3<^)mdBEc;
zR2j2bh*>;fJb*(PX|2?`x|5S)b&?um-b`caP8mn_<AqJx6wm)TnrtPSEPiG%bz?)k
zdgeFi4QXhnr9t`I3U_y4lwTPdRL|JMxd+;}SmG{}B?h-F>AK~QCfMT6WYV$WfEi_F
ziK@(6S_SblMQ*liW%&`)7s29vnZ+u8Y?n=XLLR=SAWmb1GXoW(9BKuX<-FqAm+Q#X
zwFa4@I5@rrna*2}HOOoty01Z$g4b;gGDVGwt~JO+_1?7x$x!cIYmgDVe{l^WFkwNV
z8V5Df8q|3aEF2TwWIzWkuTEn2F!K?07O9p0xG|CDT{Uz$a7;G%N$kVVfXn$A{9S&W
z;{bI{pSY!iv}s^P1~q772fRioONa4l;UhHYvUE66bTekmHDZ^GK$isxCt9G$XhQ|L
z@v7ZQXzxx_;SuPt6BXEnOBIxtSMZ4D(uOpN*5X5E1dzh~0U#NwJhy3pRj<PeR=xU_
zdo{!ZHwG|%Fez~9#3?|Hf2I}aQa8tXb4g^)iR%{OGyO4FAovw#+B)L;)9szs5#(mo
z^MO8sl(qp_!>`b-_y?>b-j~HHOQAQ^BeqsC#|I9(-%CUMaU!jDOE_`_zV`njSjIm0
zs?hv9{$HLO0qU%<V&8hTTYo;&uB;<4&1pg(fO~|#SVz2uG?vArEQXX$hZY#Oj`$<t
zxOK#<gk#nbpb=Yoigg5Qmbi7qj4ta44*fEK8Z(cOHi#WW%tRu&(?minBra?l!TJZI
z2o4W1j_76>Atn%pHjW?-;~VTEu!az$2rMGTm*<zk5;#;rUD9R|ZZV7K&5Zk{77>}{
z`6Ya|CRvO*u!xYn_!}VNO(}(27&(=c&6rM$2x$(b7C02x|GGtlIF|W;$RgsTvE+x)
zT|4D_UF4y$<Q356R7)`&rcuIhda_lYZ(V~$gqnzrC6|kslyg%G^qjdFk0Kx0CgK;_
zJNO|~eQca0<G|;pXpZpnCLUaPi+ONS+cJOAB5_%g-a%QGq(vfrT&RvqXh~WmzLcc5
zWnN0sBJs7Pi7NfIBrOu(PRda4ZzpMyh~E~rWuDVOmB!1i680JDi}sk;vqOW`eKzg^
zwf;8V$Y(WkZw-rlEe+$}cNLAIb3#{^LWr8at+Y!>g%QR@t=M4nX+;7}waIT`g8a_y
zg-#9$BoB53>Y<!U8CYPbH>K<_-3ZN)U-#C@v9REakCu@HmEdEMF*yhzmgzU*YFGU#
zNw!U7m?9N+0tozQPE07$o;smBC3T7tiu~NArJ?%$yOL2uRgzI}WG>tj6O9!Eo|Dyr
zw$^B&dEEr0w${*{788xnO^3naGb$}w3SL&<<Lwx4NN2{3H#&uQoVUJU%dtxdQspMW
z{k{l4A*)P-@k8{Om6`G~Mr5mSHEvr_AYw)wWc~sc*mOvw-XlW!k~eMBA?{m3mUwT$
zrXx*kI!MB%L!_&==@1mK>5!Hp97j-F%%;OGHXV<iK$3QPZb?+Q_ps>zoGjJ^EQ2U+
z)1ls876PH~h`^1BU{qSwo4T)KHXUSUEvIZcgkRAAl3$lWDFl>e^Nibc2#+EO-xmht
z*+h~em)LUfj%3uP95J&FWzIpovgQy&4vLBSh8T8e>kXfp%EX!jLk&uIH|B^-RRB~3
zDTzskFt<p|vx#EUp=7U;m+tcH1rB$4VF^ET{mP0XQ(JLpBMyH5Yc?Fv1Z>oXnJjIE
zyfU8TpiTDN{$I7>n4~!HH%p~caq&XWi0c+*!yzxC@kmmS#Sgq=c-Jw8WdmFgCx_Yx
z*DS^&#8LM0REdlq|MYGm_Xy!a?W#rX`SwUuXCgXLrt_X9)4ECuhxJTM)rn#;(R5y-
zqbsrXyu`j;iH`H?v~?wlSnXM78>}KSnmTRgm2B-w6z#QVNvkVS$?h&9bUGnbM|9%1
z3=Ej;yn;xl2}eUDY$+3tay|_!K3bl`Pc7V(o_J4!E%I9;V~d2yzbJzan|m?`w$I$o
zf$jFg?MR2wrGz=KeQB{euzh$bAA}3Gv{O_1K*HI94(l$&5@)&FpOM#g^3Eo&`@YDp
z$+pxJsQ2I!!17esOSrAIQ$D5^ij4C-c;eH<njQI0G40EgUtf@GaVH<)=2rGtjM|r+
zbV<;-wUR5_WhX79jVEE*$(1~D%_+CBRa};Fb3M)sR5?#znJUB)CkM%~^ZRc1p-T_q
zA>$a^=I+3ztdj6bgx&bS8h7Ah?6~hvT-Z?lty$M)21YsEfz6qLxz4_Btgi$6J>_?}
z+{Oo^467gQad)g4Kem0w{><`G&P*<KV}-FFB3(O)BPSo}BZCVM&H84K;&+db;+I=%
zp(n*N$DWhookfr3Q1r@p(P2G{_EkkotFN+_bd|=paA)biNa-fhRK;H??dU9h=Y>l@
zDWzZhlG3T2r5zV8eS?&K=u1ko2SuX=^M*s6?beucd$eejrrU|T0dW-|xTeOvVQZhT
zQeX`f{Zvx=#8cX>k4VvF*51d$t~8w5bxAF<lPco<J^AiQp3;L@mQ40|O4sl$`I}Qc
zW7iaZ*AuA93T*KN&Uwn8c3JBc&pz$)EbJ(}$Wv}~+=U&|PU|Pfr2Z<;*d0Y%J%N_&
z03R6S3xeD#%*ci_I$^-}p7NQgRyF;G2M%g`I?ehuSO}2oqJru%46=*1WWy&KkbINy
zDHu>bNcdD5PZy1FNF%<SU%lBCKb$xru+LL5&4U+lN*>Exl<6eu_@Zp52jhAfTNxg>
zbxh&cJ%P`%DvHyrX6j!UoZD|gpnXDlu_KzuZ>kvLe>P$4=Y;^-nN=|>&3aE|o7a0n
z;4tw;Pkv})Y^}+3Iv5u=D_c>5+k)l%;b?;Ut$hpeuX&SGvWTi=J$keqcGmf$eLZUu
zol-Kpya+4n7Fu68M`1KS&H7#^Mkgnf&r%r80;3Z}pG7B4D4*|A<ScY%Sh;k|Vj5T$
zEHoq%K0r=c9h8S!-mWgM@&po{Tx4|Mtl}{Qg<NLrYrPX`?}+?>*9l|K#v1x$npJ;5
z=rM03*ocRyRI82%)hX>*PH|_Ff1ZjQ5?-Nt4EA-dwNfdq&kEee{aG4Ci!_aC(L4oH
zXngz&Et)X)V65t*G%L4f)h=sNyz0YJ^@w=YF6$aqH5XL5d#&gt*Eq*aD4*xbu6Wf?
zzU;uE?1~w)v&wIEWCaciOAgNt+yr*qjMDucq4m=5*@1Ik==W^8Eo<x{g_oxSygpD_
z=k?AG>?Ph<cqbj|DbI9{$tr)s;jv47)tOF@jT^DqIF5j4NHfa%i4+d(6cFHG%?3)y
z`WmP(gdV3``AwxrQKNi0bBuhma}0_2uT?%$0O1*Xb7~>`H1Ml++LB%{qZ9SU7_BYp
z>s~FK6-`yRsG6pySp%uY9SFNa2fy~Ai)8B!8N6KPW#0njL%6?h;p0%jItj?=gQ}nB
zrCHl}qu+}JSnM1b6uzXA*T~$Xk~=O?2{Pg{>si4Yhg%qN?dM~2#2r?BWj!k6U)9x-
z;SxcxbsyZ!I91kS@5#6-t2M@N5XKHvTThXlptS%YR~9rDo)lBgiu7Y%#9PJajXd7_
zB}F_HNsDqB15to^V0z7*k0W>@XQf0e%4Ovd6}?}*%V1zn)%qb(GGwiGB}l=O5o0w2
z$yyx;7tcF3p0}ZU-oHrRrLnx$PbEp<-AQI;P!_oymF4{T773gow{**g&Rry0fy|M&
z`)I{zh?iY4{3o;sIWNbmPfwQf$bmR8bMJft*9N&GJfQ>Q+@EG{vY{TNDfNI~U&!+9
z5emrUutq=~*e~=G$jS2B$SV-w;M_5i3m~d&YIjiC0uWG_bb^{IWq;QRY6xVvmh$>0
z<00i4kmuOwjh{NXGH7PQXpDq>ne>l&0@oneH@O#m%yvB2k@w$TUU<%CP3nX+mUdaU
z@(MDym%n{RG#9Htny+vkEXn_(ld}Vdt*MY!88e?zst*2R9^2jCk-6wZM*GJZ{`QNW
zOviK)<!W?eF$Ar!{~o$$_fF(`YLln@&q07k(+IpFfy)WVRfOmz1f<@mT^YFCyz@1M
zhKC`|r_=2=v=$VyR8Q#eII!Xhp-Rp|KXZSI$CrxHv*@Spy)Y1&b&FQqq-PX4@2yeY
zH^%ZQHbG}PZ2cDAR@9fSuvYBSZCj$+Morw&$aap1WvCeKpcYX8@e!qAxvZovSl^Gs
zVoa^Ea)6~NxLtIvy?Z+eEc&8l@1+0VB)PgPSu{&)A7FLqGNJz~B=f-=x1R%v1*3$b
zs&5`44cAn3HlH8HbJI0WYaTfzu{50FzSn(^J3ms6RN}L|k-JIhX7AWd-z+&O2ECq&
z+a`JftDRy3Jo1nyKr0?$a6SSjJ%XHDrV>1X+otgM2%gZUdny+A$-CyZiTpB3rg_gR
zq@j6A)`$-43B0<3#~M|NfJ8`Tp1^{o`XOjoe`Dq`{xp~g-9DzwX{*j~^LI-^b;fPI
zt26FQtj@^k#blRVK71{yNj5)jOL&#7;n5yQY5XbKX+0^!ru+qs@|qwEP`LX?BeE+V
z^i06Xl}wSm)8{|R@C5!tIFE<s=l>A;djh4>OGFBv@@UnM={jwMP7~H8txZ2>>$EXC
zO&Fatn||}_v<&@Lqtp88w?#V5qu=UunnS-W)oBy;+g6>Hs^6CDG_QVZ(rIb>ZG}#o
z!lUpy*n!K!sa7QnkX3%KBdY?v;5h~@w|%VP&7w(s=2_TSv?WflEd0Qb3q>l6>68ID
zbG8JSN~emyl>*4Or|=p|a|HxtWG$>bLAWprogmE`t03>UHZ&0(I4k<x#t&`ulc%JL
z&O$)lo0=7P0_EUdAU@%;9wTEXf2~=gJ8Quk;J#+TN`9rRwO941{lo&N%|8ZRN*oiz
zAs3aZ_riN%0PFWM7E8jyMPE?BJmoz&(RxKei^Y|$nQeVjipDdQuJKr=nmn071~7a)
z<wJ_7I4kgJR_PvmckC&=-f$(oH<9yyr3Y|VtJZMYA0@(C4MAB6+RN^eQ~%_k^)1MQ
z;OQ;g!a8oB8`qU6aS6Ee<5qS8yVflYa>5rRftTrRV(jz;#uZPjb(d6^i~&rh@j!^k
zseHbD59S_84l3d~B$X#dTkKr!tHUsZy9Ublr%#ai^m`!lZIEH>$6IB+OapOWmAE_Z
zf`Eh1{WDB=NxRfAb23ij9QHckNg(MJ31C7e_EQ4v8Gs@5))MEVmgHJ%6P?DJH>lcp
z8_;PF^TNQyGaRbMz|Q!aEG8lXa(E^nX~?v#@;3TTdBcvPQdQ^SZDfN4hmMz;3D^fq
z4x<<sA;z$L=Lm`x&vj<d>QnNeb4O;y1AG<vY%gQUA8`1@r=PUlILrIXN@U&{buz1T
zA6<1~yfMCYe8ru;#*b|_mOMpXpkLj<PARtN<G)20G;!l&Z`QZ0tU!%;(%VEC<0s=q
z&!irh|C*DcxJ_}tg9s^fK9U(&pNY~qeL^72l4f?G%;~3JxjDQ;h$H4bEczWO6^df_
ztt0ZD?O1MYpfU67PAEI0IiwZYpX!~tsO_eX!h0qAy()WUeOIoeyL;psBW?t7MF!En
zy>I5#QWrKwaE|fqU9<X2PwY8rToaD=Bbcv(p5?G1*92Vl`UyfxIxTIdu%aWyLXAFZ
z+#@_Aa~b~7;L|E$T)=W~m232hp_fz8ihjm?V~WGb%)QtUhTUTi8w;?JXH-C+k$giK
z>IfupANUCFot)EAqi2_E!hr7+I2X7T!#LLgAts;?NoVFeCqCBUzE9G@;{n`$O~t27
z%FBW)Y!afU*YcNANQ5!$8fQ0ROF9}CsShc}n8u2Xm*M@$Dq{ikeM#3yIoDvPx`kUA
zO)y-$4VQ`Glrbq}<g7O)MUC9`Ms5=fWw?$&75jFn+L*Z$KZ}*E(h;qOYbW8YHnH_;
z!C2|qqz_b{`5XnzYAovWlzo**D=|)!MqHczJCY^(J&7g~bGZjL(K5!-EG%1EHW(8t
zSN1l_B8W8%r>-(wpQ;L|Y`ZoCyhk8(Hv=Tg%3h$=*thUX@>U6AL2Z0?T`aFc0+T^8
z40u9WpKV22Jg{5nbedWl4cF&{G0__@#%7tu&biKsJQ{Zq5yc1t%O)fLh@^fhgR+sI
z2QYPcpn*WkHX~;{nTsECPBe1Z$8`;LXDjh@hS<t|;y|GV7ZN#Vjhw9*o}Dc)CT>{R
zV3fVZu%J_%WIiExmVJi}SNb=3GjgJaYmKI;7h|%@<D}-d6d3!0{E4;Gy1rOXh=+vf
zC%ARk$mQ%t_+}OnE$xI)@y9-PBUm?5Y$rx((U!tXAdIE_fjAPYqKV`Uo~Z0qcp0?Y
z!CO4-8l6Tp$<*x)8#z^OW71CA#huFBGphYiMC=-&0c|@dKM-L9Ms?UWZIo9@ZK*eM
zHW@j)D7}T!Y~|--Lu`NOc4ZaziS_43WTN5PQDEF7>_gk~tE_t&OftS0XB?i|ze{Fo
zF&S^cv*2+|ajTVknCk4Y$BhNou{|q<ht)^c5`gC?3ZP75nCAOp_+H7%R=_Cf+2;-&
zNIDUV8ND|a7#=3jeO!(=Qq-wHW1>57X#CiNM(H)kJS7|<qDZ^)(KSyyZQaJ55|4=1
zYQ)4B#NBVD8soy^ZZT<J5O>p5_8#I+=+>3%pAmPvJTY;1-F7YRPGwy{+->~yJaP9&
z3R-8k$y8?2#DR&2@gOCnS<s*1EX3o3NinfTKe$WIcEIBmnZ1}nb{PvEWn&tZWad-M
zKZr(0wJjm?Fpk}2AVpr1z4pNR$TJ92r3rL7_Rb0%hJTXAQakH4f}=B33!YFuzANc@
ztrJYMSf<XKgJmExPFPCj`*p%fGDRP}4dlmxJQ3b%>n|``fsu!^G0jqIFa)}6z&AXl
zRk(p}_cQ0uSVg7#C>0a-{~-X{w?Y+}eoat-2C@15hd{&E4O6+17o>WeTiSLd+D0;a
zIP8x}R?4J2N&xg*X@g_P3%p2R=&xddq-O~*qvt!P2m^}%k{O*NEgTxljE(_5xKG<8
ztRAWGCX}9GcK?oDO|F*AOoszIsQ(a_rlot^VbA*6qLY1$MEag;#<aCY^&w==kcqrz
zSKRbVfpkhH4`7P~ES~BdK@clY(JR;z6ZJN*%;~2aC2zKK3duPNw`mWlNoB~}x9Uj+
zf#tJr;RUKPX^e7;!E7ZL-Cfm&tHsD!V@x_|<m@*lwHvwnja<{n!>V?N;W{o8Zn44-
z8IA-$3WWKsh_e$)iVy!0Y2eg3n=oy#xU4)N*_c0C4ylP@NG933Pb~=c2M~-?*8@q+
zt3Sq!TBep#MzN9Cs%MwOoq!aO(H-F5V|GC}e%2QwbD3H;OO1R*nTc%l=2*raQ;V=7
zE_Rq&#1eLzxST&BJ~EhEs*!ZZ3GB>KGcux?nMEw`XVuCNcC@ZTbZ*NLBcFMK@8r2s
z)}dn=Iql3LThttKfa1k0+exc7a*i{jR2maEGov8JY1e<yN1`84is{7gZK3u(Vrt5i
z#>Da)f#y13RPIVJye&rl7VMTWS^WVDQVULexh){~1B}Ll{4o>nL@Y;nPHiYOq}7N#
z*xGSTnVL8b$;6QiZMMtA5l_5HC(10;z*#=?dW#svwiwBq3~wE%FcY+beI+x2(BqJz
zNqn|ADoRJr5oQo^&);%feu%)bI7B&okGK%*xrFmjgX~vkG8linNzEXz>pd2g1sU$9
zHJA|^n?c}w`|(@I=piF)X~hTo*@9b)%ciC?pO}5sR5DgiCDY)4HI)=AP9LT@otZsD
zMrzU#Dpf;vPb@HG3jsB>e-;ajo)-(GzeE5lXT}jbiK%Q4$RNUsFn9wkW5#7x$s8Ls
zN}2GP8Lke>0Ip_Q5ecGg#V;+A%YVZ%oztc9dQ8fIWQO@=Y*13@>P=D-+PWAOc|!Oh
z6R7%_ao<{c?4G(~M&)*4+^r|J8rP<Lhor7qBwuoWP36{CCsd}Sfju&P*KlnUH<c*X
zjWe$XrVoB;X)wOMeO7<oyd<JC^dp$Bf}Z6PJD}{CktcGu@MbMRt*Q;Gx3-+8SU<K|
z&oq_NZCbG&M<MH3DZoq<6RC-RVzv>IEx3r;29iJ+I_rxhE;*wnog7C(V5_lUlN`I2
z+jq`n|1Yq<bK2R}s%M)gnQdgFHDYj@8h3=I?+fewA31_bm9r+1z*&LMv)LXOSCA9<
zKtq|qid8lb*hObk-@3k`a~FMr+C}G=!x47TvjT^>QdRak9N>W)_)6g;sj`RPVtr6A
z+Y4soSxHhiq%8Ke--jn`(aY2(7MuLr$m9-~;wb+^IcczFGmT{hs>K^p=f3%%?7%+j
zLvl(DeJ8NYV0Uv0n_k(n!OaGHh<A2%4p@t!w~EdVv~oDmH$k0<b+}!!``wqFvDAC?
z))-gR_hnVE0q+GY4XF54X9K<r)oZ_q>UxIb1yN1@M^N3#!2QQim4?t6R(62x+%LAH
z$6oqZ!AR|WzqLiScuwfO^p`(je|$PWJ@U4YMdkfT_q=l?Z)Pm7H8!577l2nu&qW5n
zR_;meT=(R=75`MoXA)!sD6q*Rr;lS>jWQ<_Hzvz)PK(tBETL~zCw<wQ_l%vLYLr#L
zW0tjE@S-~ov)4q4lUB7VF>kJ?^yyS~d)}s6PdSiTo0k>yqE0F_v)loGU+jSt+1q_q
zTA-Qbad?BxOyLzyg<`By&PL(A8zm2?KJbdCLmhRda?&aMA?Rq@)k-GVCY~S^lSFva
z8WL;TpSm|KyL@(9*4PfCtdMn{^^|aew5~<B?u2E1tPXsBtD00gUt0KU*}q%ZXq5es
zfLrZ?>*h^`o0V@aP>7!)spkC|Am=wPQ^t%8g?3M1yH$*ci8Zh7i_KF9rrleGoRId?
zmF?DM#h7e=Jx-vLiKfs`*0-dy)F@Yjgsz?@QYO~bNnjPI3PrybxmRMl@@-|@t7b(n
z6-sc1z6(I^K(#w`I5zA{sOy4Ft%+61u<zEBJ)61=>GY*d?cTIAs>^BGvjl`rvUO=K
z{D`Ja<R`m)x}5kLWzW!~-Pmjoxi5%ZoE|-qi?bOgE=R34B?}ano!<@Jal0>$+X*_Z
z6Sv4ZaC@5{k)YW!xE^ALfQssP{NF%YQ~YjXJ>9`M;^1EC4(@pY_ppHL);mVoPtg%#
zJ>vmntY;##WZ}}4v9+j=B1&{%yvM&9uV3@)YO1>6aO_P!0d!$HA*L9PpVW1B;(5cd
zN6WsW7@JO9Pq%mSXK*boE9XZOs;v`OMJrC&r_pLfD~+q;%W$0>qt2J$in)d5{6|qO
zSBwd&U+<1;ilEw5E2tK`Y{pMkDEU#0@Y8a|lvW65irg$EF}wW9G$a81f3jz@u#i|z
z=5Ecpfr>83s(uCZ%ep|Z>I5Y;FU+bURNt5MFOwQ86ra=7?-J-_->Ye*b-adh@TPT8
z(TzNRCQrBXC{N&IWCfYxZcXHUX}9;tZjkSuUlf<}+my}AopOxN>=TxSB!?E~WX6|1
z*XI*3o;vl>=M(=195fGWB)}&GJ{RkbjePEhDS$<LUu6eF`*4U2d@L#Mh{5Jkw1RzH
z!{$h(DAk&#Ko@cHffjMI0^DM4Un78z3t-G@&I26x*YXeJ{}>{*8~%-uQ}Caus`=;e
zHx%d?{tFb~7V9hj5dNY+Y6GS~n=-obl&_LA8!=S6*xFnz><g!P?E2_$jWtq@DIsyi
z!?P#I1_`=j;kBY*3MtEw@mZ*qij*hm8~V?B1~4d>VyeOE6lKv(J=x_C>k}vxOx?p4
zlvfaS55KEQ@3-!v^n}1cQBgO-vyOY@JX9Iv=y^`gd3LB-6n1n9W5b~Fq}kS`bZ&H0
zCqL3(+^eTa#ygqLiv!gq`~1Z=Tj+2f(R@nUMJq2%&v?g1x4Tc0t)rvZR(K675W*Sn
zB;c0bzWfGRxLgQEY4!eSf1OuGS5+pobMWam_7Y3l<dJE7uku|R7fsc>tPk!CWwKgw
z++2}-(ZYuLPn4V%4CW2tlUGBF{T&^lU48mj7LeoOZeSN@I{R~;-WNQaelgJK8?^d(
zDmW44LSBuhBH8)wGN5pk&XLFsWuN^38%1EuxD7)nAVDC(uk>_e?hjNwH&^6bbOn`m
z)t6Bw8ELfucoP7HcHG_1wX1^fJ_meNvjVH?mU^v+dccn%I+@a6hNuAQLUep5qF?O+
zsPlU>tdbIb=(LsF{%FI3*I4*D?D$6}Oo9>kh2h@Un#}?LEc-?q3YKc^w&Y-4B5{1T
zudjM8b2`*>i8GaFHm5&n>bXRH91kLHy}cswH(<v8(~xWB@vW_%iZbValFQw(+ZZ<c
zh%sz>voY+EdSlp>kTJ~rrZH^d?~P%epBuw6O56dt5`+orU#B~5rRgpF+U_hL)mHdT
zjv!zC8V0VSB31wwvmK>PWd=@X2aZ_#!fMv#n|yCj6KA8)xXjr~n5egT$hyi?vCL^B
z>;Y}LRp4Qj9pw3e7}R+xRy*aXzLUB{fw4sXLbrhhtS)28p7IgaFa!kWtU?*35?5gj
zH2k|9;hnI4D<!Z?3=BDYCD@jpfxLH#T2hgIIXSGKsq{*>`gjlSMsUX;EF8%OPhslf
zi!rS)t1V1k#HXwH{7g;ZSBWpOtjA1-G1&%OU#pU`I%<kexc?^96$qX{sI=Mels2)a
z#(5a$N$U!XDJ-1jZ+fk4Qt(&E`Anf~TWyg``CA&?8=~$F2gY;k-Df=C92^q8e7v!`
zk-rAGb?o-yzMkHptlq5qM+T#I>lHy;mbeR1YOAH*bkBFNdtxO*c$9Nw&?*$7RHP3j
z8an(^-V_}^9}=fS7G-0kX7y8%vX4=S(bTcgln7dH2Psi*fB7MyHR;efM8iF6?0*7+
z{99xH^a-a5MUnv(7fiAFB-b6NgP8NjxJ%nc%paBYV4VlS{H<zF?*_NRlk-melW>1x
zErF9;3A+hr_OC5WvielEclfGwzRW;yWG&Wm?%u)rwuQl2uFQ%7{W?Mu9;_W(bF1-A
z@|^{@29m!=DF4o01oOYwYsQYuikyD<i@&)eb8K+dUne}+aI^7FVQzcD&4I$n?LO>A
zGi*KVO}5eu;l35>`L^>7^<3?gxgtQfwFK3^kTFc}wr5wQ&x2UlV?8O4@}aLh=)?j4
ziR^OwXhI_)+~}7cz?K{Io+;Vor&~e?`ix&Z;2HVkn__bSyBFtF2#l|fldnMi^^|{C
zySrQj{*W}v)*ZmFSpNH*r*FTlJo|mV;&V*~cbCWDrFr;8?hU7K)7Hmb+B}XPTL=I?
z;@*2gIg8To+-m&wn!xx#3r!vn$gW5lizF&(Zel8Qm+nmsMeKM~>BHVeZ%_GGOWU~c
zvdmcnHko{bWfji}<<458%tm%>96hCbjjYhw#EdewUk=KsB$uCD#$UIKiA0cK`4UxL
z4x?w|RnIwH@+bqEioxIa1hSnN=P;i=B+MhrYzDhnL}V<o*ym}lxv9VL(_(>ad{Bp=
zDasRmOA5$ht@nVsj%MUmh&USZ-Xn65u`C9gt@;m=fdk{dFFYQ+qkKU9g!05j>-76f
z))n?&C`inO9Fa%^Jr&tl{FcA1J2laXopth7PLrkxj(x3Vq9Ih+@0C(y5)NP;J_WP}
zY?T~dCW&l^^>|E?@Jgl?@k|wS%N*ACRZ^KEiVT^KobYt@S=n8Q3xnCl_+61-!3ebH
zF4dlt13sxL)A<O<e#TUQ?Y?RoW*^cKS>*$&q*bG8vdWXUTW2}ViD2(#%L?rokX7>0
zEP5!yt~l+ouLRP_S`I{v4-&T`7v^6sU&;~Yg#$-TM2_|Um>bk{j~MTS)Yx0d-frg6
z7^EVBbXIEAkk$J^-hrGeI6j!X)p#d+5?o~S!^sgNv;UFtBikd2s^zaKGDQ9+1$dEK
zBWm}d!tPKlT&*(1DKAvF{sm@;1auWqFJlMMP?5BoP<BPio$1ISh_Hfm$(?EZCtKJb
z4A?flH{Xq{y`y5(?P`9B-a+5LNtp?OX8Dky<j2oo79U#8Dy>aGVwDfr?%A*pt$DnW
zX-zOPo1>`{9y~;|zJ`qRKyG2go6D0|1_ovanh@EF*~O;xAz5XXgtwC3&2*=`y{71u
z{SlCb_d=n-m@2FuAC+LaeZhSaBM#&I6p!Dhi05C@mA^#izwz(p-_w<Uo6i4r6>}c^
za{HSkbm<e!z%hMd&fj2d(I;H&A;k3w5S98n^FM^VkLw>4Rr%X~)|G!%0&Ss9@%H@h
z-T~mk%qY=`I*Ot?f9Pd&D;r*^@HR7*sE%W6jPKQqU29}xY?0GcU`)oy=vw>kn-XkK
zc?)x~B(Z-&ct)=H9&#~Xx`zCUcaA|C#N7m9IfoOIjU4;TSBa022=CvL-hl_cc~6jx
z<KdY{$t!?!D<gYo0hqA;yq%E1{~<*R`9z`5K8a9i<h#mHBD%D+?W4Il8bEa;)&Lu+
zNPsA4x!kPr*#}eL8`!?jz9S;8y9x|5+&g3q0KUC`tjrDewLIjkAW>ZokR9h}X7_B*
z>ukU1%oZKeEjj6Fom?189-yH7LRGaHWmfhM)x<0}huBB9{#+#r@qCi#VwYMkLVsSF
z`ka>pj+8XF%K9LZsMZIkgh)o&ztO9*MyM^yVvT?mjbSUgl<NU~IhNy~Py=J}Sz(_F
z9xNMlBn03P<wC$qL$zwHpnAD$tq@cl-nCY!jI9+C6X>zWb&sVD6`V@;8M0bvO6=cS
zz?5=HH!M)X4d#JfVB++DakUT>t^Hl0GNwU}#E?)PY-OqNYqSZ##Fq;6?fpoOf4?z-
z4;yACeD{LYvS{dRYOfv(2I&G-xdQH~V6h@qTO)ha62tXYD)};81<-l89tw5G6}s<1
z!|23BMsKRV_QLo|RT#jT4Xawm2@8hndb1|`>|Yrj*rZHue6RIM6}`PTj8XHRNN<wx
zso)wuTpbgcL9VLjR=(S$iqEY3D*000qDJnL*7Y*(4#M(B2B5Yczmrh?fKtnm-UJsJ
zrN=;?^%SSjx$BtHK2~LNBDfL?W5LBC@O-SeX12o7In_gj@xH}(f3L<e#%IAi_<EQ>
zI!~2x4S7JdF#kZwE`$P#(g1X3SJ`E093_G2(7RQ#7m%)$$tvu__-1+}6FBKt>WFQa
zmf`fvw^!hvM&TiR2x}Ue>f>Z}dL0&MUJ&p#gIpa?46M9Jo#}O)Nc;HItM@d299w&L
z^W+%Yx0mNfWH?9$FP|s(h9ci&tN=gJ$<F{M-$qLpf*Pf={3&g7%t#?uFoJNiJ$bzJ
zwC%~(h%5=A1QpE`Ula3d``43Tl*xjO{;6HndYkH>n%-c6^-%YYq!Lc&;vJ+j#yV)A
zYTyMsDDnu3Q;#Zp*Or{J*_t|xQt=|J5GVwf$%xO%!Bx^T@Qp@5?j-dCwJ7dm;^`l%
z^dJb{8<O<C3iS&LpzA;ECV+%X%gEa`|8?$Hylcw<D4zvyUS(sbO9=Tr`A`-zLjJXm
z6KgAM*ydLrGw!a*S~W@i+oYoT*zEKmVzm9Ek^?sAUviof^NrHq@i21gIlDCSp!fVb
z;U<5FWU`He^NtFI^;_>s<TN~cBWg28r}LdOF25>kRr{RZO}s4g!GD$7>pbr|)^)fO
zY)u~uetZDfN6lX0-Js{aOZI*<<>_^e<0J`VN*}<zpYY_f$$Sx+iukJ{EWE=>d7c>w
zgGNcEAUu1lpzOEJn53S?Grx|g^nXo2wR+xdx#4vC&DY+VA+NYk^HoQV)1iFJE*L2h
z5Yk$Ip}Tj33UxfWSGfYXH^?0_KJ#Xa{ww@ds36`aAlhVzdRE1t1|`ah{5ue(&JU3V
z_<qEn7G0a@<nueSwUX&fEFYjQ%gDitOf89)7mZqNq2TnVyZnL9@{v4diINTg78|86
z!~GRMwb>Q~(`~FFj8YNEDsf!VMXaM5qjO{1KNa?;&|Wc;{}B%wXrHN`^q-53pOgu_
zA@)*P!rrKZgU}HFg&;F)s*3S(0Pkbu`}jV#_bdG2B(d}T3go}n5sP5Nd+Db<3^SM)
zX+fYZ&>pfbFWD!XVx_?nCK}xY+steD7ExK7qD6eqXa}|&G__hcHP9M3Nm=_N45vry
zawjpTo;FI`zW(Hp(p}Ii=?tg&7!-`X>E}gi2kqyYXrUIP<YS05j!hY^;-q8(RH~)K
zbp%;4?#fZioUii6Sw0siVB01xdFKuIiL`^cAeAJ7X*6fZ5~_hfe4fmQ?wP*nZYQta
z1bLO~Fv;8zQard_Cc-O75{5)JW9^_RFckcY=_P;hlQT}Pp~3#b#})>QM$<n@`=t%C
z9Vbg)ncd)#8rb387?TWeTA3)7WQ|R#?+W*Qp@h%AQosb-)y|rAS&srSE)Z1M63e9U
zKR2Jfj$KEWxa={XT@M!j)%omBRp!4opKZtVMU>QCJdr40HlJ-!$$CE9qQc$gv)}57
z9`o5##QlGIKKr@SMgEVQ&mLIycjvQmd*lbWjBkqXcTM(`99$%$pxnOVE@eqHS1gH!
z6|#x&Ajd)tgvIg?TSIoYxkHe~FXn0dvN6Fg*LMpiFv_33U6zr_?3bndRBE6gwl@>`
zRry@1j4N(%4lI{4D5M^O)F~fG2ao&it+GCRQ#M`f4)6ho=!@OYtIF+J6Nw&cznV&l
z?2+DoW=+n01b9uxWA0?xA)`%w5$VXQe1(<Wqzq;i=G=idIr%Acrtv$~nZfTv&MExr
z{UHK+H;up&XAr0a%A8FEJP%^{U|;_|ffM#DtS!8cLzDHktg)Ya0;7M+)=1F->&ds;
zJIuKbU4TFw1YcBMp<p@U)i_kG4uye3VdG$rsU$2|%khd(;oUcc3P~4Bb06#%U8?0x
zx&2*mp#9fNo%YBrZ~xu)ug)TKx!qKF|MTrnzi|8iz>W#+e}}&KA8h}B>h?=>ySLv>
zWf$b%raS)`{ypjuN-6%`$?nWQ!@nJWQv5p+d@jJh0fBy@@t5{b;s0zG{{Qk%;y+H~
zzjVR{@voo!CHPMvKLX*uDL=07!hf37@K4B(;@1`Z>#{G1{}t!quVe-CkNk}H)oQ#G
zcsniut`V8>kdhhsN@lRbO3V_cUyW)c#0mmhTo(F}h1Iup^3s3gN?X*ZkW5M{_;o-*
zaVUt$gEW$)B1gPhhejkO6+|Mu@|tQ_+a0=HzhqmBv3-}+a3OxGBj10&KOX36L(8Op
zu0LA-L*bnf!}|;J{MQ1#2mZ1CaFG9hraw;H+Swo9Qf>L4>5t2GyB?7_hIvZ*W0FUX
zANB-gr83TJo7iAlIoyKGIbxoAVyk&-`fi(PO*(7V<*qSnazEk7%x(=_33c$`!_qUu
zrpg%;8^j13%WbTjaS*<cokU8CX*?G3x$6t<kxyS~?~rXxUC+UsAn+~VAGetYb85r8
z=UuTeA-sD+YI}ltaMDimY;KkLdG0zh@}rGrb4#Ncd2qLRYRkql>W`FYP-QTs&8AD5
zR`sVlz`n{nl+()Jsqn6OUl}g<w#`G6_L}Q+!={=05r>KP$OgumAQICj;_YV!&R{O%
zXz4WLIvkplv&i;!z=wXEyCQ>td1Pi?vUw`+bCN2T`-w>~YX-HOZFg@m+wu-b?9w2y
z7ln7v>37IxHs@{+hkQ9pZQr2mw)|aY#J9=Z=G$wYnz(^xAK4KOJ(|DVFR7>ZwVTb}
zkIdScn_S`0U6m^{oHpAf)a+Z4aTV#O=C=}^v)oT~ICOvRO1}Loi20WLB{`IT&OG9a
zghOuMD%((@$eck(dQrLejVYv4!n<OH3Q!^_C2D=^%_CHJ#J3j%cypV#k<aUdLr*)F
z*)o=X*a2pPmi3hoXf>D-FWp|$&phP{sa`ivAwPnUp1=~P?8BgR6*i3wnzLD=PUjaZ
zbAGWh=U1e~Y-G_0ey1WcW~0kE_>~i?xAjGBE}#1WmmPRX9Tec@B0KP!I-)@X$_zBC
z1Mdy{vKJmMD&T9^;v8<SWzJ^VNM+pdr!qW{QkfD>vk^^HhN?nks47$@stU(QT5F6|
zR<0|{<|suD(acjQKhl;+GV8V5D^~9b5_@~a+j}I^I{Zg$LP~|-zrZiJXoqFiFkB5+
z6N{49aSOz@+A854Bd5)6<gOC#VRPaWw%aOKD#nq}3dJnOpjspMpm8^w>k~IAJMo$I
z$wuB$cF2xl_Rrt+dM=afJ7(+?x7&)F*yY;jGIF-aAj{`Eh>yDvzII^dFBNuT1>GbY
zYFr-la#>=2M9>kAVuW((uAOampIm5LCF~^l2{!?0r^*L=kbW9yzU9J91iY(+jYwVL
z*Qv7GcTN%%TT#tf65kNcB0-Qj2Uiizck63e6+4zFuA;!8C5o#^V%yYvrl>FX0kt6E
zz*p!EBN@Z6M@Yb?X7|XTQr4&Q+j(t)Fbu^neatU?%rAY+?|+Y>9`0l)rTtSG+W!=O
zVJLo8WiC~jOI7AlmAU@+3}v`<J0htU;-}vt!lGqg%1=*b#`)=Su9Hj0{9k_hzx<@-
z(*^nI&X?o-G%{$sGx?&DU9#g`a$0_kvT!ekR{7=Fe{c@phUXb^ZDO3Pl++?Vr<U^5
zrxR@NhGEp$P8U0V2yxDeQ;JBDNKWx;xE>E6K6pa>1Qnm3^1gZ^>s$Q~IZqao6=!*5
z?q&R>j8UxMv~t*-L_WTQp6xurPGjp+V&B#*2T<%X9^lP*C&$_DE~#xD$3}H#fNZ)2
zp#zDWL}h3saK>l2))}r1ay994-~=ft0>)Oc<l+Q;4Y84TMD`;uCWCJ?8*{Cyeti2S
zJzPlrcuTRU@J*>6_w;PkT@Gs7dA+3~`3G!OuMvO%A5hP)H>aMhL2qF_+nY2HC@H^-
zrDw`pQb69Q{svHdSf}J;RhRy#j?dpJ7iU9)%Q`~&GLD=0i-5wv>MY)761;4i`pyd8
zH^u{FRUjT=cyEZkkBes*6AwsAi&Virr1!XB{jq=)mj+&G#K1uuDyDomNA?+$+SDUG
z!UG((t4Gp0^+;K*9z$N|A^lCE=XJ0j1%Il7K0y>O2VO%xK^XcFL7-neaB)1qv8Kwa
zBjPy(DZz;Y=$fZ`6>{o$Z;*(K^eHzBktAJdUv*d3n4C00y(<?!msBmD+{eGm??3G?
zOajL~)SwDioxCkkov0ot9cL@r3zQFMt5(<)*mxZ%eVMlI^S4YhOy1XzLu;QMTN4pj
ztrP+jI>#IS>qRrj*=N>HLIs=SSd~EpnpNeZAb|uk<h9JueRZb$o;Fbwm)k~?zdolC
zohxUB?K<+heYyS&354e4)tHg|4JcRM7PECwy*c~t)8WwUy#1mu?y;FS_`(!xT<RYM
zjOLjelEa~=rY#D}+mFwjHs8%hFGI)l11v#8i-LqMG824Z^U>T>sHYo6dGuL=-ijcI
zTw>N!)2aD2<es<%owIQV=;W-j3CPp?K=Ll%D*p&s2L?rFtnH<=zy$PNa>UfZ6<Qr+
z;wEG^=Wj&K^e$gPDH`HiVH+)hyL?N7661c<>u(}p)}!k-`%Z`5Zf~1e;@gfMc?fK3
z(K`2-+j2ifpZqFnnO=s9V#$jpdzXgkM;}lcW=t_C#0@6BldZH$oC*@gKM23F5*6JN
zMQ@-uGsGK(+)A1v2HdliGC9>b{X9+b&d!OSx)o4#NPwb4iuS00qC<-I2vBixAr`_@
z#ISp|Sd33s8l&JAxjr_-`*{(KQ6jCWzd<7ZTfx$9`eKaVDsNJ&Ty1!R;-VE$1jBM+
zH^X(tn6#DK(TdklA<>&ES1EQQvW0B>F=UkEuKN%sxvPZbh-~4)tR$`yu0y-Si!hoe
zVKh&Uak)r}ez?~dbi%k>j$ij0c}KVgZp@M`Z|@P*zawOrrkGFEP{J#P^$0X_;q?rf
zBPu3Wv5AOr9-(}WKz)0~W`wJso026>^CvL53oS}5>q0cbnGG&f(zVPY^J^D2faW6M
zJDw|rZves(@ccU7mkQ%@b9nk8j*}}lCjipBXob#m5ZB?ji6CaBFqvHKHhl6Y4dU3^
zC!ge6D%?%mmkJL<sC+QzfEhu&Qg{_s7o`;U<Ew4L(IgC7t$17Dii(c6`rLIzUqScN
z{eqJW!n(6MbyewUrK{=<)57|gu8PVS+ho=o&U*7%Z$$s&tT~~RHL3aU??_*mH4T@>
zEApKSac0BwaOMl~W8?Gr^XoVMAH$!;GygAt{{N0YuV3DsKb5bEA>Y&!Iw#NG4N4np
z6^${bB*xX;r_fGSV%x}CrBKE+Tu!u87Czaj;rcGsnTUOo*qC-(XZ%EYjCZXi{(CAu
ze;paKFQD1puQgkgUew3S$lIyeo<N{>X|}Dr{e8{$T8+R%qS^ALv5g?}Z8XR=6co+!
ze8m<KjM~$s*FHYIORtSc<><8_^|1gzy^ZO$@5n29ZK53EPd!hqT^dWyR%-22@<!!j
zD3Nb~&HXweUzAmh0Z=x>lC%zay^R27JBUs3@8zuqw=?o4YN-l{N~;2*(w?Dq9TCrA
zctxcpo<GX3(Yh;Y>m{PLrcyE5XFv5wKV78M)~I?UeX1TQ>(yh(2Rx)B0fbSAI-ZxO
zsEA^r<|R=F<ltV#=&U4Rl_F*254BlpMmep!pmI7<*V3t+`qg_}In8mNjA^H$4L1O4
zP}RvyC!eOr*zXX=eyz45JSE$EX(;C@r)5kk=jo^HEw-W8==sN-eQ6u^uV^{wTC?*y
z%uvpYqLG@RnOl;{#q|v!n7-V_qDhF#88J(8o|i1)P=d~b2Nv`G+!rMSB{H2;!tObF
zVYBtpBWB&8O+<-mGdu4v8=FVNp)rG+2z&|_oB3-LRkgupUgujI4rNrg?4aTX7b<3(
zIcNI0!xVm7>&|3rw3%1<cB5zRHQ&sC%P)#?r1Dvrl`k=`$bV5HP;mFPP}dRJge;l4
z!6jPgDW!$F=K%9*$C6(D-=lWQUg8Mz%|WX#R<HM0E>>_Rpts&4C9qaD-^_X55Ag6+
zPdmzVsrz#m2UW}s@q&-$ERa0rySdM*l+a!I5w$m)<y&kMf?VNSpq|@&&x^Kz9{Zwt
zzUh56P10}hE>_Q4-{!FU3N-I}-+{3EI$w=h>pf14x0wJtlvjA^8}Au2!FyJ=Wj}-Z
z?EK#Edog1cP`3HrQqL>$Uk%E8R{mS+`E&1ketGW~d%B^UyeH(pDo?=X?+b^r@{fb(
zTQ*D%%{iwpHHQ`4u65xw^T&<P2ZaHK&H8>uICNdK!Mv(qv0q}Yn)SRq!8N+hoKhW@
z-RI~wGb88O41ojx^fzrei{(XeN`JUwegp9*N11cxvp1X|p&J?(_$B+h1uq6Ar+bdM
zJyCu`iR>vqYa`Ab+SS`^jvfp(_jZSN^VifneAQF)U%1rv9SS}*|Fw%H5WecFLCe0P
zLcbq4=%rpN<R0cb0d2Okjc<lS{k#WQHGFQ?Z`?wgH|}KXeHVXGbL*f@n9tmdUJmn`
zZLUf}F~*l|U{T&tyZ9AOmu+C!nIo#DLIzo7tRSEixj?1a#sJ9RH+C@AHc(%+kp1l6
zi3>xq8{$%htRzxnD+zIS&~s1v>P~e{mI)lXQ-D=Ms`AQVwsDpoq{_%0N*9~^QU*(e
zm;A)sUa{<@AW!SfWlVVQoqrx7>jm5@8J99S@PQn5KG~QYwoJ7k)5ybMKX0><SC2&K
z_;&2zER76>YUlF33>cOb!$}<KoaXNsx-E-Je9gS&Cq>>G<n29qqtp^bA)@o-1G{;j
z7=!kp8`qM;HoI~6!STl3AtP@u>6Uymj_;4SQtJMIdWHzyB|q|g%zO!<ax+DU-z9d5
znJ3iXm%w{6=qb0Jzc3kR*1P1l&P9b7VWRcd_M*O*loS(XUmVxX7Z+&ii+9r-#b1^h
z`sBi;jbw>Rv8}yms9f@@T%RDnVfmfEjU~}y8Sl(f`)H|>28QcZn>3&O7;)z2+ec2{
zt1`$1F``*b5Zyww9_uV0)YzAN9|2KG5TGp(2_j&c_+bS_vXT{GvPQtH5isJH4k;zT
z*b}csPBF_lmMQsk^j5?1f(ns5Xqggi1-BZ5UeF<c9u>%E<mYqw5n}p|8ke3j@^(t_
z3>YuSKrrBoiCTq#ATL$(wvE3!a^*iCB!>i^jRm~Vi!dR^`>X`W7v)df2Wl}RffrR4
z8YdLV4-<ueWOPelfeIL>Z-lJ4D4O<`@G#H){Cz(IH%qK0rzvSuU=(mvFpDFKX{-SY
zu<f74fku>Ybid(xD?<PZQ}#D<4zqMS$_t*agfaWG9Fzs=%wwbESMC->cfocicYuM3
zTR(oQ`P%ue-reL3CVcZ(D>;KRqxml>L4)_RL93OZ5z=ZwBaM)ci29^mtob0Vd`5bs
zd?tEhCH3Xi%a7a_Y<$bFTV3#0P-7e2$47CEK^qW3Zs;##LmWS`;1U5tAU-@fI+((%
zW@ZA~1(_b3bDe212_&N{Bes(C13-p%kZ0k)|HI;E*xwUBf{(z9O#D*mGjb`?=Wkv2
zWlImv#v1ViotEzScUgW-OY!O_-?yAL^d=o1zDzxFC?#FaaZUlN@PZ-jFQV~Qrf=q9
zC%%a;XE%5!CEGVrnpJuuEHG_IH5mw}T%w>9;CpNfY|%3M&X**<g+t^S4VTmD&19}2
z5&QQRHXDjZIVm+dl~N@~JFtZ{%0h|4eKU@5tc4e`i6CL0qkzw-Pc^)_{W_hb-|?F0
z&<$%G0F-Ezk<8{nJ5_C|`NmpfVMi~(-F?VN!IR~*l!eleJUm6t+?*)JhJR5oXKvx8
z{V49{4)cVuUAy@Mb04kD$CNt%a~#$2U@-VFly|Z9;;ZA21|kd%Z_48ej*qdBpMJjz
zyC^1UF8j}Q8pnEKsptcScXYbW!*-8sbxecMzDn}SfgqOUKDx<k&r*4&cYqTcG%AC4
z_$Uo*NVa-<?a4eTBs(^-JiehLblUK?-wV~f_9pez=|&#gVMGpJ7fbweEYZj-bb5e7
zlf1)!s}t#8AEfrt6mN^JK@9H-l$h=xG8XQDxYERr$<GcK!6u>dPF)<0+r<u0ev?ss
zj(s1mIBrY-hDviGO$yRqQQ>x4E}WojI@2{i>|1en;T;W!h9NIipW>Ac3CTNXdFdo?
z`oC*<(pf?PiA$NL;%2rYU%bPg)j)<WR!?=12`hM09@7OW;FHayAy4T-M=0b<d0b}(
zV=s`sLt^iQqxK)`G{GWek_t~7eUFZ#6;Uu3fO$cUQQje=+RUWoiB5!zJ#tXZ{_I04
z*#WiEuhTG+e!W77xY4NI3$bLR&H~Q@*rRdi;op%|y=f8eGIVy5PTEe0y%Uz2X8%{x
z$p`y2!k*EM{6SQzjLcKj-Q?81bCVe%jU0YbF6C8SMtsK_QF=JK1(B!DVSza0>~95P
zfjv>>D%dWzmXcBWG<~N^Y)qM~6Y-O}MGxdg;A~m9kQ=anMmiass#2zL^tZ{!w&WP~
z;F3!VZj4j5Yarb27Lqj%InBH5R~qd!f7(8owrTlGD%Xq+mlIF3W}HAEG^YGX#rBjZ
zN=o4Kks1r=hk~RmoylIWu#AR8A^`bgpwy=dg|!@67ZVtf&3wU1q9q@3k!tnc#qb<o
zO=qtdNBJ~MEc-L$PVAKIicH+352n44MvV@c6e4>$xB{A(i_fmY{{YsY$_Ihigkmhi
zoWdM2f?q@}zfhN7tqMM*3}0V!`gJy~<dUkDT&`%!x2>|BE^ed;PUE;bi?4!~U-N5m
z{8~P0IUdB_C3~3{irppq<ssia8sz5o38yJIoZzm4*aSu9GIrhi;=z;s+$HD4lzrCM
z-_-@%B}-QsBlBZ-V1P5?p^Ug|EPDgC8jq>}!ry?SJ8&S-;+7jDHh(5Zk$w5Y16L-x
zGH9k*;&eZo3wLSRT-Qw%_gtC$^vw*^^X;WjWblWS<KmhWA3w73j|z-2{<97HOR%f=
zcewkXaigtsuiq&9HuZ|%FIQ(3ft!A<Yk8F!qh~FV1ailkSoHlsOJ^Bf;EMCm3Pjv;
ziN;^jEWemZ*!-a9{zf&v1>EZX3CL8s1B|Obka!-%HPqJ=1x%A>@L@hD{u6QkzDpDL
zv@Pu?88g1BYtc1IHJx=t#m7I+?5O7pD4#g5g7QS?`0`|@!Zovh9UoD3Mw4Q_X)HJi
zmR-GAqI$Jxh`3&Hanr4P57WDW?BCd;kH*RtP3cyS8QDLsD7jm?c=j7(<ehn)f>*Lv
zXyzXKiJLy9>e4MXX`jCsUx4nhE$^#HWBdVk0JnD?RavFszM<1x@HmrbEV+R@!zfg0
zP;{DVYhw-3xYVFv^WF~(UgLuzzJ*^BmO<6+vT-&n=F;3O$ij4R@blfc^7-?+KY|M*
z{4huj>OKXhO?`z?Wf%waji_RE?L%EXy8X#<as!CO2C4cEUTU}<$6XvG&HNxfD7mIr
zxz=V(tUp;vzuAfsaXyh&+LTZlOb9hy8BK}ZV2Y^ANOu(O6)+ieI(@1xnW%%!E_}ww
z@fR9qAtRrG<YHqCF_z4&oTxEuuv4Um0}*6*KQGd@b29!uuS``UxX+u6fB9=k)06R6
zRKA{*@i$eRo{X>7aQ^OOJV@nHnp5Xwyi3&)n~d!m$k1~tvTHKlp%IBs#zPP3LV7Z8
z(wRwAlkw2lyPAym=rlE>*QoHc(RDiRf|D^`KbVe-dPN`7Ga^TU%n9kQ>!L|1Jh4PD
zs&~ZaVCYzYZreEIvE?M`IT*c2)<rF(?L=SFbMSk=Qgbkql$wK?i=&m&PifrWft|u*
z^g(s3KbhTybx`(Zv<{XlWTg7(|G51ko_e2Q{&)gD@&=hdV5v$iKPnb5pyYm-En{Z7
zVxc?cjS19?G~vQth+l3gU%p}2$x6AMRrD2A%J!~spgMh5MQlc92=@q8Du$}N`|~J0
z=*<dj<c1Nhbd_t|E6WFQ^NR^24H#&fY@UxO?_*rMmfh5g5c7_xd?uVoaOFB2$<VZ=
z!MJw2%8=t698CfMsr<1uGdOecROi>!A->zc7ny&;9X!-$B+g(dI!0y5;5XmtVV{++
zuNK=f7a_6SN_^m`#Cav|7p#)q;;@MvgC&RY&Q#~6M7NggReqeJeY9s)u8YleUS^E1
zV>0xEedrL*J6if65BgfzyUHCb>R~EVH>#+Xc8n?NS9-44D9hx!79M5#$tNThKF9Pj
z^2B>W#*%XgM4K`GXlDPzd<Kq$%>ISWzDC)71a-^TK6Q~%_6oN_jcb#BJh+!lULWUG
zJQ3FP=EAGo5jV=-CrE)HRya@g6^AsliEw{o&Bzmh5L?Q(4eF)IJpd~lqj;hCCw^hk
zM|NZhSB=>y8}LDpDMcJJIjBTYZb0-Roy6fqrt=baNt4jS9kTkAXFCV5ad&x1vk**W
zc4VT(bK-KTyCi6{)dWj+iLa@Wwf=D^FVN^xcc|_1%-+>(fH`D>o^30s7Jo#c!^z@V
zm{@iTHggN~YOYE;65r^30$l3g)lD)JTxlyYZMI&}{8Gt1b>-CFhsf*OBtNXd=5LYc
z%s22Q;;JdxZwvMTEAJ=F`WbXoiy^7mZ@A>~(yFbHytnky+bd;BE|JStE|U<zHp)+!
z#Mf30riUc)g;i-15|&c9&gCIT+oXBd@B<&>SHVFvNACo1tw7~0z%V@MS-|kh6+GpJ
zfz3y<f3C_&_Tz#tiG>n<TB^;YFdsw-e1-0yx+bQ9^x5*l;k<&K+Lep%Z4kYleBN62
zYCa~#_p!XK75oHm!s{e|jzTG)Nla33n;?-fJo9;DH)pq`#G<B>ov7my#V383F2#wv
zkIqqr=n4fv&=x?NLQGexRs}m>r$|iz+75(`k{XMaYG@n;k5N%tO$AJTK9fK`<^j^T
z-a2VP9U)C#Fc<1bZu+ZPa*CgBUqtds1@sIB4iJg~mYSqlebrIi#hk%uZjSVE_r`rQ
zgh?$q(~pieDt0m~O3nn~2;-UW5QDr*Mi`EZRmeIx6^&1!EJ#SBxfV)&0|z@JM=7QY
z*t8p{cn;m6_cE1Bhak?AMg3!Fq(wfU402-L*Kt<hk}pRBPnv_zgvg7ejSMPH@mB;F
zql;kUK7^sI2KEz|_Og{PTV#PUpa!@_YnwswS~BnmsZ3d9;-yRtcnvo?LA6E%ZB;C0
zEa4b-G$2)43_h1r<5!)2|E}VT>lP7I%@KZAT#o|*&>Y~D*@>B{`}Zx$Vz0Zrm#A2q
zfqag?10VrbFe)@$MVh>0?<TLW$6h7;a#y%Xb()Y__c$HMK-fjDCfvcR#LjULV-EV=
zB0*SJjY?q-8K>S*oEyj}gP0vYyumAmf=vWIMQh1~AXn_nj37+AlX&{W@MZI^cvn>^
z6_EEK&DjSfB^D*4fpYDVJo-}+y`;&oSJ_o5B_v?Y&XzGGnZ4DBlu;$|0@=tvc%il^
zrUn{FBl0Q*!LYQaUaDXmLv)LT4a9j5OKQEO?v@5N2r^OuVHqj3pURLFU@U@z-jvvz
zxN7W3`Gz3R0M)n46BSa4XtK$H`qEv+6#EFW)c0n>^`@LjQ5{+zYR0pmH>EZ9N|_}~
z*|n3-t`D6WNZPWcD`lX$q#K)69}bYY<B~w#P&MUReYgtVJCyE+;f)HI0k;kd=3ZAC
zEY{PC@z-FesZakpnOH6XKGPS#wMsAmbY<K;#v&knHglS><g2Q3#(r{XC_`mWMnU$E
zL*eLK8Y&K1C>{AV#ybcd$RNWrRo6pa;S+Y-gd!pyMG8vSKr`d7Xejw2vsGWxTathn
z2{rf8EGjkjuO|{}3#yPMpJAXlLCY?n$}m!$&{z6uE7<!&(pTFgHszgUXv*7miLWH8
zo8XLzCFvh;SaJ($Jfv?a5|h~~N?JiKkqBEsK<K5VRVI52>GwmWxlb#Sl!RotC4_-0
zP=rQmQqZXW^|3}c>}i6QP=UcH5Pi*^$ixP!?^DthNqqFOP(srI67S$WzY~K>_C~rD
z&Quu{ONw(6XsfBpFGT2GFwj}h1|w=NhMJP`?-!KMj3d<g`*-<+2l^~#3*h>-#$RO)
zC|e#xjshUaUra1Ut|B}8ZT+>PwXp0&M+Yk}C0CCOP{LQ#C=tAo6L?C|0-Ex*g~O4-
zO3hQ5!(<j|FZF0ajIJ)-0JFYN!MH?!fqdQazzsUjugSv(3>#v{aX>avIc52Ry=o9f
z=X%)-&L%pMfWFjM=Jf0Mmy~@t@vk{Ebj%W`s5a_G+7uml+qr_WaxeHYxvG}8)tq;F
zj9j4#C-4?FhvqDmb3^m>+!b;zXr9aC0DGu1Mjb8ppW5y|X{P6_P<iI&ZI+Vj6U?)D
zJNT<NiyGeu3TnT}U8zdX%iD{c!rceMp}Bb+kEhH!6uxEN4O=l^O{;F(LAc*`Tlm3w
z{WjYqz9u2;9#P%2!<@fwP1rqu-$&ul5R3xMbB<NYTHwX!e(`pi7yw9ogDbr2<yZHI
zcfI~<i#fD%c?PF(SDM2smEGT!sxBI{T#o<36kM$ennQC}$g!O{JV#kNhTZA;2hDj7
zf10#)c<xe347*3?Zzpo8O(O5{eH6ZV)5^NAd!DN){J@S?D^&C(pBaAOFDv(iA9#P|
zCi6Gmedg=l7Lu1ME5q;uo0czEh65?S1LjcQI`cW-@(d2!%)j`Ss^`P`OM~+Mc>Z$r
z9Pah|<$b7ksd}d8uTan7ToEHa9C|qa({Si<%!ePGcf-L1b7}R#9p=J<DH*1H*6a+4
z{5ZjUqq==Z_`yl3EfDygXp31<u);6hku>WKc}nCyb5rzlGdX9aoNJlS6|9nDEptNj
z6LYWc4V#1yafwWxtKkHB?w!?WzDAErcoQ8Mnme&J{J`E{EU8n6_780O#Y;^p6iT02
z*FPK@&gotF=JhLU!#A7I2j*!V6%M6vh6iCc9;5FzZi1M3?eNxi<WG3FJ#|9@j<N1k
zR~$7jbD*y|7lAv4_&Ccu;ymt%^EfB_E2NEcIoVe{e%4i~ZHUhz2Q$pG@w5H2ooD;C
zh0l#_P>aeQ2mEQV1AY$rH>qz*^NFEw<-n7l2To+;+xOdivcp|^E^ThK$0<KsmFURX
z<*abbv+<*TF$gx>p1i$c?rU<||C&&r)Be|jJguri&fDJVJa6k}f2rDj7J&iQZ1ys4
zr((z;H~gC@*mD?X=<)nge1tEFkpbyo(@9uIU>UI2z*dM+`jL#%&n2`*LOU7lb(oLb
zXzs-XL~(!4Tk4sl?E|EX_Q~M=)ST^#n4!}bn?G-SPZ}VD`H<;rd{th|r;7DXoB4R|
ztA5~wL-X>m-k6)W0sD3=&*$bfGq$g&gC&Pya1ah%ffxz9U1EX)GFuarsk`|{6*~pH
z0%H4pDk%4>1lat2b@H>@Oz}m{BwwqUlD|NNfteJuDf&6)16Zh7;i`F8gc8J(of_(0
zV!qN8esIp9h?o;~S`x)9hMJYd&~<~BsH1i<8G20}#DfM#NI+^t6k-1o4qYVzXwLkt
z;j1uHQMqw)Dn>^e0Ku)vpwzKVnJfvEOO<#c@3OBbOQlZ017pYf=Df;RwW!)#xj+X}
za$fa|Oga}cU<xJqs>8R8PW>n$e9Q3E-3ew&+*;}J{03;C>=(?(F}D#5rT2MC_dT5Z
zyb@lad-5Tc_xUvG3wOHDGIzvmnGShhlt}YsAHwV&-wrd$dz2jBs<1l=%lw3bybLp8
z)>9c0w}-LH&ClO>8_nUqL&%2D=m2GFU_R_yoFS6x{h0C6=$P@+Ca*SDN{T(#Ya;@)
zLR%G(e~<Z>{6mPUD-I+GjXxDB*1(m7DabM?9o=cV3*Pe!Q-x;fXF{}to5=6^kv(De
z{n0IEsNmV42%;YsJdj}yi=H-*%)<ET^t9DZRqofAG=*XoPoY`QsyGMaRYkCd8d&hW
z6c<>#;FD;Tned~wuzO(3p|CsQ!E+eQZCRt}B?UHVgC?^kXF-M(+CA@zBMIEm-Hec%
zGe1b^#3*w*)^(Ek$jo|WGPRw3liuN~IfFvI#5zH9hZ`dW{)-({nKpGIq%9S~SKR;?
ziu^Q7uu@Zk^p<&798WO&V%jIwhWb&X>ClE+;n2XDn^Z+j!k`;eZE#~Vwe425)f3XS
z{l2p{LN94!tE=X~#i}+R7ALB<-J_W=Xl$eTuy+T8@d(oTE}9m;Wk_me0{q1&c-+hN
zmK$asA0@rFJ;D6_#%eRNaW?{wvn}b%4z9v%JO>dswvk0x7x7UazGZyseg^)$yl{B;
z@YG;JS+M9fB(>OWiLa3rHkv&bq1mJZanXg8Pg61sT^IR>h}Y6CCgNk_-7!Gq<T9sU
z3ZEUQFOX`<8K@KsuIK(?6N<lY!F85<DnTlVxI4xA1&p{3K7m+&r(h}mm2hEePwCeS
zD>IpaPPw>7@2WFTHQJ~Ds27*7C*!|ZCA8b85g`XjqB(lZQ#0$XHc!D?r_7o}^VBdJ
zc*@++8#BrIWx<IolVH3-Wi=8qBaJByeS6t@2Z?j74o>+xai`3xJ``hj-)ufJq)L)&
z%}6w*mXO&zV|TLI+&JVTUZl)xHM)!ot2#`^(#+=eAwkI)@zs?aaIk>lw$G415i?v~
zN>1-Aw)u@`s;E3&2W3l`TSX@?F+<7cu+`gX)>a?yMO)Js37k;lS!^r!n;~BtR((xe
zQ$NjB@|3wM&3l%7yD7AtJiEDp4i>H|1>{tIm3hj$2K&j=Jj28@?tL9RhfbHWr(DBl
z%X6D=KjxQQaPn4DerTb@)q964_@`XQI@3v0`APHlDCasQ<y8J{KI)&o;Rq32&{vfX
zt?C27X75(BHvbsCLI+N7=wNF!k(Q<ZK@wHXjk|~9O0QUU)mw`p*{3XQZMLO;<EPt%
zhgCseNVZhF<?GDz7nR2qg&`8viBb6gXa5@WNd6~$8i+JN2~^)sqjWK^WE-Hfu{P^p
zW0Vzj=Bf8Za6KsCj`%);U}qsl6k-kemY`bijc7u8)4!@v$GrBG`AH%_TkN4-Fiif=
z{%h0y9UNU$$lxnErNhapf-Ct1$IoQ<3?GLod=8#1Z7MEpF76$K$*>b0E**5Azz(&i
zPrgW=jp@IWr*v{X7v)a5>|Y~Y*m+rS=>uR2hVu48a5-<v>p+dfa}93L3pEmFp7NQL
zTTf^1rLzw~a(h%@(s8|2J4jbf6?h);C3Q&JDPJXVbf~wAxV5@Jy&;~Jq^*gp0CyRM
z08W3xPJ!CWQBDLH_p<C}eaj)Uw(+D{KTGa@otl2`O|!o7Fn=)GmQ8w?%C&QP!n4vS
z8e*P7oH_Vqu(myE-6^oopm~mv41cs4a=}*RN#&PLlT5?nna0Efft+PBm2o|;C7Y3W
zDknrX*>B@K=kB;~C<S(kIeQp3XZ*%YR%c@{CfnS^yx?4+1KQ?{nAe;^9rL!cP6t+N
zS$hVpxRscZhj7mPIf1}heP$%*P*cDZwcCRO@ivm=7^oGOgLrDQ;r&^P^{+F^M$799
z&a+Z@d)I+eYX>abR6O(2z*hL(=I0Huv2cX&P7Kf)q5veY1<*mBCB!-Y7jtJGUsZAb
z|C<dWi#IANF4VM!8dQ`PMci{WAvYKZsE|a%CX3P{p^#v$LJ|YQ%{3L5R;$?J)~a=(
zE{KYn8wdg1K-`e1ECLBZ2reXmkl*_=XYNgIxNLs^`Q?>6&ogu8nR(_jbLO1$oM+~^
zrd)u}{{(u(i?Kp~4OeOkz2$9gk6cytxyJ*+gGSC)Tvw|DO}EjL0gllHdwD44dk*mw
zxshYVrYZ4+osv|CRJjwv+x9<K?aW?Y^#iw5!9q)$q6&^{Q+2&Nl<=<6CD`OI%xOsL
z5?t=mpWE|H&AMV1kQiMpsHn`y2v@njZ>T`0agO?xwb!FFnH_-ZO50IlI0_u>lH~iE
z4vOUs%YL^D4cvOo676zzHdwJfIT|B`GAwpQcdcL@$gwfJRoULb8(5cEep#PXW|xeP
z?Bam|D78GbPn5c-Nipt_XMAriEPE5q1xAcb@l|heleju>KNN5GtGR6qjLwO!s?XaP
z*xTituc}TsyB@Kp_UJm|dvD3(xa(Jn7xGM6d$9^7polA>f^59%TjDuQPV&8(4(`B0
zlt9Qk2aaJnrNpYzoRtV+LZOLCzAC*KVqUFM0fBv8V(Lrxb#&ib6(^V&pX^u}H<IQO
z!Iy?rBBP0T%ezf5q-UWa7fv_i@>vj8JkK$t+bJUc2hC7cbBwCV6vVs3Obk6$dvksw
zjo0UnuSye#c%hD_oa(7$0F9hwsLz{B6498DWur?x=TO)kw7V|}nm_IU$G%HEC*<rW
z`A(9hxoXOTug`I6R_X-eKjeHst-Mtv4qOPEf^ybWJ(){0bGVbb15?5eIVUU${E_>$
zjX7hPDsSY$Xmw7XC4p;l_f}n<)1L3N=e{SD!TTJJ-ND1N&RK)Lfn3VniRPNQ`hxm0
zQ)>!w?&b)!09L3xnP*O@G2EFr3Tjk%&4}2m#>jysMIJJPN^rH;NTOif*r>M$p-0{-
z>bpKEhXncJ3k>lS2p`SmDffij%Ybr9?q*Z<pe2DARtNvU0syDFjd=fGm+PDmG(F+W
zs<m8=_cC-w^2|NbS68~exO7udV0ZhH-OVvB*PZ=Jc1Q7I_0F@r{%Fl!YPL5}n}|Vs
zLdgaq#T_e2)_hm@8w99_uO>7z3*@Y#-0PEWsk?@gsbu$Mm`&aHUTpaHu@4sgnjtyC
z%O_P-r2cf`6bH-tjEtp${PMh>QGxYc7?=9WiC(ZXf0bW;4G}=<#P=i^pFPhd%5JP_
z5U`+5#-&%0bC@hP=3y(lCa0llFMImzJ&smZEza3azI#^a!pQFXhLSMjOOsH3;`>~(
zF|aaw&>+EmOV#S!-vHGB7tDHopU_S>NUmo-s)9eMYHu!&U4P8kMh|d8j?P_E)iIZ+
zpEGkR=mTPR<ZKk+E`$J_0THiUJC}IQWSb#RM=k6=jfaIh*u*DQcSO8x<JP!{1ZS*y
zv=uTF<K1&n%FH(Cv%c!T4BG2*Yl7NJg^f!**X3?o;<-a-9D^r*N#MHN533gEeMj>d
zeyekKl_VumN;8K!GyS>ytEO-x`BpA#Qm)Qvta>G{scJDJ=m%Q!9_w)Gb1SMY&8Z@7
zYt>uSxt4<8%UP+qmRI%8U5$>;iC?F?9Ir2yZ@7>~6JZ(0jGyLaGb7rGP}l6<c^{zs
z#;P;()>Lf-JCF)68RqWctXxHvKUQ7C4eK4j$(uLd8e4P)!=XI2ryUFB6M9BzAkfR$
z@~+8QM=#eiadp_wE>&yMd2jCTn7}$J`d-eZRadhGa`}a)D|%_}GDgy`#rDo!$xu<Z
z+*4_8qRyma%}Ei&wd&EFxm)e%_;4R0cjTU3bwW-bI=QJT28+Pn-1b!uNGf+HlgKte
z-p?>wPD9ifT@8ZQA#6Y9ZUguBVm0c|xRcLunBd(;a`0{gm#YfrQ1EU8m#cM3*~<fz
zP8{9TI6FoTyK!;vW$eZ=#<@y2a;~_F3$Mn9qI0Wrx4yWwXzdeZ;s)WZy?jA{OLbmp
zQ*>cUtL$|H8H5yZT<a6H?qWT(wbG#WMv9SqZ{!O;;cWd21$zB_w$=`e_DGPt_~-EC
z2An`hUeqR;Pu4cu>wR5rlj`E`uZj8MXLE<(tHd<e)bX=|Tgm}0p+Yx7_~Tr{okPmi
z)2{OcoCgQZ76}!B-Cas|cPUErRj%F;*wCrtXM7_d&~f#;#+7Ei;p05b6>`Q=;^xMs
zI_C--8b6c61rCVY&uCuiYp|X=A^T!0f6~%z-X($E)2kJHh@MQry58V{d1q2`Mqo#x
z%%1TXf$fRbAvBeFHkPJz@szNGv;0IisV1XLDodP_O=G*JB7bfwvYj|_kj3eR8^#$=
zGR0QQhZKJz&NY4JMGl`_RB<m<hACv|{T*Mj(&Wsg-nl=V(O+_QMoaa5AAa!Hl39yP
z@8zD3pZK=BQ<wE_?)U@eRbO{%6N>b5>c7%GV^g##CqW9>J47y6wKvjX3<y}8b9(H{
zQS~_G{D=H68xNi2f==><{T1(o5?lorlRNIa(M;Q=OT4Wd2c4s*@iDuTmE*mLIdI;Y
z*+}d8e%H(zC_;T*1#U>9t012DJu`15l~?|knWVyBQ5>^C+-psoxO)@Y*2&Qms&;2r
zv{A*jWSTAHWEB!28_DeU6PFvgY&AKj^s*#Z!3B<bk!nKx)X3tdW$qcn87M~FJ>zwN
z=S-{fi>lmfoi?7sS^O!WaLn9<?@c(K8}Z75Sgq!3(=z3uy@kw432`HDiqr|cTm{GR
z2CuVK;Gfi1uh)5f@tfkKla4k8$&}=tF^_|_JwTjxT#E`3ASPdddcGIp_i3yg2)A_k
zWYht=Xpps0pPak_Zj)HM3@uP#JzlyI6sYw%hhNrV=OLx-Fi4yEt$SuaUV+zLL(uzU
z#Zy;uawXIquY|P>tkf^+KIJ~9_s4?XIT~O0yi&9lnQxD#*47mhHRooi2wrnuue+bn
z{)kn(r&jP>y1Z&P{)bh2@IS0-x~<jz#>W4Uy&Nm5_TYbLj?F-S-t3=IEMo0pn??c`
z(?begq<BK=Gc#-BQm`iRMFPhjhTneNl_b0=DLrVj_GabT@{nb}@nx*L>7ivi*u!{X
zYVBbx)3Ww3`T9RW6)_d0S$i0n7q>^uc)RZH_J9uKMp=L2Kj3hu+}K6lnsXIF#<7Q?
z8B5k=4?~@9b4<pdJ&Xk^-KLXrD0>*YoHQPbukAiuP`?@H#vVqAm*<#r*5Z3=76vu3
z;A0*99xV*XG{<r{rnN*ltc%DKMT_LcP9b@s_^9S6{}R$!Ly?QiXL9!xBb(gQYp50s
zv2f9Rp(Cezs#9)Hr~G6*Q$xqQJNa{Z4hoY?-i>T`Cx0&WV-F)?ldZJ-10#f54xOiM
z3H2!;YYzj(%cnXASyK{b4<m25J<Jh2v^|WLwXug$Olx}>O*yPRj6BvJ28TOyt{i{s
zDZ1O<;ies|E)kG9m)D#4bUFol7=f{eQRDx?9>&OR?5Peq-@vl}^0Q1GYcJ1t>ZX&m
zflqSW4&oZljy+5oD(2Y3G`Jr$_AqgdJ&bnX4ygq%x%7+q^h(@YPMO_T8>-{xm}uvZ
zoU}@KI#jORxvY27Ad>HSj?$~^9^rh`SxCW`UolMJ$R0+BJq({ymb0yG#0#0{S-O1R
z|A^wUy_SLI*u%^sub@5bRD8{ONG9x*R6Cf0*##lY7{(4Bnh^=Pv93Kon8UGzp#hnx
zi_=t=Fg|Ld2{i}5<CNfh;<^4hyIHy^dL+wTxJ4y&Zc$;JTT~e578NGA2-6zGNO5ja
zVVql3igFBMX}!OVWD#?2O;Ea(UF`p85j&TQ(BUm&7jmh*gg$9w3-T<INsL`4w3SJ?
zNo*qrSPV^irz8TI!|FojFw=r~#}WqLDakz(pI@27?r<ls&=oS9eJk>`N1IdXFEoga
zp++un#d*;#M^y_d8Z$P+HLky)P2+HQt6fR~WOSYz>UJGy4fA~sGIMT-R<15djzNq&
z)mX<K=9tEe5e(~>v5s-=VJpECze41Y)-Ygs-dMsAV1Lq2iC>W9PW}oyMxP4NzJhuB
z_)HDIpWwg5cI7#zhK1c{FV^brd#piBUk91d${?mKRXRBKFm&dk<m`2VPZ~vYqe(IB
zK*HiuY%2*A#GQFpm4~Sd;%w$;jbk3)Vvl2G^Ed^15KfI*>nYufiR{;)B|+VIl*gTJ
zFrtD)9yQNU>&v?(8*<_A47vOg2u6sj4e6X|NcT^3Wg~MQ=P4|&nt(G|Ye~3;&-9(n
z;4*vpnHzcyI=<TjLWzX5E!D}ek=Be!>O~q?RKf}3^FZx5>|)Z9I~Eb{-i3zQu<&~4
z2u~L}f}u=DHmZ8eVM@YQrY&8nC<Ox+rE0<<oub*m1@GdWigEu3$@yI{A*XkU>l5NG
zayTmJ72>P}Y5Pf|GgJk)gM?C(y=zSurI?CS$U^-(xX3)?qFG)AZM;k;AFlv7paw}6
z-ke#)wdM%Z8Eg51rZaMkNm7}4NrTAe0GH#GK1jO7CTRc>3V<ALpmdDSWeN)MxjNn1
z3Q|x@Kp)e})o5bMQl8yBhmQ2^l+A3jY-VJnIgaIwoX+%jR3@~MJc?1u7@5$3<y-24
zH_HWsCbU2BNL8}?2ux^QD9f18`dAa%ker|ijiFhaZB1yM`d|@RK@4liMu=%G7PQWr
zO(d6o&}YZ!B8DvAxlLY1j^~ZdjMR^U_A@g-COj21p^cX?Tf%9L!k1v7O^p&x6{dze
zs|7@z<vG8ySvaa3cy98^pIj!0;5I_JRl&zsDqVtfLDDU7i`9XrX!}w;W%)6+<nW0@
z#s^O8$tzUf2MRtUVDi?|M=Wb*DIjGyQ=vzf3|ZD*v(r4oR4RXuOrF_l)a=M)_EFL~
zle^xS-!uR;UrB}BFDNaRDQ%gxtWkLtSuwAL)MgMfE3wU!JI6r4wHko(0sz!Rx;Av8
z<#?f@zuC0Od>d*Vk&UWqoq`R-__|x}W~zJ2oEvrL>A?#-oA&hL<Y;Sh0}D+njLUfX
zk&k@QBF=MnvbMb1$`9ns*X6XeE2qEE3tl2tg9oAvK-t`4`#9#;@`66b<Q6t8m<Mkg
zLXV>(jY&9#2~lx|)Ep(7GloI;0Fe+NtRXShHiQyTF83RLe2FaQG^mhLy!DSh$(j4T
zHNy2U#hT5js!7+TR8aF1e)I<@JN?LcpKC5N7Bc$A+}&6M9MRz2O>*$=#v0%_<QU*!
zf_FF807oO8(POP|H+u3Sncq^{n&0jU3D*7_c)8%7ab2{ro#o2*c6n>t+jTtlA7FdC
zg2a|GZlVl5TpPpN=X(CV7SvlA-rQs-`Rwb%lbd)5C;7}a$?HiD8s4@y>XEgW3e<o9
zAKTyf=H2va1s|fPCUdUx{|Eb<wY8Zxw=u)vKfs*Y*8XN~Z!*KVXN)I91p8Zx<TyKp
z<^lG%lO=Od`<t~x$qeV7v9^`{&AB6$`7MubV@w=qe*5Ra%x~n58~7Gu;-Ka?<v2HD
z4w>I}Fzd+t_9@hug~H5lH<OC_?NW{;x{Ud)7lZ92-i1<X+d46z9nY5l+h`KBzS%NP
zB3G{ib6MltqO6D|%lMXUjAXryCXwnvuj!GcO|#rH<mqpu-7{XL^Elb+W{b-9mgO|C
z2WRoc6k_i6D`;W|O|u0tbWodCIXMcM?Goau--rZ%8^fDk_Jj;?pV7@uLmb1Kta7#H
zl}mZt8v`Rkpt+$NGBUh9g!q9FN|nnFROLY3$r!=x7C;9u>>s)M+Pj>?r*W97fu(Kl
z8>?HEtZvu0wYr_&%Ifyb0amvK;a0b@NLIJu#_E>B)A!M>_ig1rT)|Mrwg2OdXUbXl
zso=VRxsGG>w1j!Z$ymbWPppoBxhH8IZLZohW#t7prp`{mG36xuQ0JwP4{!0I-&XCr
zVH-aGe1_|WFRPyZWMMHms;cnvH+0HpXDzAx;5l-!Q})>$k$<?SI}YPxaiv!o8$Nwt
zZeLeQaWl^P4?N#D9uCj?hh572RqoGAHhlHW{0bs43!ibF19Q_?&pe!>!!O_=FLkF?
z&T&!OaZ7HhdgkjTo}NS3<EXg8<SUjyU|RA{iO)|lu>rhv9+10=lsD&?l**r;`@ZT^
z{L5ar{^1H`+3@r;KUa;dob5W7*5c<%E2kwJZ}k;b7v?;iLNclNg*=_-L?~eouB#iX
zs&aNw-5|3r;fI*24|sLfjU@&MRDCz~<0ZfO?turprX&*EmoTS7sW0$Wl_t({^;Er|
zJ~JmJ$P|n5bj#kjq_XN6JS;Dq@?#JDEOS?tu6GyqG~SV>Yvdj2bQZ7iN19$supPTE
z=;*$Wd!P#S<32jnr9AuS;uIKt_3ahw>rQtYzsut$@P<D4LAl7^%$P@E_9HA08y0`~
zSIv9BaF_U@A(wa*cAPp*;d<C3g%8*5Lw%!2gs-ot7JYq1Rb+Bp?-lE!nZd9j^Zk`=
z6~u9#-=-GfJa4|vQ`^sjm*s5t8L1)ra;x!QtS0+U{CJ%i|8s+*+);rxFG`w6nJwd9
z=g3H8<l2j?YZKn*RqJpUW+JOvwg2S`(ZJ--I#fMAxiO~d*~yKu#uXgL+mC~u-*}ua
zmpk|uxPzO`DA&YPO}qY07mZ@GH{&QC#oPL)qATcdT*q-5mrw9YJjN^JG4s4Ru;lT<
zC%xK1S)>ZC`jeKv|5erh*4|(7C@RFUohRj0oq~g~$wL9FVpQ?3Z%=sYco#lr>@xU7
zF?qF^Vt<s<+4PL`C8N7_eK1;F)RNJ0UFUXiSWnL`dpVU(Tw672&;72)$QKwqc|(_~
z!TX;`F|pex{fGm{?UO#)gInk$DJpsKfUaAks)k(uM1^#D?fU0Z{vpa{l-=^4aEZS#
z_app>cW@HjUrc;SU<kWw4j}Qh99)CD<$T02&-tFyhAem$4aj40P#jL4_DEw@Ph}a9
z^8>47-W>UNN=#!TOeooKO6Z<*|2#zkJ#%++<cSJ%q#KdAoJZD~NOxXfzmW5$>mkXc
z<u0e@T~$MJzUEZ^j`}`eMbMi@?VlX=mw1Ncvb$vWyvC}+ysuDx`;x28cc=o%OMm{V
zDtFw*s=9HHxHJyxrrvL8fJG4Ml=bx+s{T>`2`=kTq?mCs^-V+nfgAhNI4RWC<J!<Y
z_Z#$i#D#^GDX6ikX%H){a`rFr6y~l`+xN<MdJTR(BbTn4U3JU#Wfh=bwQBPBo!P{H
z^3GWNbf>SY+LY&%uxkIC#X645?I5|BZ!lvHW_^?vC2WL=VbE#4L(ja`?8v%hk2Azl
z{t6xpwnfJqj*8jY6Gw0pyLy1!waoxjoSwbELcKTIq<d}!#TRn#Pce{Qh{wZsIggA~
zBrp~i%dc{tD>jiKx$4+A=UL>xq?u1tm?PbU@U1zkcth7Gd|uPUKuYjDWnR<CNQymA
zgA*M4bZUw#*14-GuEJp+G;^ICy`RB_L$g~7A+DK(7aZ|t04@vdo=3%|2+S)Kfzi**
zUM^IMwEKTuuh2~OZ7~W3_x)$4`c^Wvb1!42dZP7yPPn7{&-eQ3GyUx{e0AKS9P9P*
zWSh`F(^s8|wXwlhml3G#>kVx0<qhoMSKqf}vp&(15vWTn*<wEEvQc$;ir4YBKQ^!<
zHc;Q*Q&HRA(-`1($yMlP8C6HmTU75#^VQTJ!zM|dMT+61^P@a<8sw-$#tv!Zj7#%v
zs*g$Q{hi0RKdtx2CC$yaF{ZiGKJf%LcS-HIGu6i{_74mG%mHrt%kR|}R_;87-IWTA
zmqIV?AGLamC$ObcTF2c5aqP}fe{K1_oyg@`z1h?F8BPOKUF^Xz!PC67zEA1y3#XkE
z%&^|*++5_yo$6^^g%gpJz3z;(@;^n@xAVNi69ISbg`G<FO9S_epN=8ktbI0kZ(c`I
z@8ujqYmYna{nU<Y+%w)IF|FfP_l!yy>_Q(d=T?(v_8tTLr?9PamA2OyPbnN)%pu;a
zoEN3Eo+_E$$bK*Rnd~3c1BTDoRNZDa^_Z~}RZ`FV0kN7Fqg|lo^-V}x=nZ_=7Z0@W
zug1u<^O;jAVpq!S2}$o3o`H>_l=3}q_GOruyU~R_*+-cNwT1QVf+-BzWtrvOy=2w5
zaXxguiDN&5gHOYU813E%#tP%;nZjll+uhpN<eid@8V<7BOh{U$2FC7;*@a0bP#;Sy
z_X8X^76mqT(e_?$SI4ig5~p;nFcxMWI9GaNzLa(86S+7340<J%F8rQ6fvtSB<?PjJ
z&a11s3W*rr2IPK-f#k(yx@FI0e{bZ!(1&ztus}E9-s~w|oZt!6$4QqMi7r~x3j=go
z%vu!5d2pvbjfmt&vKC>p!Rm1}$*U5nP`RI4l?<ni#7TZ?O-cuoob%wCzT&V$VG*L7
zr*<Z&9AkrCr>ZiOMDj9eJ&Bn~wMxu0i5S#sWv%*BM{Lp<j*zrXNfVsR#va^2Pu%H9
zIb~q0Gvzypc})_y69Ji3&4B_UsI?0uNMVOZRjk}3V%4EXl{u9JHiaZnM!`J3wSko=
zhuU)9Q+|^Ptxbv78)3eCPYE9jre$Q4sjHFV)E3&mlQNZEO|4*yiwQ|famLXY@C3e#
z^~CHmb=H<N9}^Fn<-O^Fl4iC^VT+3s0FL4K{!$*{%6q;h;y=af6EIfKoHTj}#g$+x
z$*rsVkW(*HnNoeBWT#bTyK|E*VM5Znx~IwLoS)N9Oq)^Rp79_FZ2Ca+>&(+9i3KNd
z?x4fG|1yfMa_2fHOZ~0nso)3%_qNV=aa4jW88X@C037P-ujX(^G$*1rTc~Q=P@7UV
zA!$oWSwYf{l;TarDaD(MQab#UGMhM!QBPa2bK#CVyOsA2CH|?(Kys5I7hY$`<*5*?
ze=itv;#5Pr-E2tr90&y-ms#F3&7@q|$E4(Zjbe1JF;HUf%o#$q+|_IV1AmfD=gp^%
zGe|2)WjL7rw}|Ii10dtojAV6&8Re$;DcX$7;8-<pW3VhUHZ_vSsKMz@I8)<|`tA4{
zLn32GW?{|=Wf+sxpwmG1Q?56XXMABW{8?F)9U=|LW8b)#B>GuN`n(i+sKVS!mDL#q
zP6}s<YA{KhmQq<~lv6W#brLbaKPTPM#SB3EqC@$RN0S{o0W^5@@<r`nzZ>bCkf2(3
z!R36aEX#;;f|wRaInEHHyJ_)K67st0U|!NQN*|N-Oe#AvGMIOJO1Bj0u$>C#r^Ptt
zsQGk?J`5m(2&FSMJ-FL@JToq@N&r!xvsxy`yk;@n09P>WSi{H?%p`Wt?m>uYMl&W|
zR9L9<^&JnJ29~UMPT9IxPx-6I=z@wboaVpsbS^L@`=fP<{awjYUG7RY>HBCn-f<QO
zHph0{K8{PyI{=lMq-%-BGnb&c?pPj5_BY|B?7l~9GDrs5lE5-fLz5X^#c}R0uhj6(
zTggoTWul(m^J;=I;1hOarvF5l43xEj^|4fhncI$3({Hv1C8Po4jF;dGE5*%F%+s4E
zbvY%0yVqZ63Z*}_=DI>1_JwYAbi8B9X0^2APEN^_sC^tcmg>OuWMn|skvn&f0?p{T
z`;^AZ0a{PF7gM7cOpY3=Ir}6?f{64(%J#HLl5*6&pBEWS5C*_+fv#l#5(D5YKm(|G
z0lj>xregqPu_6XB@K8fc3ykty@mlGA0~sCNbsAJSeU!Tf9UblLNhsYp$$*OXn9d?@
zpv>83RT_*kfN=~3ww<dfS(3}hX*lP^*4q)&n3EmJ>WVN)Cuiy*CBM?<7MV%a#p{bJ
z>e{FNo_9S9z5wck8EfWnXG5K85ietE>s~fnRqWDz*vIafRqUAIDcu}}!WB<5c6jaW
z%<pw&<da+)SAaxw1&I4+Fh_%Km&~<gcx~M%GCEg?>A~aXb_(Izx>Qr!TK9}-DysWo
zHv`>y{GUN*xm-iBcqOhp6QB~j+|IaWxV(BtHp5lGHk5JgbfmPetMH`S#he87ACvZn
zRcE@YUEJ`wau*Zb_z_teiAA}zb7kCW#T}735~(5WA|t}3)e)I*MHnDPWL}HNu%Jk+
z5#c;@M5b90PIDu2Ym3O)L6KD`TkYb~?TGZZBAnDl<dPPVMv5_t{nLoV1w~GFM2d+U
zk@hVjOM)VQG$N?()bj0zruivBkxvwNntxwVq^}V{O-JN^j!0rq<na~}{EZyN;*1C}
zM`Ra@RO`8jX!!nxgRUKXUG~r+o<W|$L04t-Me1#X=H__WS%pRJiLOD95xF!_aQ5KG
zynNvD318Ya->?SXfOWnhwchFqm8-;WeZ%Ja2Gsb5yjp)6`IIZI!I!qqmsYETY4d$)
zHNLc0-%<XOX$|RPCl(f-R5Go0{KT;tg`G>Lt(#adc0yt7{HXfq`L5Dw+j!)dKwjO|
zjDeP=ZAx-q<}N&GAv@c-Oewq4YNFg}4RvW8zO0>l=H<{-|FD{t9G=F-q_GKL!<)Rg
zbrE%e3VQ;+;Yx9$&{W?y?zEk6xe{$kJkM`y+-W~}7P^X2bqfnhxt~+$ai=zDr&RNq
zAqt9St%V`()bCX`o9;P|w{O6@+)*oiX<wA3eUa2o+Wm_pe_GA6kOZ7tA>H{U25LK%
z&)5EY3pHH%b`nr7^bK3&8&KgJvPAx&#Y$S{8}`0$z)IhcPy9m`?W#;HxQ-2-bbEif
zg2EGbrL9aXa4&Sxp2oBqHI_z)W%-TCa=JZQaKf(2go0xcD0Veg3R3cOvR(VZnJ!;1
z-bM`ajPMNi4D;l9ay>c2hL5;0_lBIs*O~rjF5~9(TON^Wd6%`#_^_g*9-{M-ek8ex
z<ez!s{n__X>6R!K7!<2xIPNXKY#Qn^v!};;-Dyo)dr(X)JD%7cvl0P6;TN483EtA`
zUM4M?qt%9s^_EXcA*Q_!n;MroWzC^@7m1aPW<8#_d^SC#ga8Qu;w^tzfRM0Q3GpOo
zk&qIqm5{(a=WN{xWLS}666OdK5-60cBs}a&Gzq2*7vJbyNYRv$+EgFwXhXIXZ#n(U
z{O?ZN+tQ&C08^*71x%QJVLH`Yj`=3u>04^pvx~Q?iQe*ir7K16-nBR(Q?W#8xSNrO
zu9=caQNkWI$`xO59iu5~rN<ZWl&){*Dc#+!&|{7yc+0ugvcN(;psW=Akot&(J-Ze=
z6&0I`I4tDUs8}WJP4xv*eM=cAJyx8_nNu04i)Wij4CgUBy}rJwzUmbBf?b}{b?(59
zPJBNW%L(NNHYb#BaC>4JV)pRK&oht=Y>AKA@A37$kqIf4v3JG{vSEVm-IK-6XQTxE
z4eK_Z8y+t`J3QXIM_3%a?xS?S>sfYLW#8*q#GiFFh`pVh&${$xYv#b;!eSbLeUen1
zq~mM9=R(J*kFQ_U+P+;^O4io;JP@uQ_5Iq`XG)%ddbZ>@kTfMf94z@`zDJo++7#=)
zORgAiH1FR(-G6q>2aTWhuJd>BmR80#R=J|0N(#=Mfi2`BvM}PAcCe2)Jdsd33#HsM
z&LBObwBl!9ytlL>)+t)97#WQfG`YF3+rjHtR{w~%u@Vb{s}O%!ZE%|(J<eUg&g-8q
z$2xT$#WtW4o3|BlL8?fg@C5f=S5WGKxeGpaFIwIlDBYb<(0^ATzTjA||7>LWcuz8-
z@w)=C1)WSvtVxL772w;m?$?zkdYnm$-W7-{XkT{x>;!Lfg>QN0Ie}qpI2WwBqG8zL
z0W&M6o>kVt+gv$2o;(@N%VsPuIEmDP<JzPaZXLEbm}l7HAT$*}4_iFWM51Zhej=uu
zX-tKhNAuY~I@tVzZ8XSx&I)f#+x>o>ygMq$k4ynByalU(Y=umJ&}F>xsbPsws(X==
z6^*B;)Js?0R+kY|xp+>7Z>86_+w1!tJfpn6Wrgii%Q~daK4vkWKQ1=C*%V)NYGza*
zGpaJn-(_)D`RS*6nm2~l6L}j0x=IvwC;uSjFKL=j+<otp$1(x56(du<hJ$Z;M(O(Y
zl=q%3FSYE{ajE`mqf-6-V^U|I!Z)7>N2U5QVlql=+j~m`{3_em&n3(8<cQ|*aU2D>
z+IAe}SJ|%a4u%57a6F0<I2^^{I1clxjH}DjVSk5I-!UY!b$EbZWo%uVBjr?XD<(q>
z8TeJk)Fo+zQLpOcKr{#VRYuo!wDrwCg}(PT2N(%;jXLMfD5i;_`GOSvo#l|`0hUg*
zwA|9CEUmKiYfFD@r@~yWkAyORFEg*|?;+i=@;3v!nEr0==+J9BIrPfT4&7$utF8QV
zR{mZqf2WlnVdeW<`HQUlw^sgLEB}O*pJn9>tbDeWzsky=Z{=&O{OeZ!5i4J0<tJGA
zEGvJBl|ReMe`4idvhw#^`P;1g7%QJ{<$rJG&#?0ETlxQ3`7$e?Z{_o>{FPSzY%71V
zm0x1z|7GRxvhp`u`RlFxMOOYdR^Dyp7g_m-to&cB{0J+bY30wi@~2w)_E!E?D}S$*
zpKRr`t-SV{*56rH{&*|jZ0Yk>ewLO0gO$&+@|RipGpu|EE7xf0Q&zsn%HL$=)2;jk
zR{mrwA8qA!SUT6r-)7}+u<}=0`E#wj+sf~;bc>aL(8}jq`D?BGMOHq^%D1<2-&^{P
zmA}Wz-)!akTlw>?{OMM{+0w06{&Ooo!^)4a@>f~;v#fj<E7xf01}p!OmA})<XIuG8
zto#{PzLS;PVd<AvzS_zcSosVqf3B53&dTq%biI{--^#yX<;Pk1ORfB`tbB}>Yp`^+
zm4C;||JTarSoxk-KEcZWWa$PgUuEUzTlvSVe19u{hLw-Da$79@#LB;J<)5(f_geYO
zto(6S{zpsKSox(^{#h&kpp`GN^5<Fk7%R8g()X<VLM#8MmA~7{PqFfeR{keTzp(Oe
zTlwd#e7TkXvy~rf<ri~-<g(~0I6k%P_|)0Qarw}7DT+%-6o+&pU(h9ZebKeWxyDpR
zbCCOg?ysI?6|t^+=JI1MT4al@yN6_!<z@QI263s#^!W_&Kayi&|1iW~Hqtp}i2wdu
zOzb{G{AH7zV}|(e|Fd(<5P$#TOkYNErvKX6nZCiZGyVPN5T8T*Vd4)HpGSNi@n?uX
zLwr8*`NS6zUr4-ycm?rg#Fr6YNqi;oFNl9Zd>!$1#A}Jy5^o^hK)i`~(_$Kx<tS%}
zzbxB{8R9P+;lvE_m)-2d4DpxcJ26B2Ww$voL;Ph$PRtO0|5;Qyi>mL1-V1#Q`VjPA
z(0^t6Z}?B9FZVyF^b#t)MEdKbzfStQq`yl#FKGu?ll~FuACdk!>7SGS4e8&IzJ>HH
zr0*bo2kDKZH>Q^LZ%&<^(X1wFeLDSSh`(&86EnnLHr$CB;x8NL#0>G5>DB=`L;Ph^
zotPp1vguCD5P$!>QQ>Y>`789V(7!|f4*e(epU{6p{|$W+`XY1zbOH1o=sVD*(5281
zp&vp&gMJ468u~SKGjua_J9ImA7jzecx&MCdmNNFMk-FbOSws9~L!6i){<2|C%n*Os
zSSMzPzwA~gW{AJ6(1{u1FPrAX4Dt7$Nu@KXyc}8%{TuXe(8r*UL7#>`4SfOn0`xWL
zYtXl$Z$qn~RnQNhA3*VL%J>xe74$3UCg>*UchK*kKS6&|Blo42UCXVZFJoWo?7^l-
zGabbY@t0li#0>G5>HZTS4DpwZabkw}%O*H6L;Ph0PRtO0*_}?z5P$y}R6YYG?t$I|
zeGvK}bS`u*^eO05(C4AgLtlly3S9(U1YH7M0(~F)KJ*jlC(s&b4fI>+x6p0SZO|W~
zxC-?DnP&d1{?unnX@(*GGP!vZGsItZqZ2d4UpCr_8R9SdqZ2d4UpB>w8R9R~ojau%
z;_qKdm8Deehx(xpKp%iU3Vjs%B=kw>f1&?{z5;y(`WEyp=wc|E_J0rh9&|NyHFPa>
zEp#JvBeWih^F{w3pg+*Wz3NVyxi{FG{T;Oo@pH^5X^6k<1}A2Szw9O_W{AJ+4^GSw
zf7xUwW{AJ+FHX!5fB(Cv`Yu!`gO)+>hu#n6b3+-AK%am<0eueo9Q0-A%g{HWZ$c}f
zmCzN?70{2NA49){ehJ+G-2mMR-3t94`aMnE!|=U!KW&Ba4L0X#hNGAv{<6VN%n*NB
zt`jrFUpC5#8R9P+@5Bu8m;K3!8R9Ry-H93E?_WaYB`D#8`k?ng?}PFgu8e;`ABR2;
zeHQvG^ncL*LEnJB0S!O{(B;tO&{fb?&^6FC(Dl&u&^l-xbSHEtjoq!ra<1N>&L!d-
z%=wzzY@fGFFMoS-Ustqy=0+~?TytfBaL=5|)jieUdE<L$x&~al%zf`tOzPG;fiDO-
zSvtt(sXWN8&M4i;2OMOpDAGkeA+yJqT%R#d)an_&LzchOms#aqj`K8cFwgf5GS2g-
zhh+1on*;vz?5w|emNr<LqB{is=2*JU(q1yZ^H*%?N=p-U)4<;(ODil*u=S#N9r_RO
z1#lyZ&EOqYX4LY`s1*ZxEK@?3|MV58djjeP?GgDms3BKjgS$3yKzYhKRx__*IdDE7
zDw?vFPyN)d!E}&F<V&SuubI-MR4fri_}CPAu<d0ePJ6xXMl=~W2VBS-Dzmgwl50TE
zDUZeS^=nj?QcPJ&X;oHfAW_v(UdKa}7ZWV6bFe(6nDUeovAnlH@L>9}5ZuwPQ?NXx
znDUeovAjPXqC6H-JLO@caoVdCQ=U>HmUr4A%4-)auS2jrrI_-R60yAZ7)b|fFZ(1o
z`W+K2PbsE6r9>?6jzg3eA1n{XX|GaDc}j^`-Z_UT4<#J^P|GP#DW*K7L@aMDXVk&k
z3rJ3Rz~+>v6jPp3B9`YrM0s?gQy$&wl&2I^o>C%~cj+O@V~{!JG3=c3lw!(LO2qQ&
znFS8kUQPn1JWdOzJf)cOloGK#+*}V@9w(_&UUaZLrI_-R5~;lUfo498JRdNDIOQ>=
zIQl8Yl&6$P<uS3X+{Pt3>dT<ju~Vg;c!M*U?D|YbDa>Rk%w!eru6N1A$?Sa<pMc2k
zzml0HWt@A9r-C4Z?}OxDyN=+72BL%45#%;ZdzX6jIg^7;pzar&TF;?#P#XmD`!k0Y
zp?Xn90yP(ta&02P4ZTPj3|Ev3mw#1?vJS$A`i#J4@+6@sW010sRQ5^U^81UOLxV{u
z$|b?4glP|{{q<_UW2p@_K4gxZK{j($>s)27YDES0(c^fg>%g-~yx_?69m69^JdZ31
zTt2(<*pk2{w5vcNOCssX98V-Ynd7}k>nkM5(~ETYjFh7JsF8sh{mZ*V_b=}h#pN%&
z7wGR4i@U0JFFr=qLv6+G#nh_W-HS82nrb=Z)XgEMVh)+wC1q4l)lzfX<G^31`;Cx&
z8t-)ThcC1Fb5L-({$k^kEFEWQo~74X>a|pZq*y&ttdTND-7-f5WFFk$c^W12)gSYf
zuR{5p5v6?2KvKToXe!EW0H<GXRd-d=W35mUD86I3gWwHHWjtub*G*|`)gEu@9?bMj
zg|R8KFIt@OMwI=N8Q;C&vkdo3s{q2|E|2Bvh_$^N>Ssn(U*qqzcwqVIr(n6S)WFi2
z;DkE?OMg!>+v@KpOB3z=#6U~+fjRv>ZRu)DSJ?dXER|=h{!X{YwR@NT3M_rx(vK`P
zuQEA4*UEiosr*g#*U!>PmOf_bdzRuLWd0tuw9ZnkAlKhjmQJu#t047PZK-i8CeE@5
z^S8;;1bh4nOK-9CZ<fk^M1ODE{K5OP^)}wg9>2uWF_zwE>ARLLu=($?RA0u{U%Wlu
z$5O4X*I&7%x?9oT%QpXPOV?N$Ymdu=S$}z!`Ye6jQrwr#-waDXwbW&gpJ!=~r86yk
z#nR_&{$fj4S^Bf3@@CQB^_G@c`jVwyU-s+#*iARPn%_tKKIiuhzb*WB@N1l%-CW7c
z?aN-suY%t)e!RBI{(|2+et3~(H}Gq6vMqpphu>0uAM*Q*-`D&$^V`mE*EnDHekbc|
zMBnCD#qR@tpYr>P-zI+F@%xFa`$F}<O3EUBOZdId?-PDC{J!P4jo**H?4O--Um^Au
zzs3CC<F}gMT7Db()${wom%TSs?8_v)$&W9UWUt_dH+lA#{5J60%I|w$_MR4%|3}Ij
z`~v)z^W&S&*=zW%=U2yXr!RYVi`J!=e>GOmH}~lIW}MeOv65NgB06N8dqPD<b!7r<
zhHp2o<J<#!tjOS{cxKe+1A44v##n7<3}>RS*OB|xnf$Tx#QeQ%=}VTrWhrhP=1*^b
z^|#U?uHZZ@w_yD}?GV=!mijH7ZRui5D=ZDxKU)y~NOPO&y|c3$4Ra-k)?YH)blNVH
z(sOq9J|S11G&_4Qol}4M?ChN+fT$zeX|@4tkB%{4cAf@G!B?2&Ycz+N$ulspywfqB
z=JooXYSAoNT19156_o`QnqI6xInw7T&;=pALcvM}>l8FBCY&X!rsxPuWvx`a$f4=?
zD(k-#yrke=1s^H+M!^o6X^N5Mkc3&X5{k+qC@SlpGX7P;KNY;F;2i}YD)?Ff4y5KR
zfS)DvoTyB3qB6UQ%ESguFIVuGf)^CLt>6O%Un%&mWw;TYCG(f4OkJWfYl+H)1x>$4
z!CVE;D_Er9eFZfNwmIhz?5u07pbSci%XlOzLy@xj6+EiozY5+`@ScLT3hG0r7_nKh
z;)u#(BP#2Rs4Owi^fCpHD0oi6n+jGaz!{+^eQV1ZNOYF0B%-p2h|2mQ>fCu0rTd7a
z|3ksE3f@q#Tmg@^Md@{6CnzbiyjEUDd&Om-7nLzy60;RNtl$|13l(rPT$Il4Yengr
z{WSBz&q}wFvXm<>tGK8v;L1Bo!9xoEqu_M~)e6}AtSDVGuAOa(&gy4{Ws_E1_GeMq
znw9--1%FrYZv_h!ELFf4mW$Fg+XiP^;<NOoT~x+jQ5kwgWz>bH&s6X?1y3t@O+l4{
zPZelFZZ#Q`G%M8>AOox7GNy{ka4L}*3LaGOl!8|kEK$IxmW$FgXWRLj=&Y-)uuPeX
z%WNqs6Q#13DtJJ_lL}r@pp!5iGe}XoruCL7os?NuS$WwD6_;&LRCYi~+@;`t1y3m8
z15icjdaOzRSb=8#R<k}yvplu{+2j<L{Y_N1Hi?udxKF|33fPyeC_SJ6zmKAHT^zzM
z44AiEZ#WMEH`ep?Z2g^_r;{R{qKncK6eKF>#hh5o3@koH!5{@A74QV|t`1GB;=*zT
zPe$Rln;E6MT?NmvpQ<fCqomd;XbV+rQ59QM#g_D53MhMv%HE=~w@`LTwQ}3qr&V%$
zPc2`N6kf}?^Md8mtR4%UW?ir68?WzVnr@zNpb7lU0}V8hUoyX5{CJ8eN-0`R+1q~9
z!^>suTir2-UH{s)$Ln5vGCx}bOoC!v706JPA|_cuF9oKaY41_bj05X2cjfDL)1Uk$
z?Q!TIEq%?>=)F$*HI_bPsod7}cfrpNoo?xSmY%ZDN!N!m_4m4^?e{zJ981^Q`p>ZS
zjk9#VrTZ-HXY0G)(r+w1-`01#rAsaCV(S}g>C2Wz+j_6F^fO!kskR>Zg6r?UmNr@H
zvGtW(`lY33+xiMD4Or^7^^LUj1xxo?I?&d?%GQ6PttZdYe_Q&4rI*?IW?TBHrQL0P
z`IauSw1chZMoXWuw8_#8TmSpE{sdc3wxy3-y4})?Y<;DcuCz4K*7pZXU$->Q)-%-7
zCoTQK(o|c2wXMISt>;=x=UQ54>F;fQ(=C0^($j2xV=aBzQkSh~u%-XBbi1Wj+WISP
z{q1Z$11x>W(r+#8Y3sY)(xsN3Wa}Gg=?j+bwKUV#_YX_!EWO0m|F*3^%GTqx^nOdf
zu{7D%S72$t(&KDBH(L6PrMoOmxAi?}>9>|%XzO2S>)&l@imgwJC-nEZrHQt_36{QL
z=`psR>nxpT>2^!6wDsL%X^o|Lk($5xw%(nV_O<ohW$8zjcD415vGjkIY7vwEuCerC
zOE+73k*#lrrJq>Z-PZq%t+&q7Ubeo!SXymqf~_yl(q}E*ZRypvzB!hDZRz>8zB?^_
z-_mZj{&}|E^_C{v`X*cYuBGv|p6e}r+|r$vUTW)`ZRuy0o@MJRuyl!~C))b4?O@``
z;tElDL5%CR!~vr_J>ZS{%*#Vr)Eb^Z+#N#(JzW`HDSh`(zY(KTJ9%-IZox&iIw8Zi
z%-dtPH)@5q$A|vTzxp35I4)k1;oIq+_2OAvOnKCE&yXF=-?;<FsOq5$V_aFIJNa9x
z2-$}yI`yOmG{`JZJsHZwIrXe}dw=(lw}(@~+w)s0=$Ra>fUUu(;8~7Q!PGVtv|O*f
zrCYfN$UoLwx)fUEmj0~RQQO%2w#aqcK;TH3e6~CJx9;SD3GU>fiSFd#z1%&{a`(te
zaQDbgboUs+>VT~&l)$e##X*ZoOM1t+GDdfK0Fy8;-!Q<->gDfzlA|uB%VKxw+tfq#
zVP&I6c;O{mrH(s!T#7q+;vjeO)RFGw>D>1$Fv&e`PI33hALQ<F+emkhqTub&lxNYq
z!kTOE{JrXslF)%_=UM!+)bMeMN}>TvIaYKtv7#(ut(x&BCY)By2z9@D5UslYwSt>2
zh%7La#rq0VMgCBgJiHgdIEv1nIEY~CNP>{+UZ-JHsoOoNQ<RNR(FlZ!ZbqmmAEBb#
z5GrbESb5uq;eOlFuwY5~{V1uWVdgf{Hmr0{;^bd(P;w?y0<DL!TG04JjWZ3oZg2lC
ztnvDuo*6F#8@#34rEnI^j_?taX-3Ss?&N+A44HKdnUxHg3U`n62FA=f#>`5_3|`h6
zGu!#?NTH_d!fOiNPx?D=e!&cHXS}=s<ftBAGHSFbIy7SDGh*g3V&*VnioNAii`_kL
zp3iWZ$8ed$a3QUzc*+Z{A-%wqAH;N>DO?SO%kQ_6U?8e*Pf<FtqAX&j0r&R`gDN;q
zy8bnVsYT<1nZ^{YB2?H=6*jzrVBCCyiSr1i&LMC#Z5bWu4YvNGY($DiAX0QQB1QR#
z6y1hMk!{F*|L2BKK;q;?l;}stI>Tcf%_Rkl39^XsWs34{PoCeVxz718pxnnCrwNa~
zZ=T$qxMp&Cufmx<yWXwyMes5(+zgB}II+*Co35nNpT@Z_ac^Vo;?xvz8+l`MiTg|9
zMJB$Ac)lzs*^H(UD<^lRHyKa)4NlQS^g=`l3}7>TIit7{D{8A#*qMo(@CfuZ{g*s+
zhokfGZ_xK6^nDjCE2Q5FqvdK7)|hZp6a$^X{{dqim5QWo!sK`+O{?fx($gpilDXm9
z1qY7f#vZ2M{=?yUEO`D3{mw(bD?)g(GRfk}t1$2+Zt*1kOYr<p&m+S#vc4A2?H13k
z(f332eJ6yc(Q>s3YfQK)`e^VxCS1Ei;JNQ`cy<QQZs^w&{VosT856=Y#^6cZ;z|6M
z;F*2yk>MFxUyJ8=7SFHH_XG5OJA|jva<vI-Ot>lLXz+aFoG|SUf#=VM!?P23o{oN8
z941~C!jmO@c6{<Oo$*QB;z|6M;MqQ0<Aa{>k@dBBZnJpSpzr(WyC{UG(Q>s3YfQK)
z_Gs`N&pVk`v(X{&+<Q1YJA&tF=ywkKT^hnOE`%q}4&X`L;z|6M;Q2b+@3hkRpm;{s
z*Wy`k@m!0(@1gHoAv}$it4&yA!cB2UgXbyX+8qMVJ%_`y19+Z_e%$U(yd;EYyAYn-
z+<_-?i>Ge(e!=zV=Hw&8GqS!G&#e~EFVUBa?Zh`jcp5ENo3O@&o7x=>p3Bb))9w&>
z?mirz$ABkWY>(@Keiw)EY#+jtyH)TcZt*1kOYl57T;qd|&&c{(JnJl;YtVN&`o0mu
z(`dQcgf%AI)c$Djy#2R_#<P3qeyQmIJj3pm`2NB0u4tExc6~!=#)r_1H)s;KXcBLY
zW|#20CFlOaxnbhQDeAM<_f6cERCbS~cG&&Mf%<lIcfH%<S!?n90*#lU@xl<EM$gqI
ztTEvxZjFxoeyK-9#q2N*)35OWJf&Z&`_J|udNTT*g?<->5IrV@D0X?qCvl4?@z#hQ
z>HX(zNnubPbbLnE*W$Uw;`urHR-^ChAv}$it4&yA!cE5<4W4Vx4Abrq=lib1;n@y6
zPeMPQ=O^|F;n^XCX9t5Paf>JMUxMdZ;Tj(l&&c{(JU3fBKSST8=(`|<r_pk?32RKa
zsl(CW>HE!*;`!6z@Qee`6Vb0b`dt{plYN2g{SrnM#wT%$C-Gl`=jVLJ??|rik@dBB
zZnAiOioWbiGx4<$o<_^nCaf{xrjAF0=f&aL9b$a`csM*`!LtkcC83|5^PT6-P9Z$;
z>I6^X7Ej{81kYJ`ZygDqk@dBBerxgk1bvsF@2ep^jh3rTSYyIXosI_2x--JGI|QCT
z91c(RDIb0U`kje>y+e3*4&m9^;7Q!#N&J`Kc~Q8=2R+{->ud4cXz^qpxN(co_mvQy
zM$6SEtTEvxCiWx09{uB2M~dh7hr=@(Jda1e-=Lptmd^M*HiYM~22bJ^PvXA>&n?};
zG(ISvk@dBBZm@WMjJ}oV`*H|RqvdK7)|hb9u}6bvM!0r|7@s>2hi4Rc9*2IvM!(;M
z@N|dp#H*R}ow&u5_%FfpA-pY*<b02;uf=n{#d8(<2GI9^Av}$it4&yA!cFd@!E-k&
z7g}i-jwkOI`Yj|FxGdA(kCmYVSrt08Hq$?xt$zkKvE@cOM~kvpN1D#s(Ja=DX0v8=
z1m1pGP3+X-l6(bOR~{%n)QICRn8oVTw$j;>=6!(V4_bBPTAkr)n{lwJ4^e9|_uHZU
zWg@A45N(ZII6^~NFWVXu)2cS*2hmjCAa*VJ9Hezjn6{(`?cZMi(5BYu!s~VQS2ZnX
zx$8idx(;QT>u{F1_G|PH{aIZ`hN3LoIkQ+3oAnLVvKDp(>tNFxaqe0ihM&rNSLLyU
zwxuk}4wl8iqAb?fwv<D;rkqg!u?n|em@2KrS*4pErbUai!AbQWtm=c*+6LbPt7a{4
zq*~>+H>YhYP2TXfIqrSdUnYpInq=}iSgIAayx}`+bA@rRbztn+!|kzP`W(s#D_`wj
zApBY9+mE%q16kKQlr_D>w<EdB_9q#NvRDk9&H~^p7XN0m@OK2Bv{}0%_UAh)kM+U_
zEsqRESu83(vhoh4+QGH5=cn3-DiNE71_!n#G(9=^9i$Zp(_Q`B7Qslhg!-oq+HJ9=
zyiiZH!93Kz>ZM>`%o*n&x?hf+%x<Ca{hIoNCC>d=);y3U%|ltvJp4QQ_b1!GWGKpF
z9dtTtpR-u^oXwi&5x75R{S>i(-#%P<WH_4g4yD>bwQAKqR&7UY7Av|BY|VlF8wr(z
zVWIwQi(sT$TK8{jwA*5<{tfm-8_Yxft6mEBh5C2jIR8NPF`ms?p?(gY?;7u~s(+Ty
z->mE&$g1w4-%`sq`uj)Q-()DtVkvk!%fGW&`kl?P?-4k#XUQS*!1;NR%44;7#IiV8
zl*MxL1Ir1`&xcawpjx!*--A_skXqZ$&yi3#SliXVZ4ryqw$}aI8r`;7s(*vXx4}5n
zzv`7B_H*EEA2`R=pRWjimbCX{8T&w%un%SV`tW-C^9Nm>!9SfGMOiF-PiL`v77N|8
zS>!%~bp}~K*lTyHURww6civKYERBy`7DtP+SUexG9CN>PNL3D_h1x^a2X9K`np@!=
zS@aNXZ!;baZ1q9fYUJ9Y9Rb@m<+t=qn?5l4g1y$NZ^GpLL-+azG6eSevVIQU-@dH=
zVx50K*7gr%UH?$l^bg-kN#6(ipBzP5>;{m|4gguK{?BIR{|J_jWPKm0|KC)3>=zKZ
zERGgsv7<o5a!mgpQkBDKq5eN;)sbs;2CkhC4u--Z+8%~)q*foKtwydb+7YmAQ+`X&
zwCMwrFW76X`X)@?KXi}j|2?hx|9|Q)wm#^`b_WC5>R>3_91O3cq@BV3Cr42h8ziK&
zDMA(-B4o1}!Uz@vWw8Zj@JXlT{C`8`v4uk9vN&3l#U=|8%Q5|bNL3D_h5G-XRY$J1
zZU09^;Sg;P!#7f^57Jg6*B0#v*tRLZrDxjofyo!_wN`x-Chs4*+w}kLmj0LdCBZmr
z;1e%fK>}`NT5|-J?bMYC1Va-EhW8>EmqIXc5W&=u1P6M18P9updu@@o*A{tuZIQRv
z7I}MZxospti?`RKtvz~vPkC)?bZi+1lqr*j3<{1np5wRQ(6NmnfU6QE;>%S&wZS$}
z4qfF%{DLj)*Ptxx2!^gC7+ygzZa%@pc?47E5VY}E+9F4xE%KMzB7dbV@>kj-f2A$*
zSK1<fr7hN9>0hl|cL7BmP@7`}Ij~5StS|->vm)W7@RrSK`IA3q$(}hbmut!e_-al)
z#Q}u(TN{pb(8yrB4f!XMbT6w$Whn_JVc!V(cV@^jH0a;Cdq9ssW{(w_Q6J*g={R&g
zKo$PZ7tS)yYVOjcuB?&3e~xvm){(2VgJ+BXrN48uL{_br$JDIpr{Ef8eD4evndRvX
zc5z_l?>@@x@ga4FDrCixYIrnq4Z-`-4BsmD6^YM?TIKIN_wF-Y85b{im(DtwYJ$#(
z`IzX6aKsv#fVWZt2D3!Gl@c*R_2PYDFTA*LsLGPF)*y}#;`m68kL36yj<Z6<IA>aC
zOuH6k%CnC1RY|4Jtq|gqI=6*4C8!3~G&nY`q3h%{MKvqs;zczTR8xUHY(DQN=R@Z~
z=RxN{=Rk|0#UV8`u%;GIc_~bR9-n)A$eZz{4s8`^Rey6^e>B_%vv3<6!Dle~<r54n
zvaKAKhShLcR4NKj8kY)REnZ7zE^+V2^{Z%*xS!x|OA)sXF29$!jd1cY#pnn(B0=0L
zxRWh#?out*3)4O5iP`&ru_<g_^0Gtm9V%%BCCO|({2Rqq6BCf*K2nT*(G8pv-&ITw
zY65lYONwnLCTOSsOR+{`x6M<d?;YnM-bB1;4)MPhp_^%Yz_hn5=<ZUjqYP6%2z;Mo
z!hvrY|F+|3#(tU+=D&t|15s+YRGBFJr-$Jm-3ov47JppDEdFp7e>jUjoW&o`;tzKO
z_`h<%*a_k<#kUK&6_jM~XMHF56EpaKs925aTgh;JM=?3H8T?;VY&$W7|34LLB<A4%
zR|kLM4*t_a_?z|~1^x@#A0GdGG$YL44g3dy|1jZytMH!|hJQ>e{KZ@RaV@j>!&&^{
zEdFp7e>jUj+!5g4yUh>^+7XfmO7ZW6+zLuE__Hb&{D~R-KTxbj^$CC0&VoNNgZ~SP
zZ6{{%e@wAPVh;Z04*tX){HKNRH|;$N{QI;!JpMn^j4=N=@XrMQJmEh<_}>|Ze{3uK
z#asMiL-@m4{NXJAa29_!i$B~E;QvaSA=HAu6yGM~R#1|`pM}KWPt4%|zG5}1Px!Ok
z82pJD{GV5BJ28X*T*VrRIr!h>;7{Da|IQHproBgj{{psSXnkRiH2>_S8Dai(;C~JH
z-zfb5DE#jT!#^&S*4p`Byu}~aH9P*{EdFp7e>jUjoW&pR2=MRSW(c+5FU9MH+zLuE
z__O{R{D~R--&3qc^$CAgX@fs8ga3aO+fK~j|EOY(#2ozn4*tX){O<_iZ`ykl`1gr9
zJpOxVMwtH{`1c3@8-)KKg#TZ{@Nd@&fAJQ7T-_}Ga29_!i$9#jAI{<rcLeyq(q;&?
z;4j6u3b_@OWbkLrI`|Va_^(i`M)e7QR<?sbF@yheift!m@P9<HMq&>BWe)zt9sK_i
z!r!#_DDYnpb$I-D(~K~GJ@C%}|6JieUijZ0hJX83_=~sr;~Ho2hqL&@S^VKF{%{t5
zxFf*7cbg&9g1;266LKpk$>7g2fAA+}@L#T2jp`HrYz6@S#0>t=Dz=@N!T%qMH4=01
z_c{0zcksVGguiL;QQ+T)?OYBw|1{BzFb_ZQ_kw?p@V`a)|2Yi*_*VFfxA@~qXYq%#
z_`_NJ;Vk}e7Js-S!2gvtL#PFRDPAk&R#1|`pKTGqpP0danPN4nPx!NW0{9a%_&=lA
zc47wqhZSoi=HNfu!JoK;zuAsK_uc{1-lM>O!T#vO;@?O!!u$cjKOOwDh5yaM|F$sv
zk7<R!c#A)-cNTv*i$9#jAI{<rXYq$S0{nZo8A2`iOYtp2ZUrS7{Mk$b{D~R-s}-wJ
zeZrqDC%~VW!T&#sZ6{{%e@L-LVh;YZ9Q=tp_?t~E4F0CQM}dEzeTT=N@1+h6^B)BN
ze&9b;`16>RJaB3l{vBH3FW%yhtDeOl&f*Ve@rSec!&&^{jsX8x+6<u<{H6G2A-95(
z4F2rD0sh1c{!10BQGLRnT{^&@n8E+wift!m@c+AFjl>-M?{@Gf?%;3s{V@2O_8tZP
z3-%r!|DR|^n7<+Tr-A<v;XhXR7lz^Au@(N}E&jOnS^VKF{%{t5IEz1=#UJhn@bBGb
z2({oZ#WxAL6_jM~|5UNn#0>sbiq)t-;s2UqazHfrKdsnyVg~=eDb`5L!GETMKXC_t
zvr~$}-?aBA@b9zdF!<wlH1J2-5zEti$U%_~0QTwEs{_WU0}8@Api`?35N|sGUqIUd
zaJB>BYzM&E4uG>A0N2t1+T<tf89r!$c)9HuGVim{N_u}Q<W^9S!JiFYz@M1Ge~Dr>
zs!sU7s+b%W4gOClww;*4|3SqXi8=VsaPTMY;BPjTG5DM29tHjjnht|M&G><4g!wZ9
z|JA^Mo!}oW_@{)y-?<h1;w}8R4qEu(Ec|d5emDz1oP{5*1^$EEf7%S8mhmseHww8G
zlw|N{PaN<kX7J~QGWe@L;m^)F;7`op|D<Bui5dJKP^^)dgMX=mKXC_tvloxS-?aBA
z@bAMH5)XI(^F7T7^M3^YtHA$S;eV6xpB#q&v90hIZ}G>~(Bcng@rSec!&&^{EdFpu
zfd4CPhENOsQhbAuTR}+%fA$ape_{szO2ukapYVTKF*!sU{GU*4J28X*{fadbbMU{*
z!JoK;zuCLU;BVS{6!<S-Tgk)W&quL`hWSf^zX$vW3;$8V|4(7~yIbKe-r|pIqQxK1
z;tyx>hqL&@S^VLS0RP@?hENOsQhdFTTR}+%f3{o#e_{szfMPYOPx!Mj6ZjJ|_&=@~
zA8~i^zfZA7Vh;W#4*tX){LNNR27lAuqrkt<j|amaJO8m}x|I>07a9rLh(Vh$_&aZ!
zXx=5<7UT7;(q0dIN0r?I-FN>Rv#-A36<8mWdGU&=?X=Ov@0JHG;CAVI*T1^hkAP+8
z+DMX0+P*d->3|ni?iaa@Kj2LgNfF*onY|Z+=KeC?FL_IL%OL8$>+gi#pyeN}oy{AZ
zWjCz8(KZS0uCts?6J{x9vmBw4;KUlNBiJpWwTA9e*)Bp_X*&;I2drz;EBdUT^Rfb6
z`msf<dHbTbJ{diBJ8xh7owII@+$&EVVXruw0cblODjBGkYeV&NZMa^pjnm7uiF&y<
zRWH}3&-o!0MT(t%$!ee{veyxeSgAg#AjqFjaN9hBqB-0mZ%H?AKX^A*JmsF&eWLeY
zq1LzR6XSYJpP&tW;>2bt*3u_OrlNWT{feYtk@PE)enrx+Nct5S{n(;WZ)c2tC1E!i
zJwEgHP?vOO|Jv3Q)tv9$4gHFFBc5I?j<=2M@F)&^*yd3jaIx2;IM8FmM{$73?hNAA
ziCZVGL0m)7FE99hj3amJyyl?U%1t>-l(R(Ked6vD_qe#n#pzvt`v1fQ#0A8y636Ge
z8~Uv$5M*rmMv!$teRvGuH84;<z4!(gAL?Q{C*+Te_}!Z45jK0(sm!}n++E`C7k9t7
zC&WD=PQEAUFN>=bS1ImeaUYA@K;Y=JfwYMF;KgF}!B-`+KDzEBZ1&<)nWZYdRNMpN
z9uW7WxF^NQ7b^V~ar$Co`eJdb#jO^%k-*VsBWV%!!K=#XgYQ&ieRLm)u-Rx(WzJCP
zGsHb8?m=-+iF-<%obA$I6}Lp(5^<l1`$XKg1dcx6k`_^)A8`nvyMB~MfX3e4dJZ77
z**Q^V%v5PJ#r;j(-^4vF?rCvy?o5A8T$Q*gai5C&RNN*4r~XZ(MXdiPr~aQp_3Js1
z%w``*m2tO9yIb7f#r<8}zs3DqoScW#7l>ObZmGD>#C;}iGl5h8X3`?ozssqASEzp3
z0my7NwNx3iRN5?Y4~ct7+<(OVN1U9|(_a@?Ev{PJ=i)vWw}rr|e+y|5>u+@GZw%Eh
zI}n-8_M9qXwo02V?qP8ci+e`gGvc&<A$_5^W#af$dqcl3#C;*ImcXgMmb8fVhxy-=
z{chO-$!xY8RT(~&<`ef1asLqathi^z$)6|v4ROoGEf=>&+!}Fp1Wx^Rq#am)TYnU?
z-z_^Zna$p*Dx*xLm5F;q+#}+i6Zf1r`IDu;DQ<<h72>`W$LH=F`thZDTmM$lBGn)6
z4@LI7buA^c*#}l-_*I%;+@s<i7586p{}m^H#`L$uy(jKHacjk`6<1H-w7;ITNcD&N
z<B|Pty$2$*+0a&H+@sR&5jR)dTyf8fdtRIzWYZUkdtco9;%dazh}%Zs)W40iNcD&N
zgOdGjy$2+-*_~Hql&iFIagT|6Oxz3NUJxf|?DV(AeIV`wabJo1O5Aq@PW|7Jc3}O7
z^EXEPZoL;q*z7y3GXJX5|0?dE;{GY_MR6~Rlk<Q2JK{bR_o2A2#eFSqJAtFmcG3>i
z$NhS^e>>UlF0%EDs*HP8+P&ibCGKD1UK00`xOc_9EAAt4ABp=$+&AKO5IFVkAT2`u
z3!DWMt*+nwCP{jdq(_PyDQ=LsLE=)xrHJb#u9vt(af#v*#3jJBgK2N(_kKl6E7H+?
zarxp#h#Mg;OI((?E5%(Y?tF3Qi#tQy8RFao$13I~a0l-@xc;~I`j6#$(%$QHJM~Rh
zuIZAQC~l&-;o^pi8z^p|xGTh6A?`eJ=ZX83xL=7omcZ1fpmlxioch?I&ek_gGSeh;
ztGHXm4HGv^+yHR{#9c1#a&bMy^%U1lTsLu@2~2&RNorkRoKs(1sJ=TTbEjk`h?^iT
zPh6h3OmUgwE)#c|xO2swEADi0r;F=EVCw5cQtSF+o%&)!_1z(vJ0$Z*aeowdqqrNz
zT_f%qahHm_RNOh@&JlN-xYNXSBrx@LB&l_MF;0CvmRUUiBALHP<`3fjAnpcnH;C&m
zuD`fT#9bopY;k9cJ5}7N;yMtR`Z|!*y1r<qzUWYWw@c=B$&42_UR<uYTyYuVGQ?dh
z?qYF0#Ptw&invq69YbL1JBFmz^+h@L@tF(TzCTOm&yu-C+%4jA#N~+dit~!=E3U7&
zWO2#jx{B*6E}p>D7f({F`c7htV6Ay@{Oy(VHp$#3?q+c}i^~?5EiPSLy10wPT_o--
zac7A;S=`Cu+7p=i+LIKj&p$NAf2=P%hPD~|rE*S{%v5pX#Ela-RNPQ;{lxVX*GF6*
zalaM!TX83eJ4swS0#l!6l2-LatG?*g^%Y8{P%>l1jTJXU+z@eT;?l%jDDFaW-Nkhm
zccQox#l;br`r=4xRbQ0qi)vk8fn*9KGe+DPao3BxUR<iURB;!GyFgr$xFm61#B~uD
zOJM4YC8?#pljuEzq~j*6oKqw-Mcim{qs3h(?mBT-i@RD}Z*jfFohj~2aVLm7L0k-h
zsV|14P<>nvqsIA<W%*6ixZwDlESbrYxk=nj;;t2Ut+=biT_x`K;(jmgH{yOH?s##>
zi;E^O^+l5us?YuUN#oj%&p%1#Pm&oWZj`ve;s%TJi1Ud1ow(nL`?a`Vi#tx-apIx~
zOnp%#wbZxZq}eAgZt-6o;`MFvmTc4K8!~;<8azIhHjd?+8^dZn<>}3(P0_cVms#HZ
zs+hhmPw8bzu7cj)@@~nB1-3+I`p2%j${+id*FTIEz0+7<x^39v-mKPDbSw*fZBlhw
zjUGV<4W66h3tZ@OCAtPZHaF+eKtVi5*sRYr__5ra(rGoWLUu;zwj#Q(tL`D~;aA@I
zkDH?*X?%+#ZKc<LoYyyGk=LIak9teI{vj)SSNPJt@I?>0Zt%6{dlc>`E*`e1@Z^h!
zR1_Y6@qi_TovYKnQ2EO1i@qWE#vIE31Lb?mPrMo8Py50@;Qi9wvA!5z2lqW4$y=Rf
zO7fP^?8V&%_0ISDzE%a<nf|o-@2VZX-3wzO?kAo-15(h<<8yg@Ik6s}H{RnL)Ty*O
zs<b(NTDy$WiiG;rzG(|bsN&vy^y3Hb=m87CXXbMEU;l+@YT1l9)si~9I;D6^x0K@M
zsKUQ^ir204RMf_$xfgtq5!e`;>c1!M0y4Q@Uli8|>M2?8YPix>vZbP#65OxPFh@Os
zx=x;wb<KR<FtDSYr@124|6p8SWp55NS9_W((|nny@mBk#kJ8*Pt>m}L6WH1z&6j!_
zdf$0kr!-%e)A+!>7oEMAu5#a_-RHgKaRa0Jx=Q=H3Oklgdq4WlxY{fD%Alt@Hc6n?
z?Z%EX$Bv&~q-6ST#irHsBxD#vO=-PZbvA8XT5m>FVQpG(zSuGB3s31ZkeiVyvs`(%
zZ(J0ADe>);M|G<e@9Ua+{&fpggZl~k**D~q8&mybKk+m!At|;X-m?f{SA9oM$+vtS
zk%71k>u%gri27YKE2ehMEWhwkA|78gz5F-0G=Co&{(EBgD%0_vOFuWcW|~}|lU@{-
z>-Ml*`Jr6nTXHe_I|SBsNcHXU1p-^o2-KaC>bv~D+%sLNF?)P*b6{cuo>k4Onn<2b
z%okUzgT4zdq>Q?=XdHvPWFv#y&t)*}RsZ04hIUzQr`f|Qs?&5blA-V^udi^K#vVg&
znLll%`-wI~O#{oH_Uff+&$wrPjEp~R;iYNw-7}XOe$l0A&%0;7316M|u<)d~*|xaZ
z{<Mc976;VxTOnJWHV?sKB<EPkIsUYH5hY8e>09!}lQXMl>iZVry}s9SU>(VsV*Tb=
zM0xk?X)l7QFD@hJOxLPfUtAhA)z^Lh{)<F@fH1SLg}~UROg|&dU#LlksftObI&Cg$
zMxJ5js_D)QGuN46ZlS2UYNr#9*`OI_roJsfM--b$=5KmQ=FBsX$rj}G4=84;nW^VO
zUzA!CoNXRc&ceit|EA>{g<UT$SN6h$YLnGK?jKSdnt2-b(S-67zk~Qq4u84o4b4BN
zB2hh4U!757&}t>dT(58DAW~XpArpO9IgV~3dRqlMa}l2vVlMid5;Prs+%g@h#=}lW
zpUB3{bo3eY!0AXwBTh$O=)loTM*(L#S`nI#-u?L^GaVgU`nG`6jPyJ>c&gJ}0=sTL
zn{x+m^z8c^Ge4DXOYm}WV*+Zjqqt$ACXoZi;bl?N2V53C{r8u}Og}l4Bc&J9`vpwz
zeVN`bYe`NdIf>+ClFw~PP9V7p$z4f4-CT40!!YqMN{#)$WSc&H<SoB5DWP@*jc_kW
zO-gu!7cVYfr8lr4y0j_Q>&{wb`=veY%Jhv%8kFgqkd%|*W4Uxe(#TBTok_QNeR)Zf
zyd?kms$HqipHS?cIbQ|)9!x5RGT#m?zw`NotKAFEy~10vPeaN*<F_iVy!)2SGhLpt
zF58MXw0AG~(mQi)!Dw&k-e~uXdE{bdTF!BA`Q=MQxCCXE$6dJhBA3VgdY5f!{-kXs
z8=8tJ?ez=lG*c9FG1{z)k^kHsfvqvj$L_%Pc31hXkBRN)8xs?Mm9HSC(^bB6V=|hT
zW|Z!ab>E}u!RvSQ%xJF4ymYJk9$l+4{c5P6hGzQJO21m^S1U>Tv$tf4kX!66-Iw8>
zIh6eGs?)vY7bMmG8^(V@lJEP#)_6W~Rl3LRo~etbZ)c#cOUe2M4tHEpx|`HrDfRm|
z^mVep)=q)#u_YUHv~;t(<7cIN+IiinYwGqeP`RWG-eXSJ8w}|@8e$Y2=iX6qP$hX2
z;o`@xvV1MrD(v_%*yj&B9uswk#jLunI?a3u*bd8e{<MYz2BjTCWM>RX{yJ~zws@~U
zu5VxZr?jcL;1sT<=MZ5%k+-xyzL|Ta7#%3w=`CFnf8%oQ_ast#{(ts0D<$~REgC*G
zfBcxl{-dUj8j(Nw<`Fkd&L1^q{KP2*;|mH4#*Tnaym>@n!T1SNMobzte)281-a2CF
z*wF>~lQZ*go-lUGltCnV2MieThl%4eCXO!{KWf7Gzl^<l!l)@z`i&nuVaycI#4!U#
zjlO04#IXZLP5EPT|A8546Q_<yJp0_l5r4?P=?@g;@S`QthMkZ<@#Y?AsK16Q7tGqn
zIl@?L^EcI~bIBzm28<Xte!_$iC_i>`fy*^{?5HuRqY6fO^CyfMJK3n@x@FX)3Hb%L
zPa50y0A=2Il_PW2s3~Ko5SRSm!ch~%J7tc~pO~ICNY#%SJ7H{rjpk1sJ9*TE3F%jJ
zBvgK|5b_S00)&Z$D3v&+aMGj+<HwFkyk*qnF}IDHJT~!GKuIjfPn<lq=lBqOiQ@_<
zj#lxBlk&$;EEqd^O5(Wu$%z)~4wU(S=&AEYk7lJfUH;qOCjN%*NL07dgO?;;onJU%
zOyb1+g2bE079{q|NHw(z2Gg3~Q14O78TgJ;t~JyWJ(@aOb<1y#My{m`sqrY<7~b7R
zTWPGnq!dFAO5^QuZsg5hkUFu}AtQj{F>1_+Tl2?^C>T4XU^D|Xc}l^UOD?%-)Rgg~
zM~ojgrGN~#UN)Lxb#9_LB6dW<<Wb`brkLa_u1Ngtxrsq(oo6@Y=T9&v7t^8sn9n2q
zHC(OK;u+_8cHXja_G?YwUh%ijep}n|yyLELa<`n9W*!-nKVo$Lt&^BKlBGhhqH_}q
zCr%lE^F)R|%?VZ>YFSXP<RD`vf{d&Y{W3Ds63-6K0g?1`xy<BbMm6W@xJd<*&l^8w
zME<0)6O((m6qQt~Il>uVBSsbene>5$x3+*nJaHlkWAY1cnlKhcr{<3yrPFXqB8Obg
zw3ld`msl|V*0Cmi@>ovJTSpa~KW6Mrg*T5FQ+Vs7^9uf4;L2~KOJc9Yam*%Tb^dmr
zk{JF^BAqw^rT^3;@$$<P3r7Dx_P#u>rmuZ_H_%{;LXjMlv8aTk+^0dNkdzEXQIzHZ
zMRJg2h$0OXMN%n6^SDoiMs+IlR1zgaA#-@|ea=dr@ALG1p5O0%-~XQd`CMJ=y4Ssi
zz4o;BcJ4)GuDb{7-*)?6>^8mFH~!VG>*&aG+3JbMhPBPwajUHdYrDNC-k4d|8#mgz
zdRjC4Z0qjs;*Nb`E_g@0XLpZ<tGn$+dk^N0^pCsm>EdAP>@n2?@A(t??Wwb-urwx5
z{M~&#bmac$tRgrF=xW2#pE8AI@8s%e>tyTf$sc1D{y!N#H#k9=6)WaxOjYCe&k^sj
zp3K?Pdm%v?-Ic5U(*n#v{k{FW>$Us({AU(iKE3}HG|_#%|1+P8V745(Hx`s<v3uj*
zTNdQ-%LSAO%J;@pBe@U#D`x59mGL)Vp2@xA-}jG=ed`@JtEvkA4!D2Vx8Ct@+h@xg
zQhx`EV#en0z<>7;Mki)cx%)5piTY0nq5cyn`CE5C8NuXt*C&c;{OCgUMTjB(r}cNA
zS6CD`7MoAq=fUse{`<UUs>iM47vVoN2h*Hi%(1{cUH+Ky$3<ZOS93E#9n9aJ>&uE5
zyP1)H?l1OH_fM!2|8D-z_NTkO?(6Me?O$*E!?fSMPt1AAoZElhy6f-e-}MvU?smo5
z%mDrgrl!B!UqO34*VCV6ne?CM5|i#eZ@QVO`%nD!+WPCYgzmV%f8ejz!e7q)|JnHe
z9v7zTxc$FAugLq05x%vU;uE>&9mHKrtLK6I=X435vp6CD+sP7{MB%KSnE|-ClPMH2
z3uayaH`Oq6ukJ~ZU|4?t70kDOOR8IUpJ$3}6@B?vO*2P8Hw%1!k244~i`!ENKgH?R
z-N&z+2Rt7?bZ6y5=;rS8s5i!X{zvDFpj~p``Ro1XpYB7A&^^EWYybXnfB#4Kv43%|
z>K+aJ8uHJlj^G^$=Z-3Kd*+hLSOlks>)mZPGjl?cwzgs34;lOKmjN^|x_d6$oiCVH
z;_K<}Y2_d9i|cW!x7pK<=@m2A?^ZaObn<45f3rz0(8swdGp+N$sg#E#^LM?owUe!~
z$5tl>>pk4I;=87@ldZM0@-}OCdu!*7sO+7UovghiDMQmWEL&%0`e(yZ!530*mW}O3
z?1YCcGm+ZrZoSc)WxolH&dfB|k%jxVfq5mhb>8T*m3ce0wUK1H$6S6a51e;<Vt2ad
zi9Msh`ez>-d^>01ONz6{CVV-b$b5rfX{)HrWu}Ld`2Mc$E;d^?dg7Sl`;TByddB&W
zF=OiPed7$kdukxU4e<{Bj7S>o)bs&n&MNqJZo_iI&l%R6`SbGuN*+ocTFe~1dqzxA
zeA`4-Wz|Xln9*%_w%v>~*=@Fe$)+6bH#kkj+X&M?Bi*I*8Qz3&L|AWhVNMS|+jKMb
zlCd)<1D}aTqO6^rx7vGpcQa$6@Es7}5(Lbz1GNoP2AN;R)7n{`$!8cH1neeY#t-fM
zwirge(Pk5Kq`Mi<SG3_f9Ug3^`rm1$?u{;<42a#6X_nCpQMT@z@JoY$nMxSVWH8LU
zd+`|!$ow{Jy<91T8uOgzGn41#%5<I2{IXuIPHF<}q$bE`%+w|ud#7$@44d#>nXi!<
zz1iBy$-0}-VCU_MJtvIX-qB_A2Go2;y#+h5Mb(YkqK1qOZNU-Vf}@FFlCYO}>=;Hr
zM^dqXG2aoNEm*OD`I<j$s2Ro*nCG&Y0e?UF%+!OLUoXP~&EIddt22d=neOqKXoe`#
zoPe2f{ARk@jdHg2^0eNB*C_h_PNN@__H@B7P&i6GX*bH%Wjh0Y-R`zd)_5lI%l=Md
z4yN6<x^%M}<+0J)k?9<t9i6+GUkBgDyu&g+IDUM_96UAo_d15jsm`}CX{I1!=d&C0
zB@Z<+qwy5wA6JI?nvB0U9xrb^UfycRc)Yx^O>b<Exr~|e>zUVbyptL%TcW#gDMhVV
zD7X%nt(<3KXtd0n@iAL!@LQM~EnBeyZN`KJ*Le38uI%jMjGyZ~Z8zJx|KruJj~6I@
zKV!Z=bl*-`c<Ec?@xz-5|29dD#d^meN=D)zhJ^$yEg=5fjY$d<T|x3k5Y4<}{JF^!
zagF$u5ti+?lXminJ)hY76D}uqTo_8Q?Z^2eg5yU~dk_>th~Wds2#!D65fnlQAv_P?
zdk}jK@FO}x7$JfXO~CgSL|=p$LL4E1@QbIY{Rn@=0Ym`eAVL(;2hkTHh7d<cASAJ4
zhj3>k5&f1?RDVPu9>b%E0f>PJVQXyP3K=n|oT84EAtR(RC~7bwD4n8$5mJc3h#|Po
z$8i^iFc^$!DP)AO3f6-UdSQfgy#O-EC+Y+UL6#<vVfd~9GRP<H2oQoSO(4VYLjh!v
zPdpGH1X-Fu23f|QqC)JD8Q`5P1RoAE4Dcim!5f1NLKr6kLlMIed+`Q(5)q0JMhry^
zW73wGMhrvjwLl+4C_)%96fq1jd^JUdtwKh~CR0>+5;8)rh@#@T6g3ecJBFf0BEne|
zbs8ay7|AfcfQI))M&LiTQ$h&NAv_-t6ha6wU@Jw*BLY1sDiSdOA&(e!f}*01BP067
zVDV^V2DX^CK}IMnrl`?~Gm9wdEJ6V>nqhouo-ss5P{*(x1m`HWi=Yrfhyi)n4k9oY
z+eHjO$Rk)+C@MM?88Ie;qGH048SKKe4>E%&Oh+O!*n?>fG6OSAn<69nUBG_EA|nQ5
zVcm$pOl%7=03nYUJDZ};X(A(r;Dve|FXAB#@Zvr`1Q{VY5{GI8GGf3@tfLB<!E{Wk
zBQwDJSfDC0qF)KNTa1htH-Mtf_eW;%M_Linv1n67C}H{n!;H@)^q+{#;E%K-reo2j
zh)}}x1%?sAwG=fTF$}SnM^SNzP=qjIJYpDPG#-nycpOF}{^2<OF+Q^T6g2@6u18T9
z5weI0h?u!JmWXqTI7Wz=@u(5e2-Y7QqlI=vG=haV-v=Rq=!Y0YFcf(>ViaODVjN-$
z!9nCeL@?qcA`Eefpc2Ox>)->+1Y#LJrXkNj%t9<ASc1%8IbsEYIr2utX2f;^e7g<Y
zhro6NvE4vyHxSzlJdHSuIFGo9z&`MigUq0SfJSC;9Z`y?LFnSxryz6?*na3*#QHzr
zfN2+m2V&<Rz&1h|q#<tqf%};5#$!wqNJ@!|NJvSEF1D5z>A$zX#Nn%|$QlyCAJ|e6
z(o&)^(t|}0D(XrdoUSV>Av!<=Ayuy0Uj!j_5cB%YGZQ&tYbkMX`e0EBDJ#(>{u)w;
zG6$odu9U>^!J-Qhhd)b*^jlyivS|2VrksR?DEf+yV(P*)Q?D-LFCn2TC0eekiar_=
z=qtKt;t-L=vyY1m!pmF*F%MydutVVKLg6Vy86a2)4k8W_i@1hhBg7F+2ucX=YlsC5
zqqITxLs%g=2t366Z6N+tM#Q6yd5%uNv=U+yrW+B=Ls=1FfEbS;8wYCv1Rg=bcO(4g
zl--D5-3~o|OzQW$I{NeVZo=f1yB*6iTl-(jGj1G#FMf!F-zicL+DJ{9`n~<!-JSgT
zuj(U}@QL%Mz%NVPEfDjs?smF$cWd3cyCK3oEei~Pw(rV}CT^~K2>TMoe|cxNK^(jc
z`P(ls0hbFh$Ubni1y(D40eAnEB8iUfzHtPGzm9o#x$b&;?+?E`_aTVuPNf}ptO3gF
ztg*Dg30RdjWVBj)gZ9*S7m7RsX0Qje-?EW7A<n&W!c22`xe|A?M(88qEnN_!6}9{9
zrD5!$SGGTTzvDeEC|^&?kJh0yrgLN!>w$OQ?FOy)F`qJ)TdpTs4<)IwUR%b<>QEu2
zE<w$85T*HzV?Qw{pJL-L8L!uY&Bx-credNxl>Fl*;TP(l<f>eq->7f-lux3=a{oFg
zDm?Y0{>4ZgDnK|yWpf>v#U5;0_e7z9vdQ*RUQh?#wHljGw_y8a=c|@Xs)KCyi10Rz
zH`sopez0U6%$hK}sw8qm0j0e4_@`I3(2`Ov@+DkBhkEqIdDqQa=xll5<`^%Iy7`z=
zN-f0f4}LpD<5xZv@;vEnP%W%Tt0=zj`%arOKJI(Zy%w$(nb^ylpf<2CY%;Bd3h&Aa
zuSfj~sHDpA17_92(<P%n7k&{cpv1qqo6FTgzhK&IigSoIWhJ$~=sORJX1|!dI9^7F
ziWiPw^n?eNqdwH{-#5H~Vny`(z~zC9l)mOPtI-8itK)*)^E~ibC>O9Jyj`0LX&x2r
z&x6gPiSnhF2kB5%sz$N)JaE_7i|vvfhIinFAvcV8P&eE*WU;1f0mW|3>Z{6wS&>qW
zNpW%oRR2TXHqtz>X&tltvl04psx|31H85hy7(?M}dHEFUMOk}#4Tz}cJlH0L<1;Z;
zd5upEG{;Y!yrt}CJ{8^e_J@8A#4bEq6fcGQ-<o;)LBAT{mTMo6s2*BCb)4X~*H^>K
z<%^e;ijL5szN~t!9a#;lleLFg?M>3AT!T*SQmF>RnF+v+Y1XEs)MiD{H{nO^CH1H_
zF&!$~VDk}^n{cb4a!Hf;NZfy?XDeP*!S3BV`-vPwZD+jw^^Pj|UOpy%W05qT55K4t
zQdO|6!ePbprD6qCxSOkATqQW1esFgfjpKLk%Z*(+m5|nNY?I|A?9ZyAVcNGVKp|MM
zW$Y?EKQ&kE&3CE*w{hW4J}a?*t#aC3eJg;otJY8S+$bH2)4u;pbUAF<VrVKlmcrwc
zlzMqiIoSRXy3^ke&*#*fk@9!TVAFw*JHx)nV1E-e=6aNYV$vtAc@~3keD7=<B2@-4
zPet@Or?5X>AGd@imx5vCcm25~ow)zk<4PBo!u7Te*Ev)1_=I1oI^T8!e(FeYho)fp
zY^%c)58Z$tx4oXcjXjf3xrRrrn0y1A+opv2vC+RZwR~*lb%?kh7$DSy=l_C@Pfs{r
zhvbXN!vY55^}^j&6g%)bWMr(?6_4!5r>wRuUvcFcjMJIz7a9KvuMhiuQKr`*?{L4f
zM;6QD_yn%l^Q8ple~#*mIQ>PN;z*ZuMV5d@w#e<XInsDOH*^fpD*^ws!5xM7`rz>}
zY`NM}48=PmKP=6`<1_Kj&6k12aQe=RK7HOu;rI{brD_yIl;i29&0lf<<Cl)@`=|)I
z25)yCkcQV6Wh&IVuL#ySdd)V6Vr?pX$yHP3BG5bEr+kzah5gyLchPMwa9I(j*IX6B
z{h3@^>dOViE$<C=zjbI+_hvk<n8<}kckb)jF2a2Fe3RHX8W!4oGN`YR)1i3hRkFJZ
zA!5?L&4bu@yr>xU>J^1BV$Q(G9~-cJR|m6amkL1IK1_Iy;+K4i(;C((S^#0QykC3u
z!SQglk@&SPA8h+{^*Q4`s(`Z6yYVY058ixKG8|`)<IPL?{9$MwSYKZASiu+XFR82Q
z@44qfeY4E;;QZk_l=0}(mv}j_c=?i3r;p(E(s(P<ep(J(3N`R``ii=vQ%&kvHne!#
ze3V@^49~X>bYy!LI4z*Z$4L*y`o?GUU!Dbi)8$759!$XUYDX>8GQoPqfwUy+z6Dg{
zDBh7_neZ*iXR=fSj=$=A$?zQ+Ff73T7tavKhibd$(~u4=--iyJbQ{N?HRp-uymU~H
zS?&DxGWI{Hp{)E;8d#50e<v1z=abZWV-@K%xbz}GoU;P2f8OaC);q7l*u4A(#R+)*
zH=fbk*n9<!Tu*ntvjny3=0$2tufXY~r$)hXc)nTXOf1h%g=}fBBkr1bKjd^2O;k(;
z<s<pU4s99QRCG+ANLC6Qeb?&l*U*afWpJIoCBw|lCueOu@cwJ1n^Jr`2@*=|q*^90
zdd9=htCyf&LvqO35mGu-^iRtdL5W~f_vFFx61?8H8dk}!36Rh?N`9Ry?!T3hT<h|9
zxW6T0U;c2s|8f`A9M`xA8x|#8(QCVa&zqfh5@h3`;@;)0rw8Nxf;&EV($83!emmIY
znC%cef0nome10D8TPWXjwP3D)tGA{%&%r@Is#bUb-ai_th_9J35N`I}6jtN?(<-m;
z*O+KXH*dFb*ogOUDkSTy{8^Yaf6H6%Te!beV(`b$k)S<mn3jwi?hnUd=$qT8V3C>Q
zzEsLyn__RfwL3E$cD@_(#<LvHNA8pD7b8NUtwniU-V7XnHceaZ4gu$H%kC|d9Ej(C
z>E6iA$02Co@WA)?asR2hWJ{AEIQr$jzkkjXZ10`_%-u&|_=U!t#IsF!{aR$5Sr-76
zc1orXcjED<(hOVm{NR3zY0d!?te<+3C8o@Q;r$+ro$wuxKXusg*>o>xcN?-dbP%J1
zC(V>|g$uzN`SWUUe5pk<o(-}BNt0h(`MXU1KW$%_sSV%S`0LkCZ)Sc`56eDFUNxIo
z4~jGME~fRbhwam(zAL}0gFOF!+lp@2f$6}d&s=lsV9~0f1LvHrgL0GE#iRY|K(Av`
zm4ba8v^;qIW!6%Bj!z#s%wc*RSg&q)mnB;V?4tK;6n@r13hy-Q%(GhfReEX2tnykg
zPWKUddASzOIJ6g}h19~_<Mwi4J8I!VLjCjOR<$sDV%Wzx!&>+m5jnD6xfa^X7fu;2
zT?@BA?Ed2Z6`zkkBg|hk@L)&5mQijucwnYIXS8%O5B3czSFbw31K-OAQzLiqAnDe!
z*1gs|$b9*I7H0tuD7UiC6VrGwoD=h@U>FaCz4E7YeXjwpT;G-P6*Um)`EWERq6T(f
zd8f6{t_FDGm)2gHh0o9X*)t`@YT$ct@Seas)v%Ltey<f*4e!zn*+aHf!$F(cvC@Xs
zP;KXHqBE=-cFfoo5cJ|Ed}s;v?VoiM3?90*ryjTotL85Z-L>i_%xfDk&3)2MaLcpU
zcJx~nILG@;s;jI5-L)2db)u@^r$kU?wR074mMzmfz^($x0UrG~4XJ`WQx9>6=1TCf
zuzhnfvl4cDfAx70Pzf#LyuB^fRzigE^$VX>D&gx-lj~U&=36O8M%GtAQ~Rs87vd`5
z-kAKo_1+aQaiQ5Lr6m>cx#qjyDOLr{@bcwM?<|L}=QQrNmzG1ynJ(j+)8!!EH9ND`
zr5v1J*4KQ}FNbd-(>KqREr*;CJ;V6dWuRteKTD&i41|vc_Gvm<2EO@HK3BG&J+^w&
zIVgiEw?`gNmnnlUv#wRNyex%jXC<D@p-W-sx^oe!A*Jy1MONj!Eu|n~|6K1ol*0EN
zGpl(+OJUA+C7m0uZorJR)9W7=-2lT$Z~91u-+=A#fU<GE0iUVBF?S7az<ky4+4dt*
z5BfA>#QW>;bedTB%d+cmcW&^$yJxS%#m0ivXWOoWZGhZ|0ZXsL+m*)^Rw`YG{Xe#e
z<#%0!eX(2j!mVr2=gujc#!J`0-_dyAnSIw_`F@LZ@3q&UXj|h=x9QhFr@}nWzuz^u
zH9Jfu`&kM2U8!vElV1WqR(KC`4Jm;adv`4U<X8ehZ9jL0&np4R;6vUk6-r=dYp1;G
z=VGX6-V92-V(^w(pF1O=7$WoIHe2s4hOW<R#>B5JhFSMt6iLh|hS$eL6#WMl!>ypK
zv7=gx;5yeVqPnOELeBYYJaxJViVh65<ZLa1*Ci`9aF!K8pJ!>yPE9I;aZTTZszr)G
z)M3WTkx#fVen{4&z1duF2$NeQe1Z$?N!r&>J8?ljQE%bW1zcGEHRPJyI4(K=Y51^G
zR`b&p8k9;S9mm+w5MehZV3z_7-`mD7lDu6AUO8^=rH2dQU7}-Ax?Ul8W`6u!`?UZ%
zFKxQ3aHRmIzdJGJv|Rz@>s5vuvI^k6SKTkxy?l^b{z7hYP(F;+%1N|dkPj6~?%PVK
ze0XkgNp~$ir=Oa;)yli)0q>OVtA11Rpx;Revx&{Qu+LBFwp&y#_*<-3Z(W%SeNx{{
zKP;6C24~%4)>Py`N7*;Mm3}#}du~_buDLnzWT%-y?U!sY-(WP;I4v8_&J5&ybIJyp
zbCcfGOw0z6tT02~vn&w#l4}0_OcpHMaOIWpnk;g@Wr5}Txs^L=GvV#s@hM9KGr`C?
z$<SzFCUoq7xz3|cCWLP{yIxY10XtGk=Ii)oz|iUq=?z*LkW!g<Kk;)qtW&t+e<nR0
zGMjcC%5_VJ*1j3(Kc}XHofrG|me*+@VQQ8CGa(K3$|h>%ZcYQ!hhk%*l+s`zCyRaY
z*;QzIx6t8U%vIRC{+zq2)m6~-{x~s3;VL*^DYG(td<7bP-@P6kc?A+<LZSz+y#gQY
zm6lB!aRt6owpE+%r^2r^>(}Mssjyvl+dh+3sW5!v!cCNHDm-ittB*@bfj5h`-UywR
z0&@yx81qst!=jRH@+(v?ljD~R1xrd)rmH8zL;7CTv9u(3IE=GFV@47@S5$~%WnBUf
zopV!6XJ3M|U48}Cd5KUvxKuc3ZX(<n&~YiOC;^sf4A}DAAOSp#Q{Q@(#lz6Rx388P
z#lziY>t$Sd7vc2qkt6F(FM`y%+_W9{<6x<e>G4hL;^5?QUx(0V7vQJ+qD~3>3oz~2
zye973SP*%+{Z+1KEDY$o@y6$G=Rx!ZHF^7<^U(FZ_@<`#dGMSZY_EOn97q?JW$YPt
z4yNy$;~;(}1_qp)s?Sr3fsmW4Ki^A^hS!=ebjQw&hSsGIbIo_1g^Ew_C0-pp11|$b
zT7N`Gk^PN?uvf#?qHmlA7t^^%r#?6ZE#_y}X}ygA{rC-|N`xbz;P76<vf<&diB++3
zp-LD8#nxBO(+`E5lD>)st53qame41cT|?l^u{}FS1e}1Vi$`|;I(r;0zcjG2%npVT
z&~<5gZ4iuF7E~f~`xuO0K=nH&eiXpSYnHgq5pe1gx5C-|5OmgEap1-WfGa&G@JE9`
zr24KZRg~Qi;Bj>FjOF_vIIpfu<?tR@64>8i<dNNA()e65Uc?7t=Lbjq^6>&?sTn4$
zFP_k`K6{P$RyQbKw)3t-ivuj0ujRe8)dun+ca7R|e=R8T=y|Sni-F7zIR7|H=%C5x
z51c3Pf1iYYWqRntrl=hTNNmCHu{dnXxMV(lIb~Cdp7<4$%jSg2F2=7{Y*v1u5&G*+
zbZ}mZ{}Q6xUEf#Xp~g&|1Ih0|)_ePJ^sTI<Yem~DFC8d`Ut~Vgoqr=l34bqANms6v
zw7H1+G9Tn7?5fP8+nqKjEY;40XP2K|b(wsX7JLum|6BX+f7};T|NWlw-|s2^{hspQ
z?<xQNp7P)CDgXVR^55?%{~y1noC&yXCM0SFrVguQh79q74t2Y)ljQtBY<;PphuRVF
zpI$m5CoUMYxTh>n<(`C2C4I5@x(E;s4^x`p5CsX}qGFC+kA{)em0m_C&w;sPg36MF
zSXh;J>wSn%9N2ZJW(MH*Gouub!b1*;aAxx7z6u6OAm(Hxy;<Qh2%Wez*#27z2*p`O
zO21BpesVfCbq}wA{Q94M?p0U8=56i8j|FMaI3#+9WokMIo4@jT$ierTH8T%(cxFQ2
zN(be3`z%<n#dyN~_1SQ6;cClu({teC^D>t3lw3&iACV+V<-y>Jv)k;x=0UvlTm0vV
zd^l(5w{gP70@yL=>29U-h4A9X!=EpA(zt)WOwuNEVF@eBygG~vKFt&M9vxl;8a0Kx
zJoguYuH}2BoDW4{-r%HQxuF=e_W1X=t}TYCGP+^c*(H$h-hA`n)DjTo%o6`T;2QX>
zuW0r3y#~!rhM$(VUxQ&6rZgV6x(>HJZ<=e?U59O!(`RX^-GF`dc@HAa-+&R#+K*?6
zl)?n-V?#{0m4b?JzsdKQ?-0w+Zgp5x22$rg-kyJ{3`VXB4Qd`;4%-q3vp4Q32b)lF
zv1^~oLI0S>q?T0`kbGiTiCJC+@Y>}TN-0!A<>qH6-iB1ddb7>k<zFfxZX9hYY*7U!
z+7HVqZWVa0EQ?s8coU2}ufofKn;_KQHtW`#n=nMG<=4O!)!>%1VA!ebYIt(G;oDY)
z8kp&mJoUU^4cruKn?Ckc4ai%FlzyGagEbrPHy*a&L0HS7W3Tq}V6dFZv$7l>?BQft
z@!s$N`gRxzkFAAUuXh}8T3ibahu$5v=G4NR8`BE=Wz>R-Voj-01LkKBbebnq2Mco*
zBCgM^gYS|D&JOUb1JQ3cFWo#-2XCvAg*V-*gIftpQ#bvp1I;xv78}o~2g_yG)*ZL1
zhpoQTOWqx>2S2sx+f9n=VXj@##?CkOP}+KXT)NyXSa^0tWAMCNklc~EHQ47CNK7%)
zO^d$;(Lx7<KHRzmc3)!xO@wa4r(5$k@>Fiap+h^hoz~oj)sqKLu{?eouIiXNu<6@y
zd4`3K{_EQ?S~>Nmt=t_rcXh_Xc*8qz@`>7GNzXfQebu6@z?eJm+SR|0TFo8E?J#NO
zyt@M(A=z%0qwj)+)1CG;OYVYi{gmV0JMTi1+}VJfgu4)z=_@kw-d#|0-#h(G-+NGb
zxV=7f(mnWI>9pN!)jg>3QC~Il0CKig*w(~*_}&}v==lA6Fy!Q}wmR|quySBz%WCEO
zP(Syr@!hreVeQ-VgS`&l2S>KfhxsY@AzntV|AdD7aN&o{8zqqk;QdWe*kJkt*jK_?
z=WhN0B5Ey%@eVwI&@Up6Q<EORo-GY7RgWG(P|KCMYlR-dg4G+fwA3Gh#3Vz}Zz~_d
ziTu@ZBLW_R?G>H&e#sAEn!H!okh+H;7tk^DxX2^;p}s_+a^fQ>9ydQ*Zs{W^H=S4d
zb@wCa^YEq3&I^wq^_7LBbmb#(Q9oA8?RW%2=Q6gk#ytjyZ%+(`7e0oYN`b-OoFBuq
z=Q~^_PCf?H>&Jgi&3g<f&GR&-y?qST<0p(bB=ZE=zZOb%X*~hw<xZ^q)=$7hXRnu1
zz!T^nku>%3<tOmWL4SSH?I)14rFQ&@t|vfk8+tByTmz`ciM+kIr~y*@l}xzf)&SmV
zX^!#{4Iq_Z|6m8V0p{wY9(~u+08^>!E4X5f5OX1XOvuPacxBU{?K!Oxl0~)^TIn}}
z#?SdltIZq1q-L<(dWS}^yFR@S?bQeaclz4hKhg+tK{cLKOe1VJ7^kI?(FoOQA!VNB
zjo=@?R<-zXBgmGgEH-)72-{+%^)h}n!r5I3I!ZE6;n%5A%g#-F3bx|3iOI~TppuZj
z>iMFluy$Ky%>MOH;hS8M<`So;Fuis_vB=)1FlY4Q{L;{;pnX0|^J45%(6KG&?#X!y
z4pMoo_SH|pz`ilc`q5K}9guv^>fKZD^<Zyz>e~b%=jZ3{l4*jH+;#aelbT?v@d&@7
zSxs<iz?T<YMoqB6{HB@m+9uHTS-)hrYZLgLSN3b%-vl06;`1kkG(rDglAF&ZG(nMk
zpz`;uCiwXA<i<5Onn1rH)%@ebCNSIfwZx_k{g>E{lck=)&5Zb$VFRB*o5tf;8x@~H
z=-owXo$AkkXX82W{(@)VtaI&)xA`-O*fJt?%%*3sWv2GoNj}e@Wt-garbEagapo}*
z&!9GE`_HPBXOJ;{hH+HkGdLfg&hfnY3>-hp&c62S8I<1fy_)p?8Jwt48WSnh3}eGI
zt)*m}Vcy5U<%1_Q1D!c!soczFuy3=ooH(x;v<?~>R;_J@uHo;-yxGzW_2*hA4BgQT
zRb9W<860ee8R41vveC_O*EXvEnv`ZZP*`x`TwycJPm((J{$?|*Vn@_0eB2CvaW>BJ
zubaW{)jjQNBG19RYxAZV($C@Ec}=m)V^MqgkDsdk93;ZSDl>GS!-j(V9|p^xL+Og;
z*B)9uhfPQF#_w=_4ph$Vfu9aM2eo59VHd-m!{I!QJ60E;!=QI3>&9d~hp!6yA#FFF
z!zcf?v3Yl%Ls0!Z{}V5sL*3L7H#|N)hw-a5+t&7d0S;WBZ;OY$0R6C<pZeop0RAKg
z;fvUX@Bu1%Ct?S}8z`<9VmnZc+Ynpvn+k&EiSPi5?GBWc8<ufJUl;UqMjt2iL9iS#
z&jItcV4gkZ*`Xc5+Kl#1Xtzb14cZW_jcD6|e%4st3T+7Xdh}U`K9;BvYzx$DF&}?l
z!a`WBM*mf)%`p$bS&3;g%tKh2V!0KVMp&6(dO6mCurkK<GPEPCmSTDdrV$(?EQ{Zj
z*of#w=!>vgi1`aJAHkWA`G%N};LbxEf@6R-ee^?c_0Wch*2S_24jc0T^AOy*SPl`b
zgFc98ZS+BK<{%?DTIf3)eG!eC$cV;S$O!ICEQ{dIKt^yikP+PJ$cRRD^g}eNAtM@9
zkr9p4uwDek@KkIU5v_uZ;3{KT1a}JhA{r;74}wBOPeLCAcOv>A8YiF+f<kb{V;+L5
zgn5WYMYJI(MD#ecAsWY`KY~I;k3k!vk%cw{g@_)FHbkQWmPN1-+)<d1pb*jWn2%^2
ziTMZ?f;$595fma?4)YNdB3c&Hh{oaQi(nxdhhZAQLU4y-8o@$vWiX9kA-K|*Mz9dv
zA(%$65Zu9-Mz9c#QkX`t5siZ|jbI}h2V%PjD+Gn$4!|^mh2Zu_KLiWW*bn^>Yy^ei
zN}?Zvg=myOKLi^=A)>`G55Yn-ieVmtji3<RzL<w#AsYLjFTx7JLU2XV7r{nQ2(Acf
z1RFsiqJ_~H!9p|&p+;CCScpanHNpzPLNHrLyMTFwQwawV_9SddSc9-E;V*9m<sT8w
zCmc=KkFX8l1%#CeOA+pTBdF&d;e5i;g#8FR5;i8RL0FbBMY#F3puQ@?sf5D`a|qiI
zHX^J+Se`INxb+noC&Jl;qX`EPb|q{<*nqGyVHv_*ZG!q*3G)c&6OJW(gs>N38^T6}
zH3_o__b2@2rJ(+1!c~N`3C9u+BJ4xhj<6|VHeqGLvV=tmceD!Hc|^F3a5mvs!a;<6
z2s;v9Mc9C_24NOqDZ*VXf_7dLzDKx>a5~{w!Xbn?gk1?+5jG~QO<0+*JmLO?yIzoX
z3Ev}JMmU>rJmGM{0ffB>+Yz=PY(!X_urgtJ!u<(%Jr}g!LAa4HkMK3Z>4akmhZ7DU
z>_ym-umxdb!fe7CgcS+P5*8=i)l9~Na3f(J;cJAm3C9zTBpgJTL)eqB9bpT?Mugdf
zH3&~6EKj&UVTy3)GeQ4a2|pstBYcf;HsK_~(S$<?2N1^jCjUO^O4x?*D#AvD*@QI+
zPbADDEJIkFa90yKu7sNjKO)Q{e2s86;Z(x0gu@935%weOMHuJl{QlbzUPaiLumNFB
z!m5N73Ck0fA}mh0>nZ6!;a0-<Ucqng7U3$wT*BFelL+Jc3Ew}Qa1dcX!ajsO3EL62
zBD{*Q5n%(u+JsdJ<NFi89Ts7Huj1?eghdH=H45w<gj)$W623>citshU`GnI6ClQV%
z98NfhZ~$QrVSG>I_s5m69bqfNri6_M8xYnetU*|rup(i3!ZL*W6BZ@h^P77?`;;d6
z-FR=z@8y5=hm-or&`ryOOBKt#@Nrcrbd}pae=F+cE>7GV-l!`R=Xs-!tox?a<b~Qk
zM0XeJIrd-0?rc*i><FGYXAkPNc8zJG+Z76_h7;=hQGc7TWlRy4w|a4T!a>w~7I{2>
zg#N7AheiaV&RtT`G!^SpwVBv281?A5=-MHur8*9O4MA<4|2pF-Q=fI#^KjJuLz65v
zGVRSwu8Bmgek}B}ChF)nE?Lp2ZJ%v>%f|AlT|!Z@sC|Qketf|8qwm^s;!z(eNl44X
z`cmISStp?$)p^=Y4>c<>iJgkN(mUl%KKdJbhKx!_9qm)OQ3dNaPBH(Ig<3?Tb!RmC
zb8^4%@=)`(?EAG5wdy<Xi!|!l$phVIq2?t%-dTdW#q4PGHq;$j<Cm7Ap842BdoD8`
z@5~e`Q7<>P4>`o_?+BOI)u^T8W%d{|<MYEKyAJi-I`fbq)KU$b_TE7q8@cS94eB6j
z(V_>aWf$K{6WgIs*m!2N)DzT8Ttl|r!+iFKm-SCk?~OS*V<oniI{nhg=cq5;DB;Lr
ze~gdYn!QAQYxqaEB5c1yXQcES)SC<sl(b=fs&#dB2kKAvywe9T<Ds-Cpc8eFMPjWj
zYN_NI>@TS2=Z2?MV|lLJ+mGK-CuTh2Mq+txKvKdl)NfYI?&F5}EE$irB6B>rBQE|@
z7RUZZ*Xj2YL!CTLGhGzx3%bk7kwpC=owq8TsegKZ+kvQW$lQ9uLruLG8#Dy9zTA!(
z+PHtbQNyx^qE37e*Do9ErwTMJ<xu}PHm4~Z{ke5+LZeV0d25^KiJG;(<U9-YC6ksP
zRam}b-82J5)Ok<jex+l7rK+-;CZN{aKmV;eYSpN9yQiQwIGnL(6jT2Vr4iFm+indV
zFoW5jS%cElQJd^(4$wrc`b2)wOw@ymKJT1~ns>ptVK(Yru|CgNGyU0`<gSByth(M<
z4`zJT)kSqtCt6Kz_QC$R7Ct*+fLg9?jRC*CFU4aPpq4!v(=`^$bMk7F7o(ov_g4K+
z^p|QHtho$zep~s1*_hAP+s`#YeZ;}`Kr`kCrKrqbiF(|S&sQa}KONutSFJ`JnaT=g
zj=$@B#buVLhiGX;8=$|H^>&^WY8{W}^Y780Bh}Z~2K95T&sU|H{$H=VxfylFiG94i
znD1)Pu+RaucLZzXIxNpxqH@g{^(~fRqy^@)--o1aMZNMR@5lkvs{X?xeNgwiKScKw
z>W<XnUHedP8h)r>AFQAC{`{&#s1xURH3VV*I5B0)!Kk;So|reB8LxJoZ(*pbrm8&I
zj_swskSaQZTDD?)XANr3mZf_xpx*g<iOm<RpEp}%P7>-sFKg+gn6LVF&fBY~pJ=v7
zmoxqOA$mFob>ic-E}JmlID3mO7j@>L0-siFPim?6(;KKamB$=@hxt+!+B<Keewb|?
z;)D6Tp+y64p-%cWet#C$$ND-r@&W26KVM(c!~KaKF=yOU)JJ~!#WB~T6ty6>1$FtU
z6;n1~zUm-@(Qi?=v8r0UP&Wo@g><4;YK@AtK>wg~Gey3mZaOM`*b>{L%=8_Fv^}`f
zEDWd9*dFJoLyZ_}-D^I}hM_hdk*hoq^|*dZUMMpA7dP8a2KAoDEn2fsbBjA~k3juX
za_(~G{>*#!am*OhgIIovGT6S9^?bVts6SaW-MoVBQ`<hotDsi#f5x(A`llz_JRS8;
zU#ESqvA*c4eR5i;^B!bLf5-Y<f9zbyMlGsX>7vcFf8mpdA?nsgC-NpT`{Vs1+z7Rh
z@y=Lt%;(|1Qkb9~y{|aX74xHi-L6}O`rUGWkxZ<wF)FuZ9qOwYYxhsZ_IY~CKii=0
zQ*=AY5%bv-&I>u99x5#q{{^+GV@_W;)K6;KKQQCR8xhraJL;tNx>@&_{wSFX?Lw`*
zy=G`8YWAj%PkT`-?I_6O-*3;kwFIDcU$yW<KIU`%pVb{j?KgGbCg%F%U0RwGg4(2_
zxP*D0u}|ckI)!={=eczv`nx8mZ;wX3@|{r^3)^>{m%lU)^>y`lnH)wZSdB?SJy6(v
zH&Y)aGO_&%YH_Y|SQ7SM%3(xy7V1vj!h;;lkA49@1*m_{YMdN``9Yha=aitnztQG0
zb3ZpO)BjY4TF<-x1zFU*+iFSGs6{i|j;dmR8t1uN-a<XkFMjD`Y~L!szvKhd5~~x7
zTCl$83h}EAs7(jf<%lx<Z+9|#jym#I#8Kw@;e_dTwxPCDvGd%;=uyE(J5aa0SXTT7
z>ocyfRQ!ax&j0oNG;E)9J2m4w>eD4xt9?+b+6L<h>3DEswmf>M#ngYaZ)IQ9XLJS@
zGxsM~v*FA7qqeU3&`%8e!%eQJ9*kOJg0a3l)838=i-x0iZ?hY61$EF-jUsu}ySnCN
zo1%Ye(wFIDQNR3nx_BjO-hmzGCZL{vVpNw2Gd?BU{wk=qTV39E1oIo;*Sf2t)<2dT
zDvQq_)zj&>W}&{P-udGJ_J^b9qOOBlnk}okg4rK=@gsVu2i1F)YGXbxZU58xs3jw}
zONub<v)`&OLG7zDIYk`(sh{&XCa8CL&pCMw`)e#4QEraf+g4&uI%?I+Edwo4i!PA7
z%v_&r-fZIysM%THuhwDtpgku8H=~Y=S^Z=Kwr7<^l{%tMJav2dRn)1g_jI|TKG0cP
zLt+1|^hZtIj@oyaVO=Nohthkn)(3Uhi`Jz((4Rf5aQ`0EZw^V;F!w8#XZ0n2)DKQg
z@ZH7ikMQ8?!>EJuI;;C&eQe9auY*vpEwo?p8T-c@tS=Ud`p}W7);Y}np3_k{jrvt`
zj_f?_FUy~!7L8gX$7O>Qv%lj9>s~<Z^lh9wbH9sz+G&)CI^(?0IwSP&kW@2ELG7}q
zePuZMyS}VgosPQT*HWqu>+i@eU6X@4@|D^yL(HcVl~)y_K49Jyo5-}+^mBO$YFg}F
zD>EMp+Nr;w4E4{AlAD?P2XFr`t(&N;Zp=Dof&Qs|G$+@gzF)M$;yJVbAKwkVi~5?@
zn7;8?f2zLv&xfdo-k750iTPG{el#_r-qmkydN$L3!0KzyQRj5NpK%8@Yto`~ZKxGu
zLQ7UL^>J?bw4*kfR~0{;na?czv7!_8uumR|%>9q0Sw7(_YMan=HR{-(pib>CKTyZH
zTa4d@<)suXuM5xh;96;OTehNRFPeHx47GZliRCBsckPp5)*toK#fB{{xPQiVA7uxl
z-hQuQPa*nqCV#v)6t&j(45i2D&+*MVIRbUNtjzjmY(IL2?y}LS*BT#me}&rka%dk#
z)X6?vyI7`wbMvz&qLyGEGIPNCcxst;DyS7ga;EAs_1_E_s*ZY{AMEF!e@2@0Ow`&F
z{M-_;KUPg;wsTN_^V%(}j`gYL%#~oH{-_qSOCHCA^C2q10Cj%z<osy#SH09`xDd6a
z%ba%&On=@_e7Xd+a+}lGHJBe%XW?andT?;~X=BW9Tym(tIcgow%h+MKf2!*;qSm6W
zT4i2jj5_+`(<xS{S+_>yGWXM<pVC=2s6SO-%4N<s?%HKwkNOP+(9HACxHasW6Y7S%
z$KlNLoVWd*p*w1u?R|@w`$6=b^*6Smj`|TlFB|h+%U|g2MBVqJijWMBN8^A)`MXiy
z96QO{7Pax3CDZ*-Q;YOI2B3e3rN+eo)EhUA7K%dM$kme#ME&_&<)UEhkCmd2e=zF1
zr)Ag0GyNai{O%-bbsKk|Hq=tfeAk>p?R+%P<q(!<&0NYogSx9cf2%g;^DNEBokx93
z`hnMO)W-9o_FY8nm2k71dA_l2$34A-`q!WZfx_6o=xJ}}q@wou<vC~obA3zwJduw2
z`;0?VJ+OXN$JH;hQNOx$x&K)7w>l@RU4XiMUZy59U*`1takvO|>z(yJEYuxe7vH~*
z+VJa_UCjNtBj^3N3e*pq{5CN41qF9HRHOb_!i|)|_E<%xSL#q3JH^QCX7cwA>%4=y
zqhfMhB-39>9gT;mlP6Y~>0`c?f2CUk>Ur|<rOnu0>gel9&rlZ|WR6$BeC`+J=Pjt~
z3yz&--k*3=`;L5#nk65h&fIU=_g5_KKz*-MiFcFfpM>1*PSnl@H>CFA{;_VZO8$a+
zxU)_Q^FER~Y1sWP)M20czHG$&4wk8~5O{EpdtH4w0{c&;44u>mb=0vkn<S=x6_!gR
zP~-pOvF8-}b8M!$3_xw<A3OUP*2l3AJUSS)(v0!TyRd&&+#Q#Oq7FLqPKbG5Xk7H|
zx*Y0D6H4~_Vtvui2R<2vdYtv0{mlKt)h_SD7}O6$+<7yxeB%XSvGJ%QZtRd0!u(W+
zmf@38583#%c`GwMdmYD5MXfqcFT)h;OT8STu8w*}R8TB4A8Ne3L3<|Z@pY<4mC-+1
z=f1uc>R&ONlRlxptJL=eb5XBx3!7?z{_J}di}g@bPZ!;0j_-f;(coV=W%+seAG)@f
zmPpwfa;9J{{i86%L89D-9{*;H`>hlQI__w4Q^Z0yx*(=*<H;OP+E_%*;mHIqdQfdw
z?6#1d^d9r~x$A%V(kr&ABreg|Lz~|hKRmQ`FYPzeV7d5dKl-uMi>mQU{OQye*Q(rp
z9-td`A5>_&e2@;Bb>(Q#y2JDuc2KMBfI#|f(~3`9@{ZEUYxlB^HG*g_M}zo%lEJi_
zWc^U%#$dW$Lilw?#&J4$?(o2jLnr9Q!<B26tq-B$-QvuB(@)avAzIW5u~52CRZ4il
zgHZa*=s67~$ze2ad9(T^PB{H?jq>|glL*?vVc<@V;wf6{1vTaC$5Zt7HJ{cEDm_h0
z`mFOP35%q+4xeyss9h9&tWQBwU(GYLocw@*P_eVLk^KJD>vzu5r<X~xD@>wkT*)S0
zC^wq!bMBe8#F!X*J12Sa(*rT|+-T3JgKuMKBegEBu-Q2}@Mi_rDDNEo;L((_&125f
zO|nykO%I%>m6|U^41RN-e$7?Ri8hI)m%SNtSSUM|UUV~Yw#KLn^n(>?Z#DN`pfw!c
z)(>jAK#N)28IrR&j&7Kqd`lxWj*ghTOK+ddMfyWux&5(T7iqn{^4G&3U8Hp`y`F5v
zj;A~4XFvINKAvu#=_PJ2mOyLQwAUnVNuc%E$rjw333OY##GM4yL^|x=<c*t8B$Dw+
zq+^#aG+n>y67BaRu+OR7OZ3VbCEEn~B>JnwjEF$rBswrIxzw;RiB3;iHte=;GTr}B
zLZasRWcs6>Y@(a!Wje^eY&OUCGA$mE;cIi_GR>+<j8d48LierK&%1me1;_jKcbV1{
zdYB;IlwOb!Hb>nwm2OdZ*friSl@6V9Vz^j(D!p#lo~XKKsr1xE%c2iTU!lc!1*<9R
zU!kAexwawK{R%xy)_9)Axhr%by{|2z_6qHxc534*>MH%_K~~X3)vNTP)vtz{tiMWk
zMX9)LK6;gQlitv5S8$bfDO$-{`T8m?>vqjdbz~Zy&Re?m)50`bA<VBm-Ybp%7}s!X
z{>3!fTkZOc`rB!=(*6Bo7mKFTzv?Y7rKqRVF$1<XQr7A8_XQ2LbC0FdHM)_<><iNA
z=9^)Y_Pk1`fBZ;D*)Nwt@1Gl{wtapE{c*b#ZMHRo7M_-dhd+b%jg^@5fR{o4=sdK5
z^D~2<rFr_Sv~nh`5`B1C$m&d5GW^tL;RBg;dDDkamg$-FshrgQ7oTR*Vr_S`9uLf-
zpMS6v6V}e6e~ed>l(EmEcX5AIONVCBGsWX<gi5mLV@?(KAGK%Ei(>oe#K~vV{finS
zEf;3fm(1$LM7Cwqx`FyfLeFK>0~Yve%GPAl(z6;y1bok?gFbU~UrflMr%esaRX5F{
zCC<r&IB|05ZRW!tg(l_Dk%@lMm+$4!_w47ir;Fy2^Cy>nt#f%pphYgNF!av3^#Qr`
zHmT9Etn^%3tZ<kouOXLK&emeN^vk0U6@JO+nwdvGuD-12y&;bd*SS>R9GFKht5)6y
zIeGNw$_=v)Hs{eFSx$<@gYxNL&K8T>wDRf7@#>jEoAT-KvyGnO!TI!_sf$ni%*&@Q
z=ol(AzsRSjYz!NlGq`~6=k+mZmv#Z2b6LDXZF2z~nXtwGc5nf`HaPCBU48-GXUgnB
zuU{0<VsC>w*9|VDf65KKR5YiMwyY8cnN5Xs>(I3Pl|hAcKPfZSgSmyY=zFQSOU;G!
zD<z@Hg#&5Y-%`Ddt4Y&+FP=Y=wt=RD_ZaRAJwns*?|x?4XVSFO$@4Q+8fn_%k?;Nv
zQ7-MDZWCQB$ECBcJ$QFyDo%qxT-m)$pG!BKPhTdvic4pf#BDBc<kAVec{lC$aOu9y
z3;g?sa_O2ptMK?lE-im;mV^$?rM+10Ps;1L^!SYAQOjDn^lH_;RaISF+FW{1hu+{K
z`e@#aV^@@l=m-a;%d%QUw5n;1iPzF1S}H1OFK<H;eZxsrf6VqG+WS*!#FoQFbePwJ
z!%1h0=$*^T6<X4Y=pSF&%}10K(O*WzY8yT(q6<#VsN2#}L~lRvc2t09F};T^t#n4V
zm`-+XdYz<POnVPHxg(ujOl$92SD$WLOwZl!*p+NoOczaR`F7T)m=>A&uKrL^F+Dl=
z;t}WAVtU-_v6B~PV>vyKE3B$wT2|}gg!YDFS}6K@aOQ_%`tx>P=Qgntay^#N&TqnV
znx>Y}P7-XTqk1KDm~psBr&>=OW#;q`_h`wUc*;TixVd7eBypAg(wZ`f`91NK8lAE#
zWhZ;$EI&CdwH0#diMJG+E+1yLpeOD!ZMRI+wK2u;hQwcXvWJ^2{a*At4pV6E^5FNk
zir@x`$1F3LGxN&jA~;FnGSyZ`$R7&miO*DP@n-GXPy}yCoM!ZA4TVG6MbMYTYvyfs
zc%M3~CvJ1axV}5yb#Q;jZ=SNAaeQ$l7bcK6&V9`;vh)QmIFfkI1TFWr#T+i^lDN)v
zk-0D4t?7yHoHI+VEp<juoTrF$;H>~DE{O2sooO&xTP^<K4*ouu#C^_p+H$2&APo~p
z{O5>-W7Z4xX*fmVKpm{D?iGA3gf0>f+PY--?G34gu!F>f8qFRkr@6ThK9Km(+_a>P
zIto2;qN~fdZF9ff6E8ZxKt%fPk)F8G=cP8^w-^*a0f`?~c{uL9N>@I7AaSHlc6zy^
z)AM04i6?EFqB)%Hm=EJfTxs0*cU4Cf^P!T&mr9-Do$dEH4_=Ts(*s8?nr5ENgJ&e(
z^w`I|)T2v#;!cy@OT0tGdg4!C{Ak)*%FP8o5{Ft=m+UZMM=l&7@u=@sDvnK`-V>KP
zq;Hy))0-TaN8(c#TC262T<nQcZGGB!(#ARmI3!+md%MG^b0c%0fyAu}-EUsn?@mwr
zYH;nf4`+k2A)3Uo-fM5Wy?${v3?=cb?^I9Ii~44RD2Z!T_uaMAs;DQvRXj8DR<utR
zEFy8PWm&eN{WP<niyvQ|1+MOKN1{Ju!a5T7YWnHOzV#_R@vmVA<K{1L$b=;%4t5Xy
z<ieT>nedLp!wTXyGa!P*#air{vg!NT4A@EHV_zk|*m%$a*SR2Zvi+$3)7f%8@v_vS
z<>yA<Nr&|$ZnnwgI%mR(bjTv{v;M&~QRc?!@RG#QHqD$`o-&{(p7x#Zr@CpCX&_1B
zYJVA@ID9uC4fc`v+D$>%O5zNA;%uW$&KO0Brh(wTaTT(L2Yk*g?uonY64eg<#p#K^
zl^lEH+ZO1F!xatR_qprG6>uT(xMCm1tk1~riOc2Lo)Hb%*%P0;XVAR7aIGuwiNxt1
z)K6Vm@--E{k$ByU^`(i@IX!W^ool&=4|=777m42$3La6dsM!<8duQ~#z>4;i-|@U1
zR!>4sx}?Bc64yKXYO!Tv`{m#9y)P0BPl&tr#QAEP8$V6yNd6t~`}w0;=UKO&xZevG
zEWGc%$GBe-|GQH0^QhIHN${A&0gnwd2paS0((icSNh8{Q)x3J*g5}yKM+AIJglG~U
ztXQ6Ybo{PFs3UR04nKH<`ca8+m&6N~3|n+_#=ZnFCUL`+MJ`@(eG|Zw#1F4HGql9w
zP){6jm+bNNs|NPO6H6>8pdyZ6gh&!syuPx1wZib8_~M8Zq0z0Ud*Y1QrVB+sv3lZ-
zKbf8?oFCT{cbvV|K;-e13!vH^e|&sMK*p6=5G8TQua7Pisht%I14%scXyc1hrWN+Y
zC0|al&aN>y4?jqJa=Mq2_0`IAzvGmPY=%C$W6~3^{AFZ$i}r(<-*L;Gvy5gnTgSja
z62EM)aFl=5%V;=B;+Ri2C?Eak))UXnnv^45*m?GMTyv{h*XF@}&q5`MZ{Bb)_E_`q
zo;c^#CQ`z)CilcU>+<7{d*Ys}h2F-S8~4ON+jXtxDcYQZRuTujqRV@ti&sxP^qCnA
z$}<DQf5$~92EShIeJ%_(llbW6A8#pZW`{yBiIWaL95K$l`XuC%c<EXh@q+QsL*PA$
zo7U9I@iOZ=@jHIH_4&ZNKcsu&s7IbvUp-p6C!U(yCcP)eAQ(oHxa#Stn`$d9d*Z7t
z4fIc6dV3TmkT~lo^RFM0#|DC6zmLGGk|&u_=7+(V#9ep1S=a6zc<^`p^-!mEiMrPg
z{EoxE{%h8!58wCyj>i@b%4s^L;rBZ(d#d)BJu=RFf5&Hk+B~9}6VHLABu?8YVJpO!
z?gCR1ukE|{*YOeT9dLofZRd{(?O2(+4OB?{_WTdrfVDF{e#dbOw;UR^#LfjuNIZAW
zGJQA4&33=zx>Xks@EyFx8uCeecW$`RR<}k|TysJY=RG8}N%mtk{zg`?asI_8f&a*K
z_SNU1BXGUB-uU6Bn2qtc{#<W-`db};-MZe`YvD=$I(EHr_qukyaerOGx_Q0vu!7O!
zY%y-UH}2Q^eJK-P-Ww}uxNKzN(0k*VPniGTppx#5yW`q><9~M$1ab6($p6Ff&;0Mo
z3-XQ0dC(jGyIQ)}J?xEpFE8l-?=>fP|5f*1@^?-bQwCLU{M)hD1g;0b&+CnQE!dsW
zLB_8)?)LjvELd-eqI%<hRpw8d&$ayBzB&}u8~^FsOFG)0&CltLdnxwY{N<RSd~f{Q
zv6n;#Dc>9SQj9TouMg21|4q?9vO0DPL<e&o{V%rP$DRIP6#laa=TGq;r@PPFzZO`|
zKd<{S>wz3?oV+V(^bW!LUri72e8m7tTxTS?RVeUBwX?wP!PqJO`X%%l{mHEZcj9@4
zn<!&%#C2dIp=HgAHOHx4e1A^WeYCgo*HgI~tSq7B<|wdRGIksOIxQ<ZJX($Bt{2$f
z-b1?;fBhHV9mh@%>$8$?r?MEkVBMHa^PF{Rl5t%+W?R76?QlJzWSBQsyDpz?E2u|`
zv4`{5u@QQ9g!fXBC9ucbMSD4aeVidWkhCmzg`oZ|j6IvbuFjkHE85p|3Hn2Qzk~LC
z{(3!fv(MZ)IdPGoo)X61#$V@WeCzcACHvM1>N&#Lnf0i$V9ii^^Q*#jI{bc)V(fx-
zhidP3J--gi_;$|o+h`Z8SM-51JTGsIxxoK2V;8J*w0&y$t_xqx1peC?yI_5!87CB*
zEeuQr{=nEb^Ve09{@StNgRofvzg^xfv@`3K(NHp^!Rj$3=np3x?Hs{6PxW118DS3d
z1@%}n{^|Vnp&}H<oc8!;#IJ`l3GL)NhQ}ISW^gvHBgt&<>(PHLe?6)l9fwtDF;#(o
zE@S`5U&qR-+TB}z|9nAz_Mx3ESpRCt(sAt*e(3Yt<t#=!N3d>|*orra&OYh_e;KrM
z1?z3itTqn2?Xy@=|D!srzmUI9*O8;u%YLp}Ch*5~W+}E{eXj@Z*X<v<g23Mi?OegS
zU_)A6!m~qW3;bs?^<?wc6AP?YKcFeJ@NexLT$hgG3f3n}w)xiJFlC+&e;i8D&K9g|
zX0$qV#w#^}opTKBloo$Iv}oa_E%&lU3+i9R)FW6&O|VWc2<qv@&S9ZHN3bs2?6Oc3
z8xGmumprr!)^i(456sIEn#`}Ca|P{e!8&lxZa&~l3F`07PT{(D6j!jWT((^Hy)Bw!
z1@-8moeJZxM;Ewju>QCH_!7lz{TP42I(C_ZevVTZq51dri#1q}U|qcG6}#qi#i;4<
z>(N9zN3fn=UH!oKlip7g)YF^2yc#H;V12$g<$O)s6m>y8z1i2GKUc8cU*xVc&$p;3
z3hIA#6Ju}$>jb)77?ikBl=QzhyAS%i3f3JAd0XHzDnLz8PjB`C=+70bV_0IUnvpXQ
z*9B&_-t1?pfFkQ6etns^<U%B~&L?iY*{7jDN3hN!Ek3C5Nt>3S{@(1|O7s`ZA11Gu
zlRcf;-@j-!zd@cJpK#Gm0ej(bW46@4tYh6Fu;X(@jLe_A=htdlf_0_66$R@}Tl`em
z$*eDJ_x*_dKztAIO1$#)_`w<Mb8ojU9g{YX%dfs?-EbmF{X|j!_V>_#_3y5giI0k2
zwUQMC4TncMx-B~>IBw#Moipt8j<Zn2DxI0IZnwZ5#Kb{qu2~&$5njG#X(;P?3hXS#
zF3weJy9{p?;j4j{jliDD#5u`+xjQ`#8iLm=Wn2*4*C{q*Z<DO2vfxcrLZE`YoesZ8
z_n0`Qin&fFb0KsUXOc^mgTU^}*j3+(%_@XdH>)Fg3MK-(6l1@6)3=%n`I2m<<Q(#x
zNy7Lgj#dBqh++u&KDcD}YF$Bpj2U}*)D**O(0XFdotJM`3+m});*sKFRKHw@;6dE`
zwpnWg{^4lnEFUJ3S_+|Oi{9VOA<tVj<Nx{5nl<I%@+*4P#P_(4Gqb&B;*AEcJou>s
zCVccA+-H&rsR!+xD6ubLRWM;(OGW)bOM!g><L|KJz~pM^Tm00rQGBJKo-a&1(S}0V
z;u?tlB<~WNry;N>p`E+)rRW77Jn^nPlF>q*8&-^ea;1esEzq7Sq7mxk`5=pSPW$&g
zxIXv;&Pl5=GFpOmc^EgudYa$#vJQ$z1rF)2swk-c2-?}xIRA&eKaZxedjtRRLqtea
zic&O^B4ny?DH+m00|`ZjNGVbgiBgixL#Py?B=bDqhJ?thOc{zO$$idIDa!9UkLr0p
zpZB|-&-(uU_^$6-S?jjF_BHIiuf6XxIs4iPQBANuO4=+;L3K)h3uB*=(CD?p&G0F%
z+;o2O_vZ%|tT)NL;WNJlM0RpI>Itb$=@;X^Ad~&wg)J@6X%WLN#>p{N@5ZRVrCjOt
z3<mRBs$@jBOtrfO>w7lL(wBP<HRt6bVxOo_)w3}4YYyp;JO`mJCE3j*+o$R)ai5Q{
zYI6GRR#?w_Rx)K!WvbpE>s2CU=5A?&wUjs?p&e7thm^fo-&4%B{8Jl5Tsf5*V7hHe
zUl8jfmnLyVw!_23wL(VAzqi|m`*hsM!fdS$u=h~*Uau}UrJsWJ!XmeyzU_d0(u#qV
zc`}86&HFj5FBa%=@a_cFq129zlUt_hHL+erIH+jt3y4<~Jov#*eX4#gL%)|LzWD`w
zT|kQOYW@B=-G}>bRNC*E9`Ay!B2BNxAABEg3f7yXxcbfOhT~l4I5JL%Px*0U=sP9r
zr*}h;c}cV}`zEEo`m-17HPdUPm*ReZ2i7mw%D(F_$NC->Bkq$uFoOxcu010-<!21{
z%k(V!O3Uv7bpfph#F*?<eI?er6<6<>*$bbnwKI(-7Ek$)#QHGW$Fg0$ur(>@Zs-e%
zDg9GeAIF)O710YdN#ccjwtruTnpi(*d))YKF9=$=4Qb3*obn@#^~FW4DY&2K&}$p>
zZz>z7{EXo~7nQ2Tw;f)>tg2vvaKmL&_4QaUeChKl;w4;o^zy8ci1Ji@9M<z_%j{#r
zefUBf_N=Y^-XAxt_m4;v)p-TF)3X+k4d4A6VSRo73zb0B-x(mL*}8Jdj||qE=wIKB
z`>~=b42y$AzSr|$y|BiZpHLt4rXAjO>C^Xle~0^1dQ|ER&HCWMjgNdG*S<gRRbu@Z
z)j8*WALcd4+PPu&_xm>v>rKj~$8dc$u1fAK{P8;d64qDVTxlcL4>s>+OXQD#f1WqT
zdNP<P-l`v1rX_iITveRvrwZ0<${DF7_hVjoo&>Wm;!1zbyD--CFOR?Yz8{Lz+qo2&
zmrm7FuwLQIx6Kl-LDI4!Xdhid>HlPvza0E{epC7W{B{ZNd&bW%p5G`v#2h_c{AmGG
zW`<rpap72cXn1%P_@#^P*3~U1B3LghFWy=THtu&>GbqIbLkoZ0{`&p%*Ds!*e#(FI
zhr82@)yq7JDXB2B_>EwZXsc7_T4d{u_rKPS2o^=Ic4=FOJW18GR6*`>bZ?eNHV9l5
zEQaiu<M(tUa&^)91_i2M5r0oKCX4qdzMYoeK|{Ii%aUAGWM|bRu^5zFB@ZQNASY`I
z^KC>qxo+9*ZO8}RM0$mhB@L{7w2?>Gus-7;1&iEflsWA|4(*pPe}r<Am1__0L!NiM
z$$^IcA_G&j4Uu2B4$i25kNp?lDsPNzn(jTV59K<IUj)sN_g&t2B?bM38CFm%kvY#T
zO*ce&&z+Q)*2u#TyhnB+>)Yp)9%pdln$BKq&+UFs<Vj?0wet53Xs^k++T{##ZN6>G
z2)0LBhwpPjzMmeD6wYYhUtID$a>KZ!=qA+X-~49!MPwci{jfolYpT_DTt<EyUm$b?
zx!ABP=_>NG1vLY$$P~4OZa&EOB3OO6us{4o9@+uO78f==evNXs3riP;AXC?h?=M6D
z`Wob581lmEN5`0v70Rh;w~%dLw`v|hdy^zl=Sbvpj%Go!I3EA>>ziVb*9@jD=tfp>
zSDGG&d?}t;v5yhos>M|gk+Wr!K5RjMIcpWYl93lKreypTzXPFL(~;}OZ3gntKhKyH
zTQ;)khTfALXkQsMvn&t!=xP_rC6ud-uXZUy4!gZ<+X>{zyS}oe$XD8*Scjtj`gQW}
z%8@7Mc}X2ccGDDzs$%G0nS1{W`V)3E+4~gv_)UqF4K$38ejjTCa+kKt2&4bP&Ka4_
z$g8#c-npWG+mnrEt;pwQy7>Dcr_=yXCvw;twr__pepd6o<#i*kU3~S$QfyDSo!k5s
zvc78aq8gNoM%r@@AiG6tE6zuG<$Lkex5%TVI!mn4pQIM(zDM3B#2H2)yU9HGL`5z&
zn`eIw`%^4#6ZV0je}2bd#{81$-twQ3Ddx#{hf!Zxbw<ks@^h;Q2t?M@?X#sU_bA@b
z({%0>wr650#L0qeQ>Z&Af#Y@T$&Y43<}5a`Z$WvOYW@aJ<kKxi7YfjS{ny3y+{n9T
zgpO}SxsL0g*=*!hm(QF!j{f!K1U~X1R~O}&zr+4X`lWdYAjfkq@o`6e&CyK0MaaB{
z10HXYMQfKw3nR0(^7_~^#^+91yBv9bOu6R+Y>(%xR;~zgY=N`&JoH!3%d&YjvV!$s
zTNT<5CP`FDAoK23Q=ftIu;l8U(#Y!_{7v2>o7i<W$|7&Bm6^ea$C$RM?s{aGW2f>0
z81aZb_)HP`yjY#%J8aLYs!>-3S)k<7ZW*-CnO)qZ%HZ9y4%!%>!4?r64dl7KS4cx_
zzutngS_}E=l4usjdJmg(Y|BpM6DnfcJ}~ShwiWC`)*jyLavJqXmUwAh<d*I`Gb)jF
zUS7Sgk1S<<);<+kf%n}4BjlNTWv(p3{+YBlcpD=RDW0@u^tbhr;#X7T`->I_+(2g6
z6F+tsSzF@MZN_>n4v1|#f^2psSV;%l=XbiNW`mp-nfiVL{l{rbrPv}DXrF({#_+#O
zL*Nv$)Uv=fC6tF1ym50tUe(L9pq63(RA9gf`Qsyd*BHip6t-?Vk4$OMODIMbEf-0?
zfb1m_WZ{KuE6C1!8M&gXZP7C9kLQ?^ohNdf%WzHx`nU4AP=5`XS;yU{5Ze!%xk$nf
zd6carVL$2%$M5tCMCMA7J9CxcFK~W;2=dA@Vb{~h{-ch{;m9$2<C~JPe>`99uirur
zz19?V66IshW(?m!9@_51*NNQoaO37^WQpo4t3=U1C5GerJ>+dQixmdYp7PpZ@By-0
zZN85*vS{d~^@+%KHFUKuWc?1Qt0~C2>w<IQ82T-4&(o3Drxx2=GW26lF3(05Dv_#^
z!tpsCWw*^k9ylF1>WM6=u9{bfY!mmk#|6i$uzUHm66Di))WBx6XMdQW^$7X!7Cz+_
zD6hAE;a`EQYx91_INIySXSX~-{-#;)L!w;xf}%hzvg?r<>`!of3amDU4ain)rg}c;
z&vBd9t!8A$VZF>yl<QcwbUa5sU2VNB740cUXD#SJrY)Q9u^9FBEkEmZAuFBW+mVd=
z<k8^3UgTj)#%#vp6VH|2nm%Ohvs{nd(7v*~mvs=?!qqSGGIHy>>q<k&jw*o@YUnSe
zW77UTvKW2eDC7As^0CkZDzbr>^IR1iPuRrA&QavF?#PJ|lv`c$m^Fr6(67#<fpUMd
zI+bx`rhbox9q7;GcBAb#<ch<tD~cHXlMlGVw8Ep<XuY7*II^%b*Hac`@8RyQ892Ww
zK3hJsAqQ_&Z@-BC__a1J=R~fv*E-^f`jHmY9o)!LtbU8LQ11A`@(eGsX;rud5B4W4
z@lM2CWT9lw_f%}ZvOc_QKJv$%;p(4IKSyQX-~!}6hx({Nl=pmS<y?#$Xfmxm3hm<t
zgd~<AKRw}ie+>0Cxx}@XBj0D!njeMwt@=zSM37e)#;fum>y$+Jh#^PJ6Wq;s{tQ!?
z_D~#I$RjRa7{}w7B3&Vg{PHc&t6iw?DIorG9dc6Z@WfJ-+nUkG<&fhFV|H|)Jo22!
z+zrTfOL$8d^XayGV6_r5dqze#<Mo0`!@SKZ$VW-J72;?g*2lL`71`<~E#DgLHP7^0
zt0RB7su2~0{f|81;j$H3(L`77Gh_TYpMAF@PsCTL)G)@YpmIkWd0)Uz<G1MFs>L8_
zH*)A!@edEsALW!*fiCi-!ae^OWUH}RRr<&$T+Y_HBKxZ)G#esU&EYN2K!1)(!rcdv
z55#8l>oV+1jtw3{?)<#MsR`Q`O$j8;k=q0&ZZp<H>zlw&mdKg=IGPxbKkVC&f3-&D
z%$?7_6YX=-S1=z(z8=2xfh)>;CURNrkk#7Ewq~NgFy=Mvr;tO=Dy}tV$ZwyU;efnm
zgQPEG{q)2q%y2^1xXM;`68l&Dt$^JHdFdCi6<3jS?2@LtAul_!*^Lo@_Vx?Y+>uXC
zTd<yr{wOmQCNCq;@u?7YKz;u1hR>eJ?k>!q8S<QEI`nJERbAl;C$K%o#PlIw<YKiU
zWqH)6?ELyN0Qo|`+-V0!Jf4ZS1tTA3i%}d!eSJRl+EC=9XCBw3p`2`2FTH_$chdYe
z<MFz3R5CLH`JIc}7ag2$eo5B*k;pq^(ylQckNEdL3XMk2-fQFEf-Jf5#Fcx<Zu8Rz
z{21epoPOp3GH=Ah@Er7Cx#yZ$0<yqKp4Ab^DT3d$laWmhO*X$kd;c=yjcLds=HX(I
zD7TuGx*`*~|NN`_hf(hKn8uxh9BaihpA+SxNh?0(A-e}UxEW!4q?cA#A@bFn$?<%K
zKVj2H#mLK<jvdZn^he6(K^d}#)96GTL*MO~&tv4k6z^Vj^heg3*j6ErbIW?Ep}l^m
z*6teQ*|mv_80#~|YW2E0<cckwL=@WBOHZ5Ah^%~Hy#6}c$Bi{on~|9u6b027_n*Vf
zy5|ggg)#P-=r8i<frNJCgGN^~${GIr1w3CM_m!`hvlHc>QT3)h4E-XO8H><fLEl~R
z74nk0o9>MF3#5%S-)rQ?tD3=#@oC=ddN+t%`~I@8J<5ARJ<Em|_9Ks18=-yW0;%x#
z$cdXcvZYa9w7u1aiu~%H+~zQ3$7^nzMv*^<Z5?2|9<Y5SI`<QD)S(0Om2o^{A&vc?
zk=y({J~N?QU+;X@1af1id&d!MZ|vC`k4fZR$#Pj2FdlJLU3-~VVmxlPRG6Y%zdLv-
zEAl*ta<y!<x2n`0VMAW_mLjTz{`F;e@;Q(j6R5K^ktvPOF3&_BnSW#ZX6(Pec8oR;
za?7kYU)M0~4bJk<LC$KKxnBt7ns@Yi_>jFCZ_O&l_9dSv-seYFW8K}+f$dv)tg%^$
z%xkh<@~`&;=T}NEM!wF?G(Q~ur5LULD2#l0zpRu!+7DK3%w2|D7PaKf0>=Cv*LPlt
z%tg$s>&O0S(l02kLe?4bTCou2p5JmNRwG+&cfEZS+vAb{mM?)^wdAIj6>`qz-A+=-
z*KTwbjA47lk2B?EkQGdu%<7TjELV-nAs=KDSnvv2rz$adJ+jOB?vYkx(pS}55jjtM
zK;i;2zv0j_Kt8+l#*Hn=Id!p}n~*Q-)DB<A_Sk*xgSQ~3O)Ctw#Qx>T>2A|NE}6{E
z4Z!{vAKAvFh3qG?#Bv+5<72(7?Z{d~D^>-gzqla>Yi;E95(O1^QLgWhyl6Ladac3!
z-576vwr_QNkxS3_-SEZs;^fUQ>_h${st~|<f1w}yQpy1NaQd^;GK}>%bhg(Bd37KM
z$#{K1#)|nHBloC&xhaCIaQuUkDYAt-XRjOf*S4$utvT|R%+LI>=&#<d<GLmCo3?N4
zL8w2tU~H2$a+Sc*q-aKb=S#gihFsb_&4gt1XVI0A6UbcSu4;_?-M{RM(n;iJ2B%gs
z)<@hO@BUNB2b?DZ>X5@Ul)N2~-GVNdyhQ)DIy0r6kfTN7{R<iXc7A<!4*5&>k_!r`
zFZpbyvnw)HcCKeM_Rq=*7GFf(ozV716z$n-1B)*qzc8gpile@c8N2BfWZ5sny-6tV
zsg7j!LY8~8J2DpKtzkxYy^)7QV`5COy%Yn*O@7E*>*{0sP;MKg(j9<&e5b*(t=OL1
z#F2Bs$TfF3`S}>}{gT5UimVc5&36<1`-@3rgd-Pinp?FO?c)TV?7W4%X4lGLCA8Pk
z^%=a4JUyW`hVgz)#oF;g6tcwo!|JlgaedbWVvy5!TLz7wKVhB9lzYfl9S=+x>$6o}
zLgN8)`RtseXV_nzl|`Kokv+C@%7~zSO01(@67tL<E`ueE{=-4mROFROWTGC!|G5)k
z>B!TEogUNCe`SAySQhebx!gO9@$@jyFUUc56)dz_jP@pmN!#<0xdaak%s|#WW8Ybb
zY|qWiQG)HWw;w)Qj6Cq(eV+}=Be|}AE=B%!XP#d*vS(1cM>(?Oa<!K(*j@_Va84z1
zlKZE72T&fCI`hsG<V994S87nMu!~&v6ggchM2Z!eU5_QB4q54~#pR=@&!eiP)QEgO
z;(%Hw%Ij~GmNz4te;L%6!2W1<+w6FbOj}2;zJl@M3EbY?h8*F_9uR@7AY*LMiTv>K
zmgd>$Pe=V;cNg-WUf<n$$ZncT&3lnOLv5up(4R?O)4(g_*n3jRxhNN1m~Z_W*>H};
zxE1>If7AMI5IIOtJ=CAkpJ?&pL&&YN8mdlcA6Jq4ei)hNvD%(7ziy2#$4TVZS2=ev
zJ}(m9<TOk}9&x+5?IZf5_$MFzfV@7MOPcZg&AxH*n@`A5?4n(a*Z;+Zk1f6+i(YfE
z31y5Y=t1uU@(DI=j!|rnB3EHFiTvu8hZ^JgLsMAzIg<$9e^nVwA5mUhouR|RVAo9Y
zEyG{x<*Mn(bpNd}7g3*QThOK%$ZLecq`#p)KTlT<C$bug!3lyfKF7mrxf$}ar}KQ!
zzH(wsEDy4Ac&&Lm_LqN-^ny9a%sI0XSWw?e`iw6ha$%d;&It53R{xoaA32k4ZzkjQ
zWu$rGsRhWkA<~7fkt<D0UJD{$?qr?Kczt1|GF@K?84fy%F+LyQIq6-w1X(hny;BF<
z8$7yKVL9@(VHbZMjBifV!TT$b!?pW3&oIX8@sMv7a?R><J@1i8pN;OTkw1uspRz*x
z`c<<?afZI;fdoJFZ(Fm{NRq)do1_`<Cp-r(R!Ad%b00BoLbiIhOj;Isk@B2MMtldi
zaomzeZmnrQbQ0O~j2!C*<mv3?dL9h@&Nv%I<Qpu<?JJQLh7YwUBlB*Z-1r$;liyTv
z6Ec_8+Zaz|x0(lcRgvAef@~WZ_Kxe>)sbI{dP^JN_(Z*UZ8VW{qB%ZKXXu}hZqPzD
z@RW!+$QW<PEtwt2q9;r9icvmxL?=`mS@7m89me~cV*Q<;cOh>{Fq>Y6{nf0!Zm<{m
zu1Mc9JCr-hiRJ4d$9&r=l8f@<3HF8ik+tqG=4QP9SMgrwWQhExY_|FdY%fkbzV!gI
zh#ad{IoeyL+Q^w8-&WEYVtjsLyYPIFDe`+Rs)hu{+v-!th&giN%tgmj(B3oY$~H^n
z*p6q39E|=wxNz?X@~oyg;X84>k-MHyjv>!}#gwkW=r6aa!Exlv5)-wl410~O>9)wc
zJ^4b6&kG05-8k)$D^BhD#CZO&eadEb8o52vPT@GVPY!hFIw0?DxpS8Bc~tR&89YwN
z4tt1pO>B=+<8E;d`RUz2p9<91Kctg)9+_N~!u!|#uX2L>0`lQdyXB0>AKRxrhuo0|
zvP~`Wky~wIGcF^)+nS!-!x+!y!s(vK6T2l=v7<l!v#a#IkcpEDY<rMBAHIq6M%H+s
z%i+X`pWC-FUt}5PtdvRYf24txW&m<ru!gWH%6o2!ga#oeXjWHl$NoA#Q0xyuE^DzW
zVtk&a|MI?c7_z6m(o@F!9mxkrTyG%v7Z|JGMSm*B7prd}&(dl1h(>*X3);Lp$X+Ec
z6d2Dh^@4eaqL5uZw(1Bm;@#i&FdA9t+S?Mw>uZY8?hmoZD;2+fWPE;~vTB)f9P);4
zVxk%SrI_#Vh)2G#ro@&JPyV$HPZN-RWc0+6P#!suG&dPJDCa?xH})s)-D`tX<P`a5
zb6HT|<ks29bmZ3A&PN%acX{r$?9W7|XeqYs#`YplrmV_AE_JvGjL*MX_vqT>A;+|Y
zYBOFBQ*`xG3Xq?#zj#!Q(Vxb2S`qRq5xcFt=wEWxahVe29SX&I{3y4|xO}<{`L+h@
zi~Ef6)qlw>M-JlbAKZYf^Ze<D3gith*3x6qzsZV8nJ36?IZ4|$qnw=UXJ3OX6vwth
z0R7og&ZpKQmtbPxS=b)W=9>5Q$bI~#vfL<-T<5g93AuXPHcd&iPm%DnY(ZXVevg;&
z{>IJw<K5@T&V?<3GB`f|d*v_Mkgq5Dv1Fs1zxl)bPGkp`6NeeEw+4@2+0}(ynwisV
zg8t)boxFOGy(hC`(vU^B)tA0RJ{>nh^A$3=(eq0m@={r?Pe;+e=Ga}S0pxv3rpv7v
z{+|n5y+QWfP0gsl{_(G6zCDDjDJ#TkhWa^r8coB<tY&iQawunyA=yY|9bHoy#_MD9
z*td-|WZnhuq~BqC6gImPqsX1g+F9x7-?2jT?nmTGLpQ#sD7TvC(L9D+)K!>16XWGS
zYt{5|<Q3eip1Y83Rix#=B7gRmv5P``(YH~SlgQhbE!w@G(H|4XP$p52;*E|v-*%vW
z{in>w(~vpuT^*sJekHTv2Ug@Y&jhL%pC1%ATP|Zq-mq)@KI8RHTyduk2Xga4K^4a9
zJsyEP7cOMIMwyD8$U2ggcy8pku8xU3$Zq<{Ej-9d>m8Rf-d|b0s-Vn4*4DdtN)Y9d
zOSM+>A<M}&33nkoTFU9pM|N@VZ<k=K7iORH0?1X~QfiF*uT^d5{e{RmGVzxw*q>rI
zr@BSR?ulw~#;D&jZT2T2<VQ!k8yL@bnnHYwmm=rN7OQ?kdCt;HTb3i2Ht|bpV?2rv
z7+bGIRvOGRX8eC8Oz6I!D00+E!v|x?I@yL9V#qfyJ=nm89B1#+x(1oq$UXfCvS>8d
zgaq<~vq5tTusz}68A4LX*UN7^El0V3@TpDfki9f(@=qaa(sr21BKtZ^JYu|`ss9pk
zNgkOeuBBNH`{OpgJ$5~E>y9-4M)YU3$-aCevIWJrYY5|~BQT?133+k6$(=~l@2TTv
zQ9+iutFfN(e#9#E($dYyA{Wd)Jw#^bII6M*SzowUnelmE<ciV*>d42^?84bFem&Y=
zPMXN6=BGnWp?~4#vg=yNsxAx94Iuk}J)X85dB*X)7mUx_CFgrT-HB|{9yR*c`_ZEd
z2X&Bx=EQZ~LI0j=i<tKyf100>cn14N83|aZi`*V}N&6$ph11T;>_c7_GP=DC{l~R7
zZ{Lrc-!pDvgZe57(dLH8&Jzg(J}8$w^V<0UvQO=?6^#GSMY=`=8Y9QHMjv)Tw&ksg
zJA@p#Z{=7K`qw{oq{s|;?6LnC<Nsfk<oPBG<cYEt<`85`-Hbs?<cjw7X^iKKF+Gln
zBgkP!pC`w$egAs5S;vq+y>D`gWz3hm&C=t@O8mL{YjFJjS@klu$eMTSO&R}xbxVy`
zKZ)$INuYr7c*veVzV8%r+ok6h8SiI%1RhzPL1v5R-qFnPKbPgKBg5WH(M^WYUuwRm
z6Y`0p0hfG{bv_P-o<pu!*xB@mAwLp)?>w^Ve$&2G^v~m;nc;?9FZ5zW75$ARYnNU`
zZl70wJq*XAz-?A{3Au)L(u5!TOOA|mcp%FtnavMG`=0QR1D?np!F#9aq5l*e2f7z>
z)0_{JjQ^h$>!1AQja)Ci(M|;Y>wFww_d`~iwVRJ|Kk3`F&JI96k*1#^f$}(}ErLPF
z!&gL;81K(|K8mdfK^A|ZclZVR)A#og4@Fjg9plTw@W*>hHXQklC9lpS>~BuNW5t`u
zP*b!!5&c`WM5sm}%X0U`FkT;zMNqfiLALhka^pm<)GyVJLN>qjmR5lN_%(TSqmffC
ziX2o$c~4@;{#fK=A7XnMkKbd}%Mad1UUbqRVi@}~_G;+R1LT)WRG%~MFCBR)i-*W>
zbcZO6&u>)NK3FCq<1xDt%E<M>^47`7f}8!=8SB4C`18?JWa)>!i`Jk&_IK-T(vj0X
zNtHgt{?yBTvB^Z97HznLaeujO+HgD@*{$_`3*+-X%Kx(;x7R!mA25#@6UCgVcR9!t
zM6g8b5bt{j;;JRjQL!FZqV4{Q1FHty2?ve~#u}Yhi0ule*4WiuBl@OIq{J2b5d%ZF
zhdw<IAWp}stH#s@5m%dXb{RYhAr_{#ur16DCFYh3>JB7?6JY_#BE@%Z5|0%39=jJ1
zK~UB?a^Jjohd6Uc;GA}DB;nS!>}p#|6k$I&cj>$PcL|fiZ@E`)M-zepJIWG*V~Cc%
z%49>YSR$-2m<)EkM@)1|f7Cy9pQ!ujE*WPPM-08H<aRfDK*%;mPrlKPCkQ(MyBC`u
z65>LE^#^1Vh~1nWUPna|iFqa>Tx<eK#645qVo8o<Vp`Bm-Zx*83A?^9*|5_o#J82Y
zH{FL*h+e1Y_i`4g#1?@Lv$W1sV*Xr?wIBDS5kg%b+?lJ>h=zuR*Pm}nC*EhJhMmqy
zCrI^sMV%5Egi1=(hMBP$1n^G>wuPC5s37_EiGL>XNJsvG{`4$jqWJj96z42r`_X={
zMly?-Q-mk}SY#7VXFJ=RY0oCaL<hshcIFUEZc05<E6X9e4(``ID4$Ctt`k<@{4kej
z7M$KnU7SalwP<ay3CttDslLCN!J1D*4X3QGbj&9#Ea&pa4doN66^4F$4;B!;bG(VC
z^##O%^kdKFs1_0;ZC98?G7E{<G_m7sB1MGdT+6MQVMX8LK@i<8W#7&^6GZ;o4yk~5
z1hGwt*qo2~2afN5GMmq`m?#q%Sgdyk^9cCXpF97&m`Gi}Vzck85+Y%<<)zCSB?Rxi
z34L?d5+c%aZHriT2~k!m&fWIDgs3*)5IC{2lxVar;21uD`}#i!jqMI8C3ew1e2Bz-
z{Y|cY{LiPA5!&1ir$1~cBTo4(7M`#xBhExii4Vn<5n_+urIdD;5yj3YiHq|d5sO`_
zkFDPEh<Nepbxnc$BcfmT23;=i5s@Z&cQl-QL?~oLz3N|CPMi>5*1X_AIpHB3)}|0t
zPUN24&!$pUPBaJIx0ReMC-m>fi*m?5CUzyB-2Bw~G0_<Rss3!_V`5RGz`(3$kBQUq
zQK5dE6-2DO%7-zP3PNOw-|X#YDu@|vJj_=gRuHF3C7&htR1ib^RHKUdDv9;GJWl6p
zRT8{a!WNOPm4u<`vWq7&Dv3=to?W7EDv2&m8Sk1!RYZo~=q-cYRm2ngVn~xm72!Va
zA|aPwMabMZ)95}@MVMv26e?Kugm}7RxoG#kCxpOS&xv=}o)Ft-t0(mnPY62UwzG=<
zgy51^e;+DRO~hpS-QHzbO>E@aZ2Qr-nt0|de#)b?ns~W|JD=%eHBrLvt!uTa2J^;j
z*qdimL*U1z6`%ZS2xg1<#lmGZL}&Soow6Tmh=KI13$m-85&`+zN0%5qB@Qm4FZk^H
zlyG_XFtVWJDX~`kB-gRgr{C94EwT1|T#N7iTEfI2emApsEy3yhV)Rf^Eg`qRvpSKi
zB@Xbc9q3<LN60&G)8o*sBh++4L>FGEBUURPwBgUKBWl=QuVWsnBNpi-svYC5C)O@I
zR<c8+p4e2M5xhdBo_IVot%9y!Pt4r^)Huhko=Dzz?y$XAJ@Lxl{^j!MdZKXo%#ND;
zdSYAljeSR(>xmc_3uDS~J<+0-^!XZV1Cf0zQJi~m1CbIJ#C%1rfiST0bp5!qf#AOP
z@S%}q194ympKq>f194(mv-r%g24br-8L%&<ffx@zQW93#KorfBFRSlqAn12BZ%>Xj
z5M1*-_OIY=Bo3dg8{f35kzkqo^_uRcMq<O6ZXT2UjfB!=2smWdNJM*d%`v#zNK~yp
zb7yN*Be5bPXM<#JBjJ8o=iSVPMnY;)Z{EwnMuJOrdSVi#iMYIJZ<QT?6X9v0KW~j>
z6QS!8cH@Oc6QR5+$jHOEi7;#>OjkNI5lfnU(+ho@h_`A-bhqDYBJjV_I~xm|2%b+R
zvDz(7gpTou$)k5oMBjZ64@s70;yq`rVDQ3bV(uV|*obs9aqf{>#wM+1qV%9(>9s@6
zL|gj){ZAd6iG~>}ZqxmniO|pQ6y@(X6H$&1A;v|`gzL)@Ki8IK!kXDcI`myLkuF$$
z@!qr+LVQg8O5%bR;{3pQwFIda!mKf|?5<`D@lrX4Ex@>iIA(xpT+g%+H0I-DdwsCJ
zZZt(KriBn#7_UB-*Frp*p-&Vxv=CY$rNYjGE#L3Q7DBP4DB}g+Ga{rSmv(W@Gvdej
zUGD-&uX^TZKhO1&G@kmN?T_=mqPmMZp2Yoq4%m1@<(^N@EwFvp5uI?07I@I>yiirU
z1<!}}OCD8d`F_q%3!Ka4U37x01$e^phU7ms!;`#L8}^=NP+T+rc289^+&I6|p*X!6
zgdP>p??*I)?UfMj&@0Wb@R41qk6km&>7LKwZTR=OWt&%igga}Sf1YP{>wc|A{j}zv
z=bYu)1ZN7h{(b(Lv5{}IcR~~FC2q>rUT=c5?Rui~FEqh?-l8*>N1Nc<n%0GcZWBaR
zC(T~0(gbnByYw!JH9?<IQ!f?w!TdO9&131*_nLp4zqU81^Bh^!2!zs&l@}j0!nvdT
z;|qctA;R0|L*DsD2<(vIH9gV@6?!|j^6dTlJU8dFQ{S8Zan9R)jk<wZlMOH$?rGWk
zrUBGSuMgxlH$ccy1G8|V0ia3YnQMFld?~%T(I({YbK~sC6aM;McA2r-@Ik!>aCeX!
zvD}2`$=Ok!I;?5<etusA2-e7QBrrGpJcn*1Rr$hrYdyR&J!C2Vs2<L~%;i3uTo28U
zU!RP<@%Q<4rusWf6zu*!*DlAsi|e&UJ(!yC^r)|^hk(Z`^^z9XgMG{kYeA0spXcEn
z<e2(?`P4aLbwIi}$cfw5!7AF0IomYqex9TEda|=G@k1?e1b(Ze)zrd=c$Pa`VroI`
zeD=X;=h~m=@6BE_^*#1XgJqAom}}w9^N;Pf+n$2T)#enX)W6T|<CFDwjWT%(7Nd4n
zhZUZJ^Fa%mJkL|`6maF6H~9B?fA6+TeP7;g7WsJmL=805uu`}*YarwE{D-2#H9yY@
zOl;k#aHYN)1QPo=s^Y4laaoS!{0r64kuc}3-TrD&sx{o#Dpd{Y3nw(Uaa2R|YReN(
zUjBXl;Hx$-#o?eQu+w&1v;VOt!20m@MHRItK+UGAOe}ix^W4HR?%JoJbyc7cKjh;O
zR|TiPpKIvKG_?<4>RiVvXe*e=wc)A)LOfx}v%eC&zbOnQ7ga*6fOG20&`Jn?qa(k>
zuJY%3iKWrIEJ~JDf_B9I$)#T_pxz)^(f?Tmc<-LtcVNGL%VnRd72shIba9bc1?*_h
zX3JHqfW0aKTqg4>puqa{wb|rjr~qM?`l`RrX|&tt7;)U?F>ILQU9@xG<Dcg^o(WE&
zNO3*}f%)6#uEU*nQ;!?vK;6A)Qa`*LUU)NAowF~8M%F{64|kM<Pi9nKzeqW#S+8BS
znz<Y*OPsGdcRqrcrQg0i%X$QdGS|5)1w4Z619xU6AAJO!=~MeFn!l=uqzgZS8qx4r
zwed1=Ej>E>Rm<P!Po6!+d|UZi8O-zNOPR1J`*}X)W$g_+!WWjob&i5+hmU`sU%B7N
zc!q95Da1bHE!czm#ebY{$y~Zs%ucBk%uc$s`SF+jJpXdH{N)+LwIv|-Y1#SJ@qeF>
znJTi4xzeNr%EHQ6S7QF4ALnO|ljrQ1=*8euTJzU_l9tme1E$9p1KWn%nPHcUfq&Z$
zS=mFyF!S9mj!wm5P&rg5;lp1Hhg&+<2MiMM@?2(wU?c$@to|+q`v`ay*!I+R76HP%
z9PaBYia=RBI$)k_5jbm3?PJNcQTLfSQuy<n&zC%ynBKS$%!8JAhR!eic@F5ZZ3RsF
zo&}I<WU%>}3g+wieopAABQ`<YY55>%nCMe!oez}B-3Hf}<%9QIgZB=dd0^HxwU0)j
zAXVkePCRGyoXDF%wmi^Wu|vG9I2TS8ZD(e4%KdpB>0nmUx~g|Mu&Oh_N#kD5&+|&j
zS1N1I3*<mmQ0W!9rfg`ssI-#VCmY(1FQxRVXG3rC)IOdpcYejzysV$+o~k-LA6U3H
z3#tP`cNo0MgcV&2QXWQU!lh~4tUL!Zfn(0f%~$v{A>q960p6wz;O8mZmgJKGiQOI3
z4r*qA>$XkK!qYN-p07GL^pxuh$8^{RQ~QaSre(18zfXhM`5G}S@o8|RthG$eA`Ncu
zbu@AoPWyRItEH}b!^Y55s8Y-i&)%I1QiD&@)wok({>}ux*HtOs=QjnmY#F$EU{lJ^
z^In&gyYAX}G8xY0O#f?N)53$CTH8&NVCQ?wPOtVvIMK>#KD;{-YSLajwXaV2d2X!m
zsMW+!!9z&Q)4%yb_90C0jMvkW;=%4vkk@L_csSQ(pLr$f0nD}ks?4_V0jQ?mnHwJ*
z2ajr6m)T-ImOKa9zxG!-4CusKFyH@qPHoPJqvXKHSQx3Dw%y1s7EZj}x^8qR2Hw6B
zZ%#TK1A$4Ag5JH+a8xqt%Qd5DNHSD3N_u`5fZt~=9rL7YkS#DZsEq<214`ektx*vF
z{aoCsaYurlsN-Mzy>`{k5hYIE{&{{bEq?C1MzdS+nm=2=)aWL_qjJp;x;NnTmb>9c
zwZnmUQYpG(YZx?5uWwqS8Vb)ik2oGux(*hy#-p#~L!g8!Y{diVU|1?K=WU935Qs{=
z6&e=}1Y1{~*elBeKtn(1ul;9SQtKpZ6?|d(_j7$sS>_+RCFTY3cRiyumwUov$i(#Y
z9zW0jeM7w+ba3uPu<P<X&Bx;g<09PoxA@QfJSX_2qvI(ru2Ud;O@BWtyDb!7zIu^m
zh86rcPxz|7g)W6z=llMK|7RZ>FswLsbR^uu{SLn>dwp3onJD$dugY@Osr?hbDuu=v
z*%`WtUzH5$<m7+nt@u&@e>buparjmFYcEsnj1a#ne{K0)LNYADmGZ0dUmg51Z^e&%
z7XR+yzs{HWu^;6}`D+(b<DPW=Rrzbne@K+S)33^ZDE|Zg8YSlM_*MB2<^Kg!`+_Kx
zUzPvM=0EFh7u@)C4)+=Ts{BvgU;O>6ycs|0e_{5s`d4`~e$@X|{KX%?%A4_{{ugF{
zSCg(&fB&ldTl0VarSjeWSLOe<V$_bTpPIK{mA|(9Psz`IPyT1^|NY-T?h}&uzqk3H
znr{EI_FpUi&vT&u)4&a5`}Z|D>5932{&C^G>-zIzOvHa)|A#JxXI$$a7y3qv|GW?>
z>{I*Gr%J$zpBFw(U|WA*Xp6G{ycqTrmA`&tSuHZ8sjJ%$Kg#x<0lg{VZSbQ!AhV_H
z@}@@kQGSTrB_rm5@6*1Q-!87U(BS(7Kgub;{}C@?%w6*z7j4><#*gw&*Ty9o#}}&n
zD18?D$jm2rRDP62+az_wti@D*l))Rs?@C8Xs{AN#MMM61H|F9WrA)?#RT7CxDnH7P
zhv&$zTf{>7QDSWV@$)?nzc1=>zp8M0A;p{pKmV5~qMXw!qV%{FQG^4FD9tfNl-b!u
zl&;Dm+*?~j*)W84<3$wq=>+A=OoHOptW4Qbu1wL-Ql{kGSEiVRD^qq}!^dG~WlEnh
z%G8u8!mE`j$9PePRHCF5DN$N|lqiuKl_<h_f6cSs>87j`dw688*F?y5*X_z$v-OJH
zoJ!fOl0zRd4|sf(<qx9DE$U2?RaB3Z3uU^Kbx0sFvtog8R`k60sNazJO}AL?fX5j*
zk$YD&uWI;aysEgjZon`i3(xM&`lhQQ$E5F<mB^7T7pC!C_ETG+3{#kv+>T><S<~yT
zWiZyxm8Tb>EdDag3iE{0kZZ6Z#uu8(0)QM122wr@Hu&5G=?}L-)%Gqt{}u~|`1%v{
z6XD~sRG_n94$1Kxh+!{;9c%FYl4Us*<yL|B@>*CN*9c#?Jcpd|4(P7w0k&K`_qq5j
z<n@h!%Zd+>?*4_bt|=TFw9>7s)z_VGIG)ZseP>#m%dYf`%eSrT^59En5}mQma`bf?
z?efBP)U0sHxCN}~?U66j^o~)|Ht&~9Pht*|?hGlHzT3~79>wFE)?c44wOV6AI<37y
z%A8<Lzu0>&P1T&1)}E4)>gUy-iU%g7hUc`TX+)(+O<41#Q7FaOhu>YlUpoK1_x|%f
z{PFki?O7{=lz(^q-kL%gPR}X&-Suzw+6o_)e|P<xJ)37z>hG?9v#+s@mHyrJZ}uDG
zbKrN^zuPMi8{>a{{hNKytYXdIUH@i}4_3tQu79)lZM0DO-Suzw&%T^i{@wL&_5vrR
z;CI)*+5i75KZg!}cm13H-`O%`|Mr7(=lZ+r-|Q)r@y)-#{>{VRuTAi=$o0Rkf3<f*
zo8Mf&x5u%6``z_>YlifH_4z;Re(&LTv1iDBZ;jF$Nt=Ir{hNb7`2+ss55WEGfAR<X
z$sh11e*k`8>reiGKluZe<9>oa`2+ss55VtR{>dNkCx5`7`~iRR2mHw&@F#!3pZo#1
zzvNH;fIs;Ia6kK>`~iRR2mHw&@F#!3pZo!T@(29MAMhuCz@Pj9fAR<X$sh11f54yo
z0e|ub{K+5iCx5`7`~iRR2mHw&@F#!3pZo!T@&~BRZG=Dh1ODU>_>({2PyT>E`2+ss
z5BQTm;7|U5AKMasl{er={jc%{{HXs`-hdzVzsei%qaOEI;Lrbi`2(in!1FyEzbb!3
z>%YsX{*So+s{C(@|El?sC*W7*e;NFD#n1iEf9;2){8v7K|F-zM=2!dff7Ji2`M>}A
z)xP^5_5a)IAGJUB+5f8ihw}e`AN%ZoRsIi?e^mY0XaB46AIkrPU+sJUQU6cvU(x?}
z_rKqMA%g1`_v5m}P)(Ug*nRQiw8zXOB+urSUByCzw8`)#Z&ni0_(JI;(@EIWHS@wA
zb`sWF>=n<RK>~}O&Da7?5<H9yU!Lb8A$|Fhp_emBs5B^<tuc#)^$(TzKja}Huk>co
ztl1<e?CjWlY7PnQUncuo=c4@?t~jN6B<R^pyLxv%2@ib-JlO<D;P=eGe{2B>BWxG@
z8y1pKP@uF~eh~><b*Y877LyR}c1NFCn1px3TC=T|pnUtsw@;UnP_jMd<+|l0o(sP3
zbNC7pY{=PbDIz2!jJCQT7A0YaVZx`HRXDB|Kd*JGNjN*lL-EEM5*#Z6W->{T@aS&l
zSIe~|i0>Qas*^;&*L60^Nn<(Zsb|DG5|Z4GePEF#VUNGmg=2Cg-2Je4O|v`+EoSl`
zH?Aka*w>{ydIJeVqN4+xiX<E!h?sRsiG)usE_$8HBz%huDcGVy!Xnl;n-VvXAZG0J
znopGkW%KRv=eJ-#s}A`LsFA>|R_LdrK?0}uq10SW5}xkeMO&&x!ZlsL-QL@<pIa6;
ze%MZeY#YVScqa+XRqNMQX=6X0R&%Y}MMB)I+!+zONf;kyUCFi==jCkrAv;|X#y&kN
z=+MJ<mng}r>yyx*xVRx@KMB+K9rIdfh~sGyHS;hcf#a2)A@u+Wbqb$P8X1#N=s!EY
z!i0p5m{`g>QxcA^%{+74jD(MGRk=7UFrI;XOHLmqVL{KEkX}m?2K=Ub?KnaL*MY={
zTx*>7X}$F;j*+0R9J4IYhJ=tOpF_SKCqdV|PvodA2^%U8w>`HbVR^cH{1$s$UoVwz
zrk)}pV|LiX#b-#+U=HcH=795XTz>UuM-rCIyLjWU6UHISVO6s;39Dx<Y~AES!s4#u
z_ma<(5c%?S@FF)7-gijfy>@|w%U9#-K3_z;hi!sZmq^H>R9$^`8RuW?>^!wAB(!M`
zm!^B-IxZ0LTk1uE<>A%N0oO>l$2RUk@xgc=3Qs%XOTtXK8Q;46&|ZDVk(~h~6zf`z
z76y`Vam9f<;=v>YIZ9YZgy8z;?cO^x6yuU%XY3M&{aW_s>To#5XQ^iMft$E)PX#E~
z-XbBQyP{J0HVL*X-=9prgYz+yO-VQk<88nv5^$FUvSFbVa|{Xj3X2TwW6}R!!Pvfg
zB&-=)I7=@M*KO(I@QMc{+>aDdUH_1T72DU(e3*cKujzdfOu}`y;v$n@G70-%7OiGV
zMY-p!GxljDOmv;;=}*UaCVjHj&m`dz5zJSeh4){ZPLEO!2~Wx;s#9`F$lfmXY*{`D
z?(&9Ap#>yd&`#dYQA7e9l+1A<NbnNxRize_aO}#X5%W?KB;;P?x0d0&vPi^jFUR;5
z<Yp8<#(5QU@0F<}ft%k);z1P&y}R0PE~+NMFxqBSU=0apTDLx*UQ2>?p<S$V9rk1K
zU=UeP0<|*vu0<ox@73yt_9ha%*C;R1X~BNDaRih<BOzz^x+NQ1Nmyu?-;mOV_rZhM
zyDK|L(5fB{y46X-vY3alv%5&xGVSSe&u+YrvJJ&1dvF~D7(|?YNy3YRHInaMk<d-1
z_nG#Spf-PQZrf`TEbfjZ>I~v~H{DuR@rDGKRm(ps50P-N;-YreI})DFw0bQ5o`lo2
z&kn?n;5zSU;9Eq+ezO|A52oRLB<wiAHA;fhH&Ld`AMpA8q}|4^A2Dt__g+6eMuO|%
zX5ROoNl^D4O*}kKf>C(3b@v3WXG394{cj|cK9Evxn8bCt@4dMe6BVj9?2jp9rb3{|
zX%;0GD%jJvT+U*p!W;YQm6B{!NITE@<^eku9=~C$S;j#HvukB_5u8-`wtmy-{FzkP
zQ{%oqkedp+0={>+c&MN}X1ekUFBLARu+}oop+aMo!}W7>sj%!=q3b6;Dm<8My?Sy!
z6`GBnW(@OFVXsjH<;VgmEO@@nrf(toyVvo>co7wjM{7UmSWJcaaq*7(gsHI6cf_h`
z2^H8SmpExJqe8#s=7j3yRB+|do77lIg+dl%`$r;Fs1`C|-?WMfvy_aA3dN`(t)LgO
zVGR`ohIM?h#i=kXuYFHuEfwZ`*wd3LNd*Ze(~WDTsUWicTz0}bDhN5n?iG`z!nvrP
z*>Q4I=<$}Mtx!O{1!1)4^;GZ@Sul6$Mk?q9<?2N$QemCq*}TQdRG7wO1Q9@mfnxLi
zg`23LVt75_#%3xcCDVfiwqSd=U2lh}QNee*Qq_D7D!5fi@P%qp;Y!86i}SRoaJe^+
z=lV7(gpL^$^X;I*;`bW@LUvLiC;EUppAHq&$IGvW?80$BJ5$ZKhYBD0?U!8Ni}8sm
z44bEi{Wsh%6}pcKYD=~b&EHRjhBm*)VFpw<Y9(1FU_^zH6!G302QXftUc!RLRB)zf
zU5GHjd8$7?O~{lAcJIdTMVe8;X8q{Vr503Z!tBQ}hpDh-0*^_vqC&Kii+kJ=D)4AP
zt=Lg241IIjka&y=t=raBu04+ZoO{$E?F1DPRaR)q+Tna=n{UWDNrf2WH9I$+qJsER
zSNEdRRA_%~+`h>H=jVFE?s7+5Z~V{SX*%J0)3cAOai+q}4G%8sxKQC;g7c;3^BAAd
z;TU~4D(vcG8tA-0h0`wiT8G@JV7OyZeg7qFPg%^t+Jg%Eiv2Kh1>-2SOYGEDDn!k&
zll$yNh5acS=I6bsaErG!eVQ-ES7618tA13-%aF?94xmC-9mOU%5a)Yei0Xo1T)*pS
z8zVz74yFtAR)$icq?ji#A&d%ZHn)yQ-@y1c+n>n2iT8o!YaW#dDi{q)H$T2jg&K9E
z+#Qj)zU(ZDo1>^8zkk;o!)PiTdAC&NRSd>?;fqM?dsHZRc5yB3J{4|o&+j?=fC?|t
zZ>2Fkq=HBGy!%%ZFg_ffg}g~rIB<vlAv~E1Er*SCmZnl++n(~8_%tf8?vpyYE(6z*
zdGzXnOe&-wU(AgM7J{2q?CjbcoG-PF>-XiMeC*|go_s2-J#**XkwUzG((KRDi_kvG
zRMe%I3d`kBe4buPg%d|^z4I@_`+3bU)53CG=MLuUV;@r?T!}SkZ6&V5GmYGNRaEGl
zSC_D*nhG-Wz8$Np!TZeGRNJ7I3htbfd;04z?jz5fY#VUg+{0z#jo1(4Eo-kdqo4Nf
zg4xe7UXG>5Za=32uhfXLSR39yU#-?<wPQb?No#HHq(VxDwtMXhTn~YzT?XB_o{#t%
z4fIf<TsmvQ{v{Qzy-_46eN^~zWkrlnKdx_f`-ck#aQ$0~w%i}20{3mrC9-d+u=&9=
zztSNpI9+NH))}Tk*=o(^7w_>txG5EXl%xVneem7SR4SM}K2>;yPK6NX<}Z97(C@n}
zgP4z0Sj8{&LV672@nzP<lFztag1ootj8kD>Pw2Yt2`Y4V%cvaxMg_ir!zaE@V*lxD
zOT3wAaEdipR&W{(GAcr99<tD&alL}a#_2R*GCFTs%|?T4iKB-MXV4%%jmdq8g9a^w
zTPmEn(5_Klf{U95>~=4*Z_T2?uEz@I;=DA_ZQj1FXf_QDBLr7y&!xfpWe?Z)@X?^d
zdfe7-J`JQ!^Hehn&_GpvSR;4=4es{_53CTRfy_3J`0PbAV7sE@w^fJ+=fkZ-JA`Sl
z{)%C#%~Bc&>aOIWET_Rv_FA{V6*Sm*Pj~JL5gPc)6hFxprGY{&PmGor4UTTmihQw}
z29ZT42wQO)_-wz##IhFK9r8LHDoKMUQ6BHbq_IB^PT@uCXt4V95zF1OG<X!Hr~g`x
z1|zI$$D9;spb{@1&AovJS3{+~-rY!pu4l4N@=7$gX{WKEMwtdic1K>AsL+79=XTkL
zO*BZWcw6J8N`nSzozFsQG~im(sF|rw1DzuKd@W5H)Q!sT>e)(z$@V22XSUHG?3~PN
z&K)!e?LXNcwUY)LmiDkI=wLj-bw}+k8a&qAlV!e#25#GpH;?b7!KHoor~!I3FmqV_
zNK~H&pK__W#D0vo_(Y?gAq`%1@0j)82*=s;=J@4<G>}!o)67h0FlYMAu#7`Akkh(x
zXuBB=b_<-}*=J4zefRu>=MK}rJxn)nt`!Zmk7&P1I6?!L=?P|PM`^%&;W$&*F&gZ7
z8(w<mIF4(N)cskuIInf`$#Hf#PbX5^H`&u*joR&19j9nuWzKTz)EOGw>h71~cEmVV
zsSVvfOM^-|k;+ZZG-zG#Q`vEj2D1j7-km;AgP7g)bv$m^PQd5e@fT<?FWX;S%^lZU
zTYh)<C5#96`AjDd8i-rBC-HgGz<647b;?y5ydJUP+J21&3)LUm4tUexwxHkGMPH1w
zmtf3de;Vw&r)QrRKm%b<mBV^LG%(P3agG*DgNgCA*}m6lpj5PxZ*>^j-J2F#5svfv
z)JxI)CdPe7Gb>XB4Gt^4qD9=M!L^*cX&WPHpw)Unp*4yIL{^>u>1Y~kJw9jVoLF2}
z0&5ae?%{pVBxtuYjs~l;2ld}QpuzH<Ky$B$G~l;h94wkh0~R~qfyYTG=Y4(9B83Lr
zmZD##rP09EPe1o=It{$<pS`sy6Wgotjqb@pJHeZ^t~oTAoe{N2C=dIY7VBS>PXiIT
zc#(sJxb6<5z5H54gLN7uB@x9m=$qaCNU4+tWcTFIi!vH4sFjsJUrqy?ujlVAuE6`k
zw`)C7iE)qGM>T#zgQt4KHIy0}_|@O7iF!(d!nMxi<~kaD3puOMS5Jd2E23g9H`1VN
za#Tj7nFb#<9N$#7&>%usqSX31>L&;gTx~Rno~7KA)J}t*W4BlA>ZF0@ppqZ`1r0vO
z3N5<cjq~tCy-uN*2GgCgVmn^aV6@FH@_ZlG&pJmed5!ZAt<2>EI6nWY)>dz5pe7ph
zk#mR!18c_aCBMV*m*+e0d5`VR?>+Ttga)zOjt1VO(!k5}Kr_&3@Zm$=hQ3jJJj(Yd
z_xy-)VSaQ<e2fOHw9}f6pK0Kqen-V&oCecuw;T}sN`r?wmbXj3(LlhJlf{xk2ay#r
zzFf?77(Ldfm^O_LuiS)q^jYZ;d2NvG+jKfC%Gta;hMf)pQc@OL9CUD6mi>g}q(emR
z^Sz-n>A)&{eVXztIxxF`c-F^5$M;*GYp>0wgE2LFNO~?EO7%XkY3HK@acm;+!hAYR
zKa{d)l>i<55Ai>(UqFYOx8$Q71?limh4+T=Vmf%Ai_5MQqQfp%$`{)uSUL(G5?DqD
z@zBY4CClmXgflV1dL<q9P8YSGBT9!&+4eRCtLUJq9pr7XnhwV%uhw&m<9Nml*5^pj
z;e^eMibIlgNb?Ol%PCEVc3;k2nd|7F6=|`<SQgv;@Zk6ic{-3K9U18gbkJ7#CUkHE
z9kzPUO<`B0Lo{`XMY<9lj@()W2Z0W>VhQCLo9OU7NX9f{GabHcReor^g$`HvwFNlU
z>F`d*Iw4Dg4lkPn%}uw`!BV1T6ZbYcJaQ1&lDC}>mj+yp9^Od@myC(***bKn;tO9z
z?4m>6X1(I0d*~o<FMp0-7yI7@2g>#6pi*?w?4&-%X={_OkOAuDns?V2(&4R!n6A?S
zI;e?@kRrx(aE(5g(qe*s`<g=BO>x{}UXfDf=s)>VeYXY1C;9OTUrRdB&Gtkp9-#x@
z3<;GXYdWa5?`OSnj1Ky9+D9~x)4`EUo&0oy4!lWyGWYH1(BygAPtTqXxrLUqrk|z*
zhgVTX<{3I{U+v;*;fV9leeVRH6CITLlrNV%W1Ji{i%+}I;bQw^;gzm*IJdR%-ZM8k
z__D0sedQt@V4Kh~g-dkUcOXFE&1E{gaq^VCafJ>#eQXZfuF_#``|Pd>FFM#oBv>bT
zW4}+d3Yz%RK{_COl-HjQ)Gc&sSpcq|n!&keg6Lpj?Q%dggbrMXGOF9J)4`hVZ|oCB
zhXnI^0xCD?pfRQ~M!QLeF{<d-*a$jQh7^eGze5KW(dmv{Q5e5r_V>hHI#`KSUbT;*
zL)dbSZ6f#Ruw}_r>5lt!Sa~=A{2t&sTW@w!^&uU)dYGy|CD0)-+IDL~63$m;+OSCq
z#x<lmn=g$HGJA{eKS`%Ul9q3wYbG7cN|Zm#WYZy((q!;9hYl}vcD}rmM~9i?>3+He
zxDGYh%s7kaFnM8{Q3*kZ9;&;uLkZ4rZ+fwK868Y-b*=7uM2FU+Y=t)-(_#5dsZ+Zu
zaond(cCkO91Dks2UZR=~h5BtSXP)Bv`n>9?cpV*XpYq<^UytQHmabck81FT~clI{Z
z;XSj;6|QG=s2<=5dGwqPcSXl4&$Z!tnZvnEwu265KdMI$cjA2@oV@j37v68(>hp|y
zFus>~XYjwob!IesX~QczbmVM5<ke4yg>T9ps}9h?OUZfn*FidDPd~$w{gw{rL$W(<
z-(j3Ls&<IIr$eTuAf<l<*A0*QwmVduhgW3<`{{JB=L_FE_X8dJKUL1I`-u0`3%yTQ
z$I$-*b!N3Mbok74V;yCJ4m<<8*YdyOd@OdE;V_Bqjn7V!W*UW-rUhr;GmpaC@lfk{
zmQnav>2vY$^ii<$pDbR=J_-xt$Q9i)M&X-<dFoBhQLq(0Xr@1N6lO{EZseOa3g!Le
zhDM%Icy!y}#BcT}c%_sjY@a&{FHZUham*WqdL?R3#r#nyIzn^2EHDb&wS$dS7mmU)
zjrL<qi$-DJ!-_~^@hAi|8;`pPV?PA%ol{&o3eH^-%g2|E!hL%!dhUu*SR|i3=qQ5y
zb+2PlSTzc~nMoR-#75!JN}bfKHKP!|E_>4%iBafM7#Ne49EDqfubzF78ii~BKf=xg
zoT{$x|EDN4m^Dx+G9{H$3FUVxNt8q)m6S>)8q5uxq@+m-nIcgl6em-plLpZ!rJ{ib
z84}f*$NxHO-M!EA{;&6WU)QzokMH-p_u6Z(z0T>zUcYnUdV4vQ1w|Du3SqO+`EBp7
znPbI*q463moVhG06+>{P4GUtq%WNX%v4H(*zKOLR3+}PB<_mxYqVl&9H49k4507s@
zu!sd~(x+~*Tg(FGgY{aJB`k2Juk63;$b$3o@B0orvEa^*Eou(SSkR{NYrUci3tTqF
zG&ikaLF3H{J5Q}-!Q$Qbrn$PaK#>zUM#F;z7q2cdYF*8Oo?e6XX<jT)($}q7=goq>
z*Jji7*Rjy=PXd2@S&z=Us_9Pt1{Tb+ak&++kp-g^#O>4lSnx!z&5*U31y_2yld86|
zK)1=<{NOg!Z=-_V1v^;ay>;V@;X7H7`qS&f<3JW{Hae%4xQhjqAsT_J_pqRq_F+IL
zm<20;|4Hi%VS(H)?|}R;7HD49+8h{x=0liqEOj3X{GXqD%-@gtHP*+5d5{HxRq-#5
zMzesYqkVe$Ar?@I)Ppq-qx<|aEV?}wwJ%u8xO9{SHK!AlcN}9u7vCvy=5ZEe=SSP}
zPp}|EZszE_r_eY>ZW<n+fchUc)_7$i>gQJXUE|NO;9SM{Pn}6Dc-RscR+z$q;;HVl
zgHzGGGk>ZxFCCq4(I?YknJnn|cyhzD3+Ot7-qoJZX2Dk9M+-LQuwbd-`k!XGs2$Uc
zdR86_^gE8!)m>r1_$vL+$F8z~HEGv0_d*uzIvsLxViB4zL9=YTi&^lBS|%>Lj{3dg
z*Y|^^EO3~`<~uT2z;M4y)huU0g8rK1PZen1jArUyt73uOY5w!DTWFqYDHSZNWkKQC
z-v!EbEO1k-df9ddjo(@ygZ#TJu!`%>2)>8zuXN2k+5>dGb1URWH=uc2Kw-ao#DeOE
zd86~2SYV_Sv^?Yq3s!wSU%ucOdfh$0y;$W13#KjlB7Wb@0_*aT9}8PpP=CRuE8;Z^
zZifVqS@H(m*Rtv$t#>R~_*`}1OB)NO+aEYz_8!f@<5K@aAJOYYC(GBhg9USTuRWyq
z8O=vI+oqpiSTNa@W?T0S-Jj<{uTFhu!AMDC^7<YYJoE5~p4NxjchgK1|3KHjd&J|X
zKUwg0s_nF_K^Ejt3M+$tv*2Zb_YPpOAhLJGVpR?rSN<u-PA&_6jvW_L#%F;~{jY|@
zLi9Qe*R}T$qj_JE(`_VWL4_!)oJV29-KOforlD-e&-QqfDbI$PLJ#F#!`TqNzV5&R
zMK-iMoYl}A!3OoYuU~eJWP^6u@mtlS*|2a<Mbk+YHcW9?E9a}mhGM^io2eRTKQ;ZI
z!?oDZ`oiI2+ZZ-Ho5J2#G7cSg&LS#Cn+;}}oPyO8*ie1nRbr;ghL>k(`=xqlzt~3o
zSCiP_K4swNRRcD7a&LZ<)l$`_>ke}_X2Xod)0dl=vLWnA?`^Re8^&j@@@z3@L$b~8
z@dXxaxM{IKK6(ZlPDz`_dRVgI$Sk#0Q)jVZrN`LnA#>Qk?&)xNYsCiUzCGd+YjmD7
zPu?G~WkWiH{dL`Z)Q`YHtyzGMb7bxsxquBPpKkm8c_ABA;`%S#vS&lAbmiW&4s0mB
zo3?9*BO9)GJxX5a#D<0yonN(=vEiO&_qspJ*^qInL;QFJ8!~@9ZOB{62H*FLTL<0I
zc=RN<uJ&NVoJ-+4Gd$U#bZ%X|(i%3HI63Nn@n%D%hh0bQIyOwTU)Y%9!v^O(&-UHE
zY%m=bGsbxn8fVV^eN#5Gfi>Jvk+PKyXB#fnwfUp#dt{$gz8#HU+UWc<0q8oPP~HUu
zvO)gOq*+ULu_5k4NY&&$Z1D0CZISF{!^MW$d2JzV^zU)?yoxY3G<{%iIU9kl_eN+{
z&^|UC4WBp5`2ZUNA1;4q9K{C5nZ^0?bT;f*=9Ardhz*fNo0)Zo*|5Fq-iXX2Y&eh*
z9TgeJ2K)ILI-c=p9v#vCJnIA+PYLCv`YARzfm`3;X*PWPpl0#>3>&WRS(ILUmJJqX
zd#9gFVuQ|`5d%9?*l_r5{+p$#Y-qH2&|{L$hP1s~rzmEk>z$Wy{QCtq7#lAd-;m9Q
zmZl@kS8~|!^{zMLXfE3C%7ePCm)USgqv?-BJ{ux(1Kf-Y(0P6pw<%m>LvC8q$?hUH
zOtLcA)>y)ZrCZkr7T#b({5^-v6J>0;(D#|O^Clb4@1Gs+Qi0l6U1%_)iVZ`Tj^eA`
zLdVsg=l!Wc?Q3^WYQ2qKFN2iOsypcVzI^+YewPiu&!(pyyocuBg~{7}AFzR&d&qB5
z0~`7m*Tfk$qWNps@>=OJ8<u@~vb_HZ8w$r24ZL`U=Fgsxnwu}sc}|*^roLpuE2ZZz
z4!lC=IkioDV=Ei(RP#?Qe#?e)GmlO+Yh!~)s@fmr_vm$&nEmz72jt(SQr>-H!-^-(
zi|absaB%g(^4u?M7(UEqMf^83UI#~N?D~%G<7PI+qX*R__7#q^?L)7>ag)|g>Su$?
z%pDC11898R+SdOZWP`O~sP60EY&f&bPN|lK&L3>8o6BLty9GPeALp@Q(S}zK_XyB+
zhV1uVBVq$}s^7Q;5_JE}6DXz>4vd*3r=d2K19~^>SMcRH5R=ec(K(C*pVm_yn-n-;
z*wiP-P~yP3Xh~1TNDkaF-6e<}&4J?~3uXtYaKLm_WV)vs2c}#YZ?-^#1MaVkzM5&F
z<9+fTX^!Q9eQ)v`$v6(U7)n)pv^k(t^9B9L&VdQ*m&n!WazL|sTJ2SR#HjS_bCWr6
zcx_^Flp*TZkTG4`(PwVG(KTP{VZwn)Ti&$N%s6l{Rwu#SoC9taqCMj*IB-<sV6^-U
z4s?FYsT`b%&hHtd{eg=5qurI?IGY3g9ix0JtT=Gqr)y!ZH3v30gt?xv<-iMP=COnG
zIq-DyqrM%$fn(8$kzNZpaAb_WrNbf)`uQ+iYt~{8{CSvRFnI|Fl$_73Q(ek|f{$KI
zi4*dz_%8j+IIwnfsN#DU4&-XR_|fFbfiDWmqG~tPPKM>2f>r4Hk1fbZUCjZDqjpn|
zd2t|b`LwQZZw{<EulB@$9S2rT7<ljLgZi1=IL^_R1J7>fMbF*D0nYMRHPg);xJlXh
zZ2VRZ6rI^nF=87BTB<fR3b%70cvhrBe*g!J?p)dZF^~i8ngjALc5&e4FOU0o_n^-z
zQ~y-L2<Cv<tkd@|hjO4$!+%(6I0vo=1@1W>iN;s%vf{!098gbCd%Wu)+ON5yYEv`^
zW*<v!_Bh0Wjls9HmL5jFoBok`M>w$g>r=fMaU7ubKKy17kB&1`c{BC|2O8Z9|BO7v
zfk>-NTS@{4lFxOQu+DIx!{prZp0gYXtIi(#F^L0A1@+M_DI7S|+CS}4Dmt!v&c55}
z9FPwA^{Xrs?f*?L`Dzy0->bnd>mmmXbo<sPUE;t6;pxN2^EmLMyy6x83I}$mZ(SLF
zl>?7jFY*HmIWVGe$J5P4XdYZ|c(S&H16{5)T(=u&UWP1naVq0LPDkjA1vfdsUT+^|
zUBLm}n^m4Ot57@FTGyH0;=sO9mrhNp<$%LQ-QMwaXk2Ev?p0@UAnu5b(a3rZoY>Jh
zO#VIxwih_6i63yFdQ^xbrvV+m!T;JoBM0hs8rk$b=72M$ob~xB2ZZ0ow7-AOfziDy
z`dgdPyng35wYh}@-00QGk6&}(*R`orAHG4aC$sNAnD5ZIG@fj$Y3INVPkmO!2Q;rP
zUA8X!!~y?(`qzp(Ik2cW$+6%I2Q)?wSHJuX%?G~-g`Dpk@QxcWxzNLbQx3br()!SS
z+AADL?nn2j{e1G-0rWa`cl1yAg|4Sqb<4>=97wNbosMUt`R>g7dX$S^zjO5bWBDAA
zEDO|%5u*9EscRrw%z>TGr#T0u90+LNW_n-<7fioL9@{6!g@cP8XhaU<Lec}5$KeWG
z__0v?dYBRy)+J886FQO$s&Pk!A)~o)L}0NwM1>29^(OpaH7;zZ2)`Aq!G*wLy{o~f
zZvUBR!}{Q{T=*@2Trp%k7u3hB+8?6Bh5ILtYKKnbf+bAp3f1F6yV9(WVUxIU?m@-S
z2m>y}E-Q79oWh0ak;cvYjJe=%G;#j{Q!cEYp0YA(Di@-5rL3Y);{v08Qf$n0F6a-N
z*AY9D3l17R+v2EP5H*_X9-oc+F?=NDlob~yT!~XYW6gz6N3SeBXUm0eM*~Vz=5wJm
zwrz1ba6x+mcX-wUF05ofVC5|0LYtA3%9X`jNN9;$UATk`Iqfk`B}=)Gss{lKXD+zV
znRBa_bAkJD1oid`)c(ZD-t{ZFkTGFINrO8V3hz9$c<RB0mhQFhUwU$Zx9@4i+cjKp
zU87g`aV;0N`+NNUx}FQh@xktW8_;-MI@tMZBNtwzhG+8pxG>9gORRJY7tBkX(uQy2
z!m`w<?W1>~`@$OOq_vX^as>n5CIoR|Z)RJG;chP6Du0n@z8Cf5{p*HVAzYZt?H@Zo
zj0?h_6OtE4aN)+at>Chc3oNbYV>}OV;r1AB9p5M}c%2`)d^;WW=g{|Sdt<oJUH8lC
zKrHH)jm57cN4fCi!^JlV$GGq|X?b7TaV}&#%{9+EiTvKp=_RMRuw~<$+0|#ba4-Fw
z<lb2>q#VA$dX~h69!37xwiGn3;|jNZOXWgG*3GWLbS^ACG2yHz6ZQA;w;hVvTo`cC
z+@qPp1%X^qo_;PD9NTUTn|2wE<6Wa9>wGSZEL3xKDByxpY^b&SH7=~Dt#<V-M*VwH
znG|@P3m*-$hVL&$<2qyXm17Jp<bG8QPATVt$E@VQyh<+Es8=MHRda#9XICGy2Hls%
z4}zZG=0b8zjo!yQTnL`9TJqyA7hWo)jS$^K^UwO2{m6%0_;tm&Nc#~wZt?yFW=&i$
z85t*U^Mni2e!8%iKI4Mfw^j}B7wC2HeX{S4mq_=`Y1{XT3*&pn#GGj5!kf1bJu}~O
zp{mSjZE+hHHt)J}vhF?VufoT^=O4Kc6UvV0?BK$XvO(&f&s^AA*)n0+H!f(>FHy&S
z=R(8qjS;3js6P%GeYSmE_+oSWgiAjc_I=vqy>WmG;WHFHLw=!oXjXbC?hm>jjT_t2
z*<2VqN_S%kmkT97d$j8LsNG$Syw^fBPfjwGdc|Duv~O{gNYT7a9#)|~lm{p1YgZb}
z^B_;|o%X!pJh0G<QD3RZgTNN=xm!o@K&bD3a{nkEJX5@;oT$u$StrfzTv6pgOHt2-
zT6G>=+xesLr6v!wp3Uj%9>W7>%aaw-aXhG|mwngL;ep@VzGCx<Jc#^w;L;*J9;lt)
z{=j<@57LHLjM;0zgSMGlQ{t!a;LpS;`y68)_`Vo2soInWzg*Z;o2T-iHGAEbo@qQd
z*J%56$P6ARw50fHTk>GXy*(z>Sv+vL^g?IZ93EtcSI*xumj^k{W~ZZU(D6p-V_@g;
zAWr@Mtx`K4+#LHS<uQ#12DG}IZwq<wCfT%IYR`k|2G)zTm++wT_u#u(OL-tw@yK4`
z%mdbu?dNtZ=Ru6GWyO&dJZQScP{>)ygGC{~;%eP_aQorFoVOl4@V`-}$@1jEeLK5J
zs@^;(k4{-<zK#cb4&8a^=);3kZnrmV@#O(`NRn~PCLXY}mgr`0=7E{@`$e@|d63ZI
zk@{{M4-Q<e(&6slK~}2bGtEFA$UR<q-EtQXM!L}NxbERW1oeg_D3}KuPkq>VDwGFv
zgGP-g3g^L-Zdz+oBoFLWqnms7^I$TsNvIfw^i2~F6FLt*d1ZcB62pU|0@GywSakg*
zulL6tMb~*OH!=Shx=$C+w>BK-!HSU;PTeQbef%`^r(yyR>MUcJrinaQHF0je(>WeM
zg~^|QWF9Qg@^U|Qo(I8hO`l8B(D)xcobw`s2bUY;5`JIc!KK;lMVc3R@bt?e{+vsw
z|39Nc*W~daCFq_0fh#;vqMsFJUFCu2{OiN&3(>r~ONDPmJQ#0kcvbN_4{Q@+Y38Lo
zNLF2==*r;1=f=y@;Bp>VzYQ`<t>nSzHB|>{t9f9&<LJ=N8XlCHeyAK)#{<g>W~Lbv
zU8lwD(iQbQ=q|Nmhur5u|Ax+O=?~F7@R~G=`G^PdwL?FBYvRF(Yw?{UpYq_M!z~TV
z=V)ARq=tGm^T1WfR3W;B2lGRAJ-Ymw2kSL<S3h~fgJ`AcZGYaOc@TNSOy@lh8sd0`
z3qSI}%X8$~9UVNV9Mx}g_A?I-J;`yp^_2$&HPeoN?m}9c#2?Xv^4smH)IKzx6NYbF
z*Uy961>^jW4DjH_sxc`gztH#}kY~U7!vpn>uERq(Jb0deci~hX4}Eq?>P!y-54`2~
zxJHZ6{O(<zT_E8>^Bbz}D+(VH*hWt!L;27aIJL-h7$1}a7T2s&;KS#!k%DL?KJ3hH
z+J0>$A9SYKDZLrZhuc5iydA2_ho}*mZ!OgM@U`r;;#y5UyimWnEp7}S4tuKd8RPhn
zQIcQXq0I+Xhp58Q6Zv4ZEcLOC9v|)v@F#4W#E1JE^0Sf+_>liN&-LCEK2ZHQmcNYo
zaAx(z#d>CZfYvL=mYegzKtoxy-+~Vzc5T^(Gx*RPuM+akk`L32%OVtK^WlTz!(uBd
zKAfH8s^M?VhqYhb3sP+PaOwW*T@UB;VFu?N`oCd5OfBAg+Grsk#^~<rT5ZpVmj`us
z#W|pU4q0td<;aK8pA6M|ocN%-EWuoRIUkIp)54uspm8Z#^5?)xJ~*gnWtX_4^L1Q2
z(BZ*{t!}H1t9zmG%C3E6@688q=?AOub$pm!RQsmDhY!y`uDkl)7ajkizCgu~4=%O8
z+ZS%(!_oFZyD)z~*lfT1vS2$OVlQqx{~>@6Z)$r_ss-_3n82B_csIKKq%$M-?M3~4
zRC~50gb%?lUpapX<3sM?``P0nQG34cT$k_X!+{OYGGh*+`)JM_Ulq-V<--{b{fGGQ
zdg`?+2C-;--xpP^If}-^tCpK^j1NOPK5Tz@oDb_6TBF4$`EWyHTPHPv4=WeG>)MgX
z2NpeW;-zzZC{Z&#@-CSVzvrmxs-^PbG}XA<F`W<PPJ6%5Gx_lA4qK%<3ytra^1xpg
z`B3+&LS&lDhlOHM?WW6o^!JOCB^mjAxcOy!^Q!_rJT*_7qFlrW>q^~gOG@|<*(lj~
z=msD56wY_5DdWS&oKJr2n|$bDcb81B<b%@S`l&mr`Jnf9;k&#V<a08rKHcU6Jvp#Z
zo5=@Xam~op_2@oCoQO`mkIv`XVfgeRA0{=|2^Aap;BP-we(__}f3~UJp{MA4Gw&4K
zeva<fq5%g%Gat;t>$I$1@!_KO%rPOYXngiLJC?rX!-KDCML*m4AiQ#Hf%ykMB&pm~
z-0_JIivv@KT<zq;L=_wJt}lEzWq;wAVHY2^tbaJhubU681=X!Ny?ofUZ~vo?AAHc)
zSN)+kz=t_M_Al7*iw~P-+<TPuhYw|Ty@x)s`H;Mwy;GORhj(&4@je1R6!|v3%@Xn9
zLQDFZPZB<)-`F@xe~18nJ5T=QD<=SVL5ISnVFGAUz2y2uK>!V3w?8%<A%O8u=0$8B
zC4l}3dY)I61@LN`*0x?%0n~aJTr<}Y0K0Fw{w^&6%y3L=C><++{q;&YtnmVHWaJiE
zO%Q;8a6s=qT>*?(x5c|oUjX+XCX0p`2;k`GA<c`Y2q5?PwKws`0(hR9ruxiO029tV
z->+^ifT6Efj`y?>fX6Mvo{Sj+aLQiR*I_Au$d0FaMzaO*uC3^3fRzC1`}*}ttpzZ!
zJGqZzD}abc`91UO1n}0?RQoVZ06(_r9&B7FfM2^#sH-j(z~KiWZL60E;8NqqR~MEF
zp!ogMA>W(@uyupOMspVd43;hX6YMI0Cv(45*0>3v!%g$LoQDAR_<elq>?wdLPnXP2
zS|b33KdbJ)Un_uvb4MJV;v;}nLw4>9@)bZ;X;e<-CIMKLI0z|Q1aN2Vqc|sjbUr=B
zB}v-_kho!l^~V4KWFKl-ZxSScML+z@_wGjHKl};Y-YWn_D|xX(r~v)krrGZnE&$X0
zLshdPQNMhexAg26fQsPA&sk9dxKeIdNT&<HMp&BqBt`%?W?9}EcSHcopA;x>i4#DL
z`NWjccmWK*d&X6ALI7zjMLXxy0<fnZ_enj2`qwkA?Auv%9fzyuQj<}8fxCax&kG=E
z%)(F4($IbHvy@KA6u{jzOWXpo1km;3@Z0K(Xq@i+NL0*4_b=&al;>pu^xpBvx{@z|
zj8dOp>;iP(+AfDLE<)p8Fnwlni2&lxQgpxF5WtpU6YXX*1aKfEKJiGo0QB9Q#<f-o
zV3gYCmqxb)u->r!PI#>V&PW*@kLu8IWB$z2zKi%Fvo_$K0OmB7hu?mH#?58nR+UF+
zzI|~xwy{Y7m7<0Zj3;QGsWojK{#*d9=T{o6X%>KJxSvK*3p%cKsFn0J8s~$vPrJPp
zz~T_;xGQbwzEHQk;lD@yo)yrz{1dvbgIWVQov1$@+Z{Py1mGJL@Y<<M0I7@hQnI@R
zaOy_<aaOMY_Ssx7TiP!GsZWw}_J9EN(&uNfehGlK?fOP1mH?(X{PeoW5rAf?<S>UP
zfFnlVJ}(mrAjI%WXs#IDFH?tk0;vF!7>#pQ4i&<sg|oL@l@~&n$EgPCa3MGbwyyV7
z5`u=3mdW*zLf{oFH&Rd*!tmx;uMMg~sFK#zRjQ-?D=BMKwS@3|zl-tqu|gR4tjM%}
zybvDF)c4hyAOw4};-(N?A#Aku+Wt&m2rGN0%rh|%!nG>xMKM!^5MW^&_1;(rzn-7y
zpJOHjih){UqPY<2i=S`%VIhQjoW~(cW(t8FJEHs&Rfs+}IKfmhTL}55eP6Dbi}u$(
zbiLe02(}|QOttw!pmpCH9t1*IKYxJUv_J@p&K;O;Y%hdiA-mOM9fY92<GE?4qY(B`
zvO?{gg<x0T!OmDNgc-J(h5Qw$f81B+Jl%va{%}HR`6?l-4R|4^=_v${`I*P}u0iKL
z%3a*NRtRfecg>#RBZSt<AnycUA^fa8$N0Gk>0s{#E?b0PwzEO5#9s*Avp)$&?+`-x
z#w$iaJB5%FJt^*4kPuQPc}$qTM+iM{7k4ED3nAHx_jNE-2*T&P$GJra;nS>}bjCg*
z?BqY3sC7^XmZil5VbMY`8r;cwdq@a*PD+-xu_*V5yL92G5H4TtTSAE!qJM{NCi|Tb
zf@Ejp%!j9huuZin)btGM*UC3PPo5RR_D9mp!6Y>PBhBcm&I{o<!#lMq4ULyq%C`xb
zLU@0+)BjMG5KKihy{?NwXqr|%(m5CHf7fN&jmv2K+=j<$T@^xS<X4sbg+dths{cht
zkr0eUMhy<vg`jsj>32~n8h0aGca57uShi8GC$d5aUhfy*?5Gk#-z>(>B{f1ARNUEH
za$5*BoDh#OOmrVFyksA&N7tPm|M=T|)Q^O$*5wUC_@*;vY(*oQkDpj4b)N{~?mn0s
z_e=<Z34(EhFNDxiXEuFJix4^rU+t@ZErjoEk#Oo;*?hiQmfVKMZB~1h^gZf#P&#w_
zCn0zz^^SejDTF!BFY@fZ3SqC6tA9Zky8n`(4Vpbd5ZTW>72PL<hSH3|-hLtc=q-z1
zJ&4BR{C=<c-$J;uUa-!BErdVcsOQtULXdxJuAm?gg7y2JqF|8_+%t9^>yQY6URR&C
ze256#2flaQk`qD0n=k84hKpeS<Qml!MG?>=_wwaNis0@s<#BsQiy&2aZfA#z2!=-~
za9z|z5K<dhd0SHiH~bzKn~xR2Z~ZB48RJFpE+=~4$O$3{O8WF_pRNcd<S)(b)fYkC
zvHE;(0}-6*cKO^iMFdu1f81<MMDU>VCjXk52(GuEZ=Enr1TQsndQMFjL73fZOX*Az
zEFEE8wtJQcHkmd1f1V=(+R97rtE@%vcxGwnLt7EJMh|^9*G>fS{pstj(L|6uBYKkV
zA`ys1j0uU0QU4U|T;v@^pfr4PMYxj)9u;q1)wfIpW6MXFZdf6L<1fd}YFUZ;dHY=G
zl2sy@VNUO_SuKLIZ$4+tSR;ana3=loS`kFwpO~rbBZ87}X@7z*x_+k}VZ;1HP{7$V
zd;b;@oSO5~?3cd?p4?aU^xq+Z@O96tKkP*3t+sGqwMzusQm6)x_lThL#%I%oAtIRi
zfaYHvCW0+z+}dYEia`6tgrisYi@<tep1*#S2=p%ZN2k(7kXR{xrg~TewR7LCia&zJ
ztvgn2=rIutJvwaI{^RJnUv8MrIw^w8)2U|y6GRZX|E9_JM07vBtGK>NXgq#i6}P2`
zU@iZ+jYpaYB=h}Bo@a=lDSFNtrz{Z!$0*r8xF`ah5uNU|ToE|8-_5PLECSB08)jBl
z(e($Fb(a;2Aid`C2a946oZL2K#I@@p_-^YJXj~=&hUk?--c1p#+k4=hex(R%HoJem
zP%Q$@OrOa*wTPXU(o*Y0@IqwhIOZ-oZ&lB<q<bRx`H}6U{t(RvYnSXZk3_Kd9M??c
zu?TKga{5m_6@mO-*X~g-MBsQ@N&DnWG{4>&9Ul2w1g~|A4Nkm4_i0*=a73F33Y!&1
zo_H?;ueNV1M}87Pr55eQiB1uey6GGp^;HBZz6XL&b&0@4Wm~Fp59+_g7gj<a+CSm<
zF}0s){Dx+%IyWeSV{1A+wf=~}bZgVu^K21Z6L=5P=82%H=lu0dfe5w^Kboi~7J;Rq
z*|kejbYI8Di>3?}!vaSBkpg)!WIR3YFik-W3vI2SR7nianoD=h9wmlF{?a$q%3@G?
zX&7OrCWetcMy~fX#IXPH2w%rB$d7!L|8$%fzUIUmyX%P2@7XOry`3nAw*!x!`RI$m
zp<x~8>tr#c%o*?qm?8%8*dzVFjK!esU~oIaObn8YXZNM%V$fxukdK=#2A^rZ2b3+v
zpghUdJY|*``ip!ub*)fdk}~UxwHU01a!*>!6T_UiqZ2Fb#BfZ<sS6f}VQ7}a_eYDw
z(AQ7bcXJTKV6Ql_-BAqYq4l;~oW)=o*fMcoxft3Qv*$*-iXq$V=W#iAG1xPPj5+Ng
z2Durb@5Xtd{vTfcI@ena&(9<%O<ymD09#tvtqo!T|IIoMo5YaEqwt$Ii^2Pqwu+Cx
z7?M6!tnb~9`YC<)HEgFCf^_2Z<aUW6VO(S8nLT2d@iFV^#1Jv$xT{!Q3q$Ai)q6KL
zQVj0>EsTfz#jx`8%!XA_V#qSF)A&Lc!_@-u`8|il=((Fv56V$7w8#}YCma(4yY%8d
z-4kMXZSV8B_!R2z)$cL$&xj$qVZpkmXT?yKuqSAJvKYep_gD9y7lZ1vE%T$&#X!}Y
zB~ZQ~2I;fDf$VHFPEQhbXI?_%H*D(B`aCfV+fi$@DqjqXdz~m<1!9;R)~+5=B!)!E
zUY`-y(e;Fk`I3nqy76vox;Xu&7+eRE&evCnq3Ug9gGaR({3D`f^wgm1yPN;=K%E%0
zt_q4(@1psjcc4D+o*2?6&Q!I2D2ACSy62xh5`#wcQqN6~#W40+g)8?d>VIUw;gc`K
zK#ABnFsVfhwamJt%GYSTo&AHCzZFBgO2COPZRmQ3KYt(j0cqn@f7K2#Yz%xnHUBf3
zpUr`$cHhLXYI&^h>+fPPdau#EvsVl?5tH`I_lx1MZkbQ!0Gd~gP5Wp4M)NRq_sb_N
zG*9%dZrZ{X!;uGJ<`O=dmwuho&x^$9edfo`8B#Hfi_QAdI79+ka>8?d@)9TvRfrM~
zmq1$kqnz_f5>TIQFP%9`0@X25DNmFokon+%zrUIUY^96#4%L*v;hFC$E{u^tv(JLr
z*5f7cJN{7rD;)_;s>u4ZTUP=~-!F_DJxK!h^kerF7)aoq|7tY{BMB_LJHGF;i3GM<
zwn(C<N<jB++_H%l5-16t_v+RR2|Rb@BzsXMXr0QfM9ypp)aRdSNSZ5w=`%yEsJ0UD
zkq_%^o-cvfX2}nB(<Csw=*<_EMG{Clw{YI|#S+l$YkTJ6C;_9}mot7kN#K*_)k~+B
zqjtnyUo2cDz&z}~;klax<}oa^c6*?HrY#tz<|Tpc3olPE^Ok_hZJ#9f^{8KCgQ@Hd
z5-{2Debo6)5}1+4)VJOuLC=@U?P~Xzz&^hU?!g@r_#=LQOFs}@-|GWa_jXBOlPG;~
z>s|?19-iknB2)tF4{TK}370^CU?OkjJ_)#~Zqw!*kU&K9((v?X2~@0nqzo|<SarF(
z<4ddrMs!~9KNcr}A=(DBEsjf|b<2{<mXi`V*ET66GC_i#d#w!6J1YUhw9#1)k|bcS
zW;$}`c?onVt1#5l(fujBpIn_OfuSN7hHth6yeBe7DqfPnD`QU9^*jlL&Yl?PnUC7>
zofal7kiee%Q*Y%Lp>a4c(c1O81RQb|{_sjA;JbR@d(KS>$d$bt>s%=T=a$DYtZE4~
zy=gMZs+GWj5A8~hcO>w7sJzkdyAr6{>Uc2oz62soN>r9KpmF!N`S7a|&4<Omzhyp=
zKwn3jspE4AtX{{z`lnd}18?2@vR_G{GUA7q^BW21`#g^4zC+hv#A4^Zm%!sAffrmq
zNx)3SmM-p;z=oZhvI@USU~GLi*Ympsf@Zgz9M+5GU7yi<#t#Wx9@(>P<A4N&w{&l)
z{FXqQ{!`03mITr_^9OfwB_LmNwO2=g&OfC?@3BY%@F(xgKB)vcX`*>%L#6P-s?V@Z
zUJ4pR!yS(+NWq{fFW+W_6nbw(F6<j6g(j(BT&9W?67Nr&x?Eifv9rfUN;IY59bG&0
z##kxLdp`NmMr|oHxUFc^m?#CMxl4vW)RV%IVwLEK$x^h=wU|0}iWK$?GdBEajM`s9
zcTF^tLdu)ED*I_tIR5?nI^J|CSYD;fFS3-vTxaDqzO$uJK6Ff}=3JzQOkCV(BZc}%
z6RoKEQh1a-e-f1@g_-#qw|6f@{kWgje_^o{)Xe*e-5sTns<F0E$yo|lZv6awXSo#o
ztgm^7xk@4EYqH`rcPYH>X0X3_pngP+(97_Wg46q~ShuxOsIm<+8sQ^_<*$?F>wTrL
z?(<N+eST87mRTQaxm61L?AjFjwn-s$=!&<w0aCbYVDxoekQDxW*la##j}&wQRZE`-
zqkfOJ*c%@vMbA~$?^+Zog}Crn1>*fu^m}1{{i-M_98ipD*?S1>mtk^mS}Yppo4y0x
zN74A5o9>ktkNO#rF5Ylb3gNj|KItS#q0eKD<V~U!oSQ4xBqd4Vq-Vn~*Yi>sGxgNN
z(dlSBPAk7{%9O(I2d+lPvQfV^*OV^4B!z`_=8<xjrLbDD`QY7rDcrVlz7t)D#_8<E
z`F6!p*touxC%TTtvE$cZO_>x9ZsbkbUoM3*lY#R#RZ_Tlu-!p$OA75*>n(5HmICK@
z!P<RHDL7tExodL|-8ZGvn}rXg(6c?+zV?w66xGT$9(*i?Ax=FtcF$1zzBG4AvlPrP
z)*9EhNTJQc&pNgh-LGfX#~j{CLEUq)rqX+KKjxqK@c5$?q%Tyzp6*1~xuM<I?JGK;
z)!<dF?@}l&T;>0+M+$ig%6=DqNMU>Sq|A*2Qqa7Yq;B*ZwSRx-!(NsYZm>!!uXClK
zmG9dXB9MZ;MVy<BSPEqQzx1EF6aT5c!GHG2=fdaH{uBT6k^i3j+vmw+`~TPfzVH9^
zeaAoj|4;m%jv-!--Y|LV>2u&e@jo9)5~;%f&j0gx^cl6%|7H8Xj-Ml0L;K&h|Lb`4
z`MYTBHluAB+HBBfhBjTasiRF1Z4}u?zI3PBiC1i#L#fQS3rqPhhw`V-?%p-p97+cI
zrLp^s3QBxNUHYrEa*FT5x?0-x3d#h=?X&Fuiob`Gb48%`cBAb$+K!>^DB5Dt7K1if
zU;g<@wVnU2F=-CvM%{ebXVz0_A8)Tc6#K6>z2a^kkJ?m0c`^HTLTF0`WkzLf=fcPT
zIv2ePD9lRK9@=OX==*Y@&}-56Xk*r(@6kp<8}k<O&_+QUy&8RwHYPe&cKqKjI@7lI
z#*jIb4%)m<^Q&_xl*D<)A-`u+c9+h3GFUT*vRhosifyZ)F#BuY%==bBaeY?XvQkh%
zxmZ{0>a1{+qMBWMT76nMg_clj@3W<xqQ9Z`ot$i(pjO)>r<_8U))*(9FQ+i?)Evt?
zT#im#6K?qB=HJu*9haY_bl7TigYk0nA$S4zOK*&e0r``)jH6Fuz`Q7x>V5byELAOK
znApU^$D(^w&aYUQyUUz<zwiiDQBxUbHy;INU>;+WUL17QyD{dp$AP~RouQn14BF4q
zsXsm9A=U5gj8@I#kXUh?@$l7g_~tc&TAzFZa<2K7HF=(dML|EyI<!wg-l05({HIfp
zeu8dklXn`ngluQT>_`Bs@!gE~Gta<Nli}25f-~^#=Lzbodx`LK)k((Q(`R9`*?y|I
z_c<8<;{}6aoCIH24KfB<NuWN|f+4w=3{P5*QZ15Fp!?G!M%0$`a74L+F=&+vdvpw_
z$3~_Bt8r(ULq{5%sawM^t4Ie*vWRMPDg*pHMlnLRWWxOB^NcpT3ozu$Oh(Z7EU@mi
zx3pwu!9s%tRFjw4Aa^F&((T4YNN^ZrlqBT9;v-E|``wqI@{fq2>XwUsPCL&SGdmBc
zKMWXN<1a&f%w9&T<T9)*EubcSy8_)mpHq{b=EIz6V;HR!SJCshJq+)h0yxlnlWKIT
z5GK8wLbcg<4PuHl87bR}(7K*Hs-0Ic<Sgu^&RSXm0ZCJ+5w_Q1#P(vU^7I=JZP;AK
zF(`$r-Uk?#+GX&JN@d(vV?ey4mSxF^o3L!lB`Qn493~Hc!bqZ2z^aAQ8E3^65K_Ih
zY*1JUyPv);yCJLs`3qHym!fJIi|&`V^cL7@lu@1JYT?zlgVa35+t9sY0b`p=9i;iD
z&P*SB2ee0OFl;6<p?NTey3G78?Ah8xeL1%tI1%?PpE%ru^M-9yyVdt$w)+#Rng0W@
zx;n!0Oyol_EG(ynoN9nu*B(*dUU~!~J!@)Rbt7Cd2xb_)Y=TKg=210&Jchl$CDfA&
zPa$?gFyo}*GcXjHSdLrt9LA4-PMziV0^AoRm3726LrTd7hVIpuP&jcNWAI4}WE@GO
zdjEL^Kc8Qt`slR6c*_|#MD}msLTeM%X7^iIewM))bKxB<n8+zhdfWy{9zN76VLME4
za%IF!`v4gOp$wMqM^N#Jp{l2Rg2Aef)Q?X(Ald8()qB`yh?PjG$KeZvEjY#4x&JHJ
zSzV+Kul@#y4}7P3^SVI)XCZZmbvL9&=u_t&=z;9F6zW4}FBpFKP93N4112u3pw3v)
z4>?c5ELGEf!mY0>7`MI-fRlqGV}|7~P%6%+Mxgbblq>fbXV7|_-DBd)qNbqdf!li-
z3-_Vt&rY6WbfD)}rn65nyiNJ&c@QN=*<k^Co~)hv6a5}hMf)6M6#Dsor{nXP>RA%l
z9h=M8?zh8c{k_t<?Yj)^a&)iV9=CTU42nbTmU#KiNAD5Q=>6fJw+h+&C;bkE!d!yi
zzZB_<k=}qdy}vt<9C@<$H<ZiTleLT6N9U0pD{EKQzU(|`f7zkYq>X=jfBvUIg8!<2
zg!Yqt@udHq|2aqh_MxwT)epnRNxq}=qOZTC{P+4;vLj^iUs5P@7s&KK<o)CSC2ffo
z_YMmG5`8=PPyhb%(L&kL6w0H8t25U;ceOqPf9aOJpy#4X#+|=Bnl1V;D>onh((mR8
zvn8(Ocm8rr6=Tz@==<=O3JbP7EV5|5^Orw8H>X^=7issGGyRW$kACX`e;Mv_YuB~1
z!|<1PF3P`A3@C!XJpCX>di%~Z_{+a_s{WE($KUJv%YRJ}lFwN5-$}71`oBp3NB_hB
zzpmQgaFYKeh4#<>G}+jruW0;VMC9Xd|Bd)tvOm6$(GoeV{t^ja8p;3i@4Um5-A6z<
z?XU`Ay%M3kJSJtSgd@x8XLy*D_TQK^6ZE{M?6?T@Jg1D0(es{&lu7R~>5;9N%vUc6
zEzxtPC}y5R&!HmHxp#<OkDg<d9oK-KbCu<m*GZmJKzt4K{H!dGL(kXBaxr@T7LgWy
z4wL=|J->@IeeW?$3M+=>5$L&K*?v;=+_3DpV|$6#3dE%3`D4;&Zz6f)I--3&NiJAP
zn1Y^@mbE`?2`2M3dd^y=Bj=G^--@ttCh<ei^WCz1vN0yDWfI}h37C|5V~J*|5q*6W
z(K{80HXn*f|B0S=NA1uUTuk~t^qjm*+oR{`WmN6Pq<s2J^bPcUKJuA|(ewK<u4y5@
zC3@~(w*P3fE&!3<i`EUubW<JCMb(&;M6@0O`ILz3#NSwmNn4KAImq_6y@<)2nn9?G
z)=waxsga0DA9)g!HY|?#Lt==g93&hPfk~GS#-xl0!epv#Cwc-}XM)<Jn{2?OS$PvW
zqV+4X^Q?6xdXF<EB_6Gdk@YKg0Ve&<Jfc6M^)|?-NG*w;Y(erRro`W6h{;UVBfPIo
z{6A>@kgPoew5~{Y{OVC8KdwM{cPOC%t!I+ubI>{`1bQ%92Zcyu3=p5)i^-hZMHtmd
z{06ixOSZq-TjH-r>$zmQ2(9-*q=*}dzXGijLz0=tBox*VuBybO+$h7OjV{5Y?<^qx
zGqm0f9Y>pak?8XoB$uFdbh7rhoyBCfp!Ii1(ig-NzZ9+8Lz+36PMCt$`^oZA;h418
zy_gh9Aju=QlbpMmFx(fD#$Ss`Ip~SW9O_Q|<1WP4bi$-(qji+1ecH4In9SOFM7zu-
zc_$T<5<Z>y%2SD-Z$!8dtrL~?@6$xWsPULIJuOU1JzAG4yPmD1h(B79=yExd`=WKQ
zD5s1PV$yD*^|La)<2NQ#2d%qBlK#Ah_(#xsU8K<uE5v7`b-uFv##`bCqV>T@Q_Ru2
zVVVB}tt&=kmNXDQ7_CQ^<<@AOvdpK{VA7f@FzLx?{j<#9gw{nP(q|Tud?;E^E%RTY
z_11`#0<;brffk)cv?p4>jWm4*TGx%p9C?cPJ;#V{K<mY2`(H)t$YuHQ1B5{lnDkX4
zn3Q?DF=<oKdUo0Vs@pJ`B0r-0HW0S2#iTs-#H2IbF`4Bnh%Q3w^<~FjUP5&CBBC<@
zlagjjbSkPFfcB%LQ8Aer(+RVu5?(gOq!k-r(kt|czN<s>r(+4*HAvp4f=LmNB)*Cw
z@eSpPwxJO1CPM!oiN+xS)p?MeKMvJ@K%nOi68|o$8zIx3-9!)lMmPo4p+G*(3Du{N
z<-6Yzor>yO$n@Q2qJN-z7&1K$)ya_2;UOj^4As{_nv##|ZXht<p}HJ0j;_R{FG6)Z
zWP0CqOd12#|3I4FpHFC-NAj(xo`}r9oJsVzR6^rqOiBQ%TOw=c`YB8r2h}@4nqr6Q
zpdirVVhCSGVbXO`T@{(XGo0v}V4_FuCfa8wCZ%i}@fEgUGS_b;EMHH26>q{FtBL>6
z4U=xTg6PA}M1NgEw1Yh+t&m2jGN1UN)|m7Uvx#;<b#_qy=%p5f6Q^QQP8bsk3@~Xs
z^of2yfpEomO!_@7l3S}2eM6aO(~*R^3Ybh?d6H*P2*-<m;c-htb&$~cnd4D?Bt%N)
zZ=&@EFzI=y-jXagLv@%C>1C)+lZ>{V#D9S5I?41(RPRZ~kEk9LB6DX8CQXFuM<Go+
zh3ZPlay?XUN~Rg89+ixas7{rPA5r}(L`oQ{YlXm6M)j^_x&YO~LZI8DI$4Oc&SJvo
zLgMS9dRsF84ywl`<3?1cOSZrK1x!jo8Ya^vg^+!g_*n@=FG2OgWc&X<Ms(H@k}r!P
zS`bC@!u>?AjliTSqk3oPIOg3wgkeFLlxYDZ|LRZlh0P>iy^&DOhvd(^i9X?pNq1UB
zIASI7AEP>Pvg<kRMD)rfgk$Up-_tNDdGj&pJ8g)bV?{V*7U5G=2T#^c`ZP@DHZ!8<
z8k1bfkg#2!_$3oD=`q^G_Zo}Iw9q6Ru15H2G-34!Oj@!6(R<`E=_`g1-vZSol$~E0
z)hm>7fQw0QMs*I6rj(=lhY0jER2NZ}N27X)GJh+oqbQ>bs;?-c6{@?4K%0c>F(T4O
zp*oE+pO5M|A~3s9eMdyvYgG49#s{b#q>L4)PNa-iQT<36Gf-VgM0x_MH;G6&g6dGp
z^#0pK2j9YE22>J%%S}w0FRFuy_M@#s^)Y2!gX(6=j`KwIG!dDrFJn?XFA?7>oA}<D
zMEj(X+%JXr+s+Yx*BMM&II0(l+M&=<9Z?yNqxzyUCZoEeGUlLqqzJT<D8kzPnDoaH
zn9TN2OiKS=;!AfCUp)|$W{m2oqT`wKP@Pp-JMNo_-m#JB!#<dl3u`gym0rYe@gV-7
z8}UcG65o6|@s~MaGIuT^`DuHSmo6arYdezjZ3*?PG3gF-Flj+lOv?EgBxg<|d7l}{
z$C{AbehSI=OeXn7J(9neKzxce@h!&^e~TvZQ`Lz7R2h>ZH;QO$C8GBXC%Qn6=r82=
z26P+I03N4O4kpv|7bbc?BwD|V<k=m>*J~%tc}+Ow1>v<OOd9n8Cgt`W;yd0Vy7eZ>
zw_GPar+_d%kNCRTn3VD~Oy=?=qPtI%JT@MaJ~@`KK8pC8BQco@Aw(Akk$ly5La`s=
zRUeXjtifc;t-_?-bRquMr9^Anll-|I@#Cy9>9kpdLJPtwQ%p*@A<<TPg#7V@w>2@*
z&*7L%rxAo2!w5f0f6B(4eocT$*~cby8YG<1NAiJhL_g>t%xotNZ6*1NW=!VPCxl83
zn6#d|L^stE7FS}@&z50QB8xF;8?O>N=VCJFWRctu{r(R1kD`%;Nta6?IXj-PCl-_T
zDVpT1`v{+hVp5uRll)--;r*?c%zGP2{$L%^4W1-_;)Y3oxt!!}jzoW1MEKK=_(E$;
zn$m2-@iQ=)W>X308)4GjCK0`D0@3ubn3QyNOj`M9k~b?7e^8E4RoahV4>JXXtJs*7
z$U(yFK1}ArE|L#+5?|*7CVk0U!q67tUw%f|+K9<id_eSkCeeFqh%T%k`g1AK6N?Gg
zT*aiP<YLlZXJIn6(g{72iJx(Xu;T>rjp8sVyJ9fuRR;;>B8l%Bf=SETg~{ySL1?#?
z_=y_{zpW#_jTd2}JMnv62<@FP(a(W|A{r*sdmiB}D@@7+D$!9EM1L{Gq&rR_{&js!
z+PDdXF=L6}uTJQ#j7e!!B6{vHq6;aQ^a-LLvirt7!^NZw|3i52Cnk;EL-ek1ME7=J
zGPk}b{Q8FYn_Dm`-<}ce-$e4>2ZX!s5}#9xNr|c=THz+i6R#6ayhieCSBSR0MA&!%
zleRXE<Uf;$jyXf}u_p;j;z+*aFwq@Rg!}gqe_R;R<$DNM1!B_J+em(XGog(yCjH}D
zlE-=yJ=GnP+2TTY(23B*0h9K60Vd_}d_qfW;(wk+bkYpMCFYoPp)t{=287%6FlqWa
zn9O%$2$R$aU6o0$JOY#QbQs~OA;fnP_u=;+H9jWu6^rQfK}@>u4@{a#H{q`@#IN~;
zNr`L6WV*j0dU6XU?bkEn-)$m1_mFUFJ;`nBh*rHt_`RI)PASRLiir*`AY5^o&^!l|
zGV%h^y{VY=$4P|6XNZ61BqlBN7$#+HEb$l6i8ebxa*YV0CBY=`*+tkIK>P>(n6#UI
zL|@)O@|3lN@t(wwa>t|xuONDdGvTHsgliXJ(mVi@?rKZ?<yM$XCo196>HlylCe7Ix
zlfK-5=#_eyl+`+f>&6oLX<*U=R4|z#BZ-byz@(j!BTSX{;`iMvLQHx&7nAbv57BQ1
zNZ#8=e93o0jjx2J9VDl{$7FiFC3^2GqEEgcy!r%_{@@Yem;1yYdKZ&oaGUt{)kOQ3
z6Mejt@Om*O?R5d6=rW<<C6X`C!eoZ06F)bF=;voiE<R0s^Anhqb#Wv=d6=*+n)tu>
zW73QwFzIVUNS?Tx_>DV>9<rTi+bx)su#LnoU5`osxrWeuHDQ1o;WZab<_{-AizS$p
zy^Anu6+nEUEzt|-5*<H_=$A8y)|rM$-)f3UDVsuk$t1#Mx+Krg#-#O)A)Kc{cv^+9
zb0pzxMZ)9qnDh<`p_RA?zrQE&F)2N4OxmK~nDnflBp39O-0M5ZE549itAqGq?}`8B
zEhf|YHSsSrW73B_BmUMVOxn|j#GiE!lXBq>(Zg#onY*hnY42|m?O2LQsVK&z8x|7(
z+!aikd@k`rvx)ybgZOJxiT^x_`1XmIl$ui{w>(br!lNWNI85@aXu|R6@3H9LKU#7G
zp?WAL{mdRhl_0`|9VA!vCp_y%sO5`ENn3}>oVW&)p6fw!GdGf#xe(vRndtjVh<33j
zx{ZcO+d3bU`Nx|0F>{EoMkUOdj!CyPC%kV$=sAVteUk|3x|ozPIwUU|OMH7xOy+x4
zqQgd$Ty+HTuMNkfILeXyo3tB`&tVbaWIiUPo=xcY8<Q?SK=S-POr}#e(F0#ep43Tv
zn~#K@ZJ3nfZ-};hMfm;&COz&c$*E05e|kvtse70-TPE>)YYEe<37soQE-u5Q+_;X(
z^eZC%xB^W2)62v^d<m0cn@#v9gZS4{G3i^9F=_f|iQj%2lahLZ_#VeF=^96fetC%S
zY!oKbZ9mC1BZzJd!K9?`!KC>F5gG&#zsDbwd3`hS!#85m!H4*YYcVM;o<v_*Me^+{
zF==yLh%e`iNqM=1Fvp&7&jP}Qc9?VxTcW$HFlp7Zh<|D(;U){>&z*`%Q86L9%Mg=U
zH;M4PF5w;>O!~5Mm=qH&qUF^|-l<G@XC(2n6ftR0!-(%Q6chcylKj1XvWRdPACuY5
z#-u&{jY%&XAWZ#17~Mm1|1M1CiZ4W4cMuwUAXIL{qzGCu>0K?D%$65~cb^j8Xd?N=
z224ugeN0-+UBZw$;``TNGQF#aUQteR`!YhC>%^Z~gh@9kz+~!QAsnAesBsaKrhI{D
zrF2Zn@bg3uO~Ry85{WN8g-Mef|A%q^__3IDN(?4*Xf)xl1B6PEm^9@uOu9xe@yG8b
zT0anzVzPti8UBRUn=xsNHj>=Mhv+qHNxsF4=)E48%xE{FPp=@nundz@ycCmu+X0jL
zY!UH0X+-~-k4aOo#iZ-ZC7dxElj2}W^t$Po%wTh(PncrT@{EYSZ9wuj`b7Vph)Ge_
z!K9guBV3|IeA&<L|I=5ex+lb~IWYZFx3ZlqzpLU8rlI0RzMW&S4qv(lea=L{QDK$=
z)-_7uz&x1tGv7xC>%vC|;FRv-)y)D6tcNZ-1l>N#cS4uyV=Xr+7Se(0?&n5wFUe7u
zvL*H1gPLhL?`Vq$-tHFTPVGrp->NtX;SzoHXGJrtyAl(iLHKUM?QlJ;XU<84+{2j>
z)7dnv$K{>{L+9c3iUy>=DJn_OUs9DdZPs+0*X&P*%B_x?=`~JRr+!ZX%FwB3>6jzd
zquf*B==w*(A-beLbL!II!^NkRT`#S0&N0b=F)FdACsAi%z4lxtSe+Cq<hZWDI$V4K
z9D53sy5#3zZRMX0<J6{o8=XzsciDCk7T(_1ykC7e&RZtrfT!;>myCEDtWBG9KydO%
zn#$-6SbHD21bN}_;$5n}uwHMS3n~8GfM_#vy)*lBp`x%OciJpFoPWHS2LVf8FY9R{
z`+Kaq43@MDZ#TaOoEIxx0mB7aDlMPL^}N1y1-{(yUDZ+QgY)Ns`EWtCL9<wSDb_jq
zSK*76!mnO0H>~YjuEL9(8$O$u8Df3sNCBw)aJYNeNg#WkilRQZ5IC#5H+(%f59hOc
z3sL>a#6hnZ(%%`G*P!E*$;0?$(jUR{BGAkJ7~nC<6YrlXEdmEK6`ubwZ>-0Z7Q^W^
z>F4Kpk^AMpsRV{;j-oG_Ymf6djq7l1c+R$*&10}WdjC3DSQrK;-X!y@z~%;|nN0k2
zMkfI0!m~FZWuW`LiQ_J;t^01kf&M+TtKH=M8yA(r7gv!((4`=phh~(*s!%JpA1#})
z-u<T(MyDwq+I!gn>ov}0aM8R|HDDoW-y*jR8XR;E+^SiF^L{}YTwf6}H-+zyb*38w
zHXb^X^2<#Z>luX%=o&u|D9I!FjUhMTeQuXg?oc_LPh4{omTp*Np>v7!H|)ku@ZY{^
zrOyI#f2$SB;r@a(JLk)h`P1c74gsdC4mdob;^T)@l*9V2={fA7<o*sHT>+!tWCcEY
zPOgvRR{>RFx##W6NdD?p1*qKoyf?am%-0OHO2~Ta=5w%r8*Xp;wo1r|Y$=EmEW-Ln
zT_v>d=4xts`eGfaRRv#yW=6kgAo~vnRKbt^4f-r!Kb*VPS3!=->m`kefmr8`tA<t0
zwgox{&RDkvRl^5y8vSI;My%x?R6|k7kc_@4GCpcLw_w?jF)u!}ZpXRWo?8$fJ~j5t
z)=gLo9^QhP50Yn8&miOTVnPj=k3PLJZR$FlpW9ml`g39uGmN)lZU3kSo<t36yk0y5
z>kkua!ED=hx33e({q+m3g|N@lHw@Uj;=J`yEqq^Q@VcGhg7qBT+c2KCH)up9nQu|S
zw_#=a{_~gRR^hzz(QTmaJXW@-h4k;k#5yS0`&u~9p1i*M_SQi$<>W=ybTU4@4RtUw
zZrzG=6Up^APq+i(h9BcZBZw~8a|g6w?yKtc%W(VK9^Qcw?DyX`Y}|qM$<a($?(9|-
zdz8$VHY+At4{B}xZBGc!bvH5LcxX#fvGzW!{~vo_8VKe4{yUYF7Rp{JT1262p^R=@
zQDn&$CA&h2ib7>Cl)dbvO{<b9F}laTGxmK=rA65yTAZ2Zn&1DN^FQasd4I->KHtw=
z_j+yj{g|)kI&y=GQX9!;`pLco4}DEVf5RS&ehz{Cy&Rw-xt#Ab?z5o(x@AQua+CS6
z_B^b2P`(Js^>{m}-39*jco9lZ+&bcY5c1)-kRlZ4|8MYa;ALX`;p`%GA-C-CF;DQn
z#-1YdE^*Pt2VX7_@*MVJ^yj6;?D12c1do(1MnTryt%vux5!}|I7>!Q{Tt0o#kl@>c
zicy~RsMHrVu;)l-F`7C1@XPOB$QQ}&#fWVKJLPvBtY3RU30kN9(4*bko#;QZy#!6=
zpUdFWze4ap;}RtQ82R7%2L8i+r3C$s+o7~c0rVCBummmpBDuYQ--~F^+gO5XRzC^5
z`w{FDGFO5`W=~ev-vd6rxfG55s;(400_#6~s1zw?O}U?uf_(GDvlJaDsGj_54e>K`
zyA(Y+5m9RL3*uvMRVfNpsXU<-4Dt&TrD&Wym)RtCiJ1TCx-vAM_xQq@&l?Hes#%7_
z7IZmA<w1N*oi0PW*%A9wnTv#cd3+h#p*j^me-Hd|9kmQ?;m&aW_7~zq<Z~HHKBsms
z5kowz;VwrrN$kfKhI$bFS16YwPygbT6`#%#eA=!Y#f+L9-n0gI`;Bt6^<zw0;`+0M
z{6%g#3KLpQ&i?}bc%`o#4S3%D9jOZTP+L-gXk0b21F1el`+qwtP{hnw_{)4~|MEx$
z3M<n!jvNL19P_V0CfgHtD#=6q%s;L`H;<T3EZ+n3#Wz(Tdu+Y6JqX4Z|6PH)xY8$P
z>y3!<GdEWvPRDas0u;bsBy=m0)$yo$>T>YM^z)TSf8AZlX4Rua`<1DcC}=;o!PPjh
z|CzE%RD7sxs%i`PYxQU)BENk9>R>qJ|8@LT==i^`1{X7kH;27d2%S>AAtDR<$#ASf
zU!^Jo2Rz1!^Rg$R3Q1pnvbz2U_|u9vRVdi}mFmUkU?183D%4}Peksolh)2C8)yRj#
z28(BbKiKZ9Mv;2b>;m^8eovcKquBF`H?25<yZct7wNJml`_c#dJN>X4tvppdwy7WV
zYuQkZQg()Z-*X!Dr8QHH-mK-GRHQ(Eap4-2-D(-}LICzVzn}j9r=LD_k(~<uT<=<g
z#vXloI`I|!BQCB6-8}PT@az)sZ=-iLsPu!i<-ih<b9}5pt(!cBQnVmny;)g{ocFX<
z8+ighx~mplh@d)~l|w$6IaZ4vo{yXNw*h~?9#o53mezz^uLS+_J*!1LSAX6cjDUO*
z-&~7?qKr6c72r?YziW|)i~(;+9^}iQO?4=lJIKji73TYXpbn8GO0;#Z!v6H!>(KY{
zO<Y<%Fy7;YI`nMu**pztKEfY<;X2g#{OB2uA&5WKPjx7L2dDD3*U;XNvmVhNCCE}g
zz<P6c)uU5OJ2UT_gZ+n()uZLhWrs5gK))-3>X87pKC$Z|=u6^hJ$lmOuG`BE=Lc%4
zNA~)C%>_3=--l-FQRI)eXTCK;JQ#~Kpl-!0>!U^B{M6TKK*28#etI4Q`E8$T1Ntc>
zdh6W$XTslPZ#AG2F86&6k!r+#_$du&ormUvLn5&MiJ=A*k=mMLI}Q2zJsS;eOwAIo
zY6ANm6r`aC$Fzgg+2B6(RDy;iYh)|ZANvvGaUdGn#eSeM>~Sc;?GDqBZ@_j_(+j}g
zI?&Kb#k%@Nb=dzhFB)=7zqNq<^>w1X`3-viW{EvM7Lbqb+@>Lsy8F`_Vqt{*Q#K7{
ziAK!^TETj^mDAAqjE(le)z=8QV<!#$<^CZpe#oET>EG!6C!(q&<RPBg=4oj2^+u0|
zogiPr(}<c=Z{y+|u#dvlMzr*S8)-7_0MXxScOy#f8tKd$wIO(rZX>cUJ}mQWb0ont
ztQt`!_Zzw59iX4mvyDhM@8Q+m{E#ntgB#IV_I+LY=b-&mLL-v+$tM{n4)$F9tP%0s
zqm6r;K+c03(Qdg@{O^b1{<NW~5q(2lpG>|$`^_I3k>!|*>if5_e$iiz=pa}6iOrti
z4_lTuA+~F&y*VLr#QKCcG@)U;Hx&hoAm8!IG@+`&6Ekm>K>tfLn~;n2mSL(*Aklu>
zv<dzEV7J6#(1_rJPEF{kx(S!7JlLc1QWN?xGEL3je3g(tjch{pYYe~Gw*?UV`rRfp
zc!1wSOdFmL9CDkGXyEp9w(MXZa%B@*d}{ZYUtT!TepPo9qW#=_;1x#@!3Rd0(8su-
z4csZ<FPWrfB*N9SY3F8$HxHg>w6glhDV398uiaalQG=}@ufu6r|C~}YS}<MwgZmxW
z<F!sR%6K#BB<KP9J9E4lMgJ+#Fqnn$x41VWKF{0Pi7nv2t%1#G;kFNlB70%Hptxo<
zwExQ7xiH8#J03S9lZ~8`s}F-eH5W9ac8d*xJ$K;w$fLd)1qFQKS!D_O;2ms6FP%q!
ziJgJ`{$jEjIiFdjM`i>2?PG62`@+wATW<#abPBeh=(pvQo))lQCy5rs-RG*)$^(2#
zr3F3bk<;i|2=RHzpaq?}FgX3VJA%;P0=pLUWbJxvKLYmg_h>;f6bsL&=g|M(wHEZ?
z!+wRK+o11@NiAsou=06@BrT%<=(852nwKa$5D0QB+=3*s%Qf#5fIrtYwjkw+&c7mu
zApVqwThM|l_q~PJ!}`;vTTrfwa=x`V`13-JR{HxoI0S@VfIe;4wW6Fm=lf=@;6CzB
zsugiPdeI;n3-;kxZAIQHGqqYya9%kdZbj`$-K|^v!QKV-t?2G6TcPM|*dND*Runyw
z=0RC=f>{6I&{jloi<Od10(nAmD;iSOcpMrJ`LH{)6|EI=zSvm;@w}GWiq^<)TxR}5
zk?3#SL|+fjqSarG!9T-?TM=z%QOfpduy4_HD^lBkQ8W89ocH5P+t7vVpw)-Nz~45|
z|L)3NUiO?g8_cgI)kc30SB~Fh3h3iBYD1<EuPh0Wg#AStwxKEd^Zbw6U}FB~c5Ntf
z!>{!nU-lEc%A*Yhx2+go)C>MJc&!bs5T=}#jM_`ce<rq}?9!_IBpI+5`?EI0r&H``
zxESs)-0#{@z(swZ0cEiNI$9gDyb{zK`}YRXf8$UaY9BcwceNhQ!_8A|=rdNgT`>&y
z+RWaLER(e!y=FdtY!GZm(<y%`p=~f8|MqrNYrEg};u^@`%gODCr`Rtke62Du{@kH<
zRF-+$wpJ7N|JkY?Ew)y)^=JfpH@ml^5K{71EDZL28`zE%6vf7Po`SxUZ?&T~v6n`N
z@5A^$58Kh-LwhdX-wFCMd)tnTS89m0iaQYV?W}1>f|_NIDyKmoi+kIVT#?cP9aSqr
z-u}HE&C2dy8b*WodqC<yap7jkB}35Ojk^Oal#q-RPy_oZZs|a2(ci^W)`7py?dm|s
zF0{TD@PYkMv^vm^bvtcVbVEM5Xx@RiGHZsO%!B{PxpW{cSwq_EpRnK0mpV|jWGO8>
z(UDkBazqDu6(FX--vjZhliq=JejiwWp$_!_>tzShy>fo_QRaQ`PDuwU%0BI1br|yZ
z{#H6~Q)_jTg7uAj>_B}ge6`U}%!u)?{^~$~UMz^Pn1=B-F6%`7j^<iJ)i7WFx=!TO
zq@BPo48O0?m+C~D!}r{*&{81!5A5wkf}dWg;H?nfrwuw$>#Dgq!L{H&vo@Xd^EIJJ
zRSf*i_gp8+Q@1sG=^H}yXAAB`dxhVuDKCTbDJZTJZL#G1+UyAHS@@_EWiBv}EWHQq
zFTL$VI*Z+;3hqI^ov7|aoqK&g$(V!xJND4$b1FDnSOoWhw$V=X(a+~X)mF%d>hqmQ
z^WUPZ={i_%=Bh5#Wp>!=l&CDR9_~$Dh~~&Ue=i5-_mt~GJ0<G0vk>HuHq9=?L+*Mw
zrV09#G3`QwibuOLYQX=lpXfqTKANunqTsKC7rRip#qZ)DDiHs2VO?m)7LltbZ-agV
zle<vyJ7qh&72u!s&$>`={oK}BC6Eig>q1`wDdX>dz<Mkjy3mMtU0`Y&oJZ*cU1<B!
zFaI9ToF&%ZKi-8%RrfAz_JsE97ImX#DSbZ#FG4(;@OGoLJG<+DMM8cH741f4b)+1F
z7N)-{bfcvYony3kz`wt0btAuf_w-kNg8d1Yccbv{QAbPu!u)E^-KZxiZ7ZMsVq$(r
zpKjznBx^p<4gMW^qZ=uG(eK~*5A^XUwHtkuT-ot4+nQ)!`n(&Zv<wc1s)IdxaW^78
zT()>!J@82yy?>yldF3SNhi#}E?G8KP<@*QL%RAYP;?BRT+Her;zmcs61&ouv@k@aJ
zZRhJj?a`Hb4l$6wq__5<Ulmc;Llhz2WEFc*WwKgS`Ui+_S?wNlXxedLlNk8hPV*kL
z;>R-g%$soE+UDGY)^I#vU$G7RPuQmiX{W7H`?3w%bKmGeC)wMbf3F7pEKKb|38b1y
z?KPl}ADKO9WuHLNp<`g5&UZcZItU&s+!evz)P^1;!?PxD@f*lL_Xm2=l*~UN9WBTo
z!Q(whS?axOM<twBb_;uvOr=2L0zU9Z6`o$?c29NvjR#;q-YvcK_m@!o{}eOxi+nFS
zk(;?#J|EVbzpod)b(#3~xZ9GjM~G=J;xaZEncbj5aHA8wsD5R&yd^vAN9bZNYFsHb
zAlD9jFr*iyL~<OR<^+4)OYB9`)<X+zDj`4HJn2Qv{<=S^{9u0@3VM-fPIk&*3_K6D
z)$}4QzQguA_Jh4{^z@?Ri&nR+w*Y;qj`pIMNbjleDDdC0zr85+iK_4TF?jw-<?KTy
zlBL@PE`fda3-_T0Uc1<YF3`v5&OUT4NblJ&w>Gh#Xw^Q%zD?H1*u$RSGKPI<Zfft2
z=i(5bG@Cy9-@i|ta$f-4>1-czO1OUg3mN=vVPGGUN#+$#_z2IBaj|`9*OrHh+m6F}
z#qakaHGij}0u1)b%ju)PPxADQqm8D-e41r_h$l&hBm4~Lzpk|pjs3XaQ??n#Gy2$v
z#QZjnDes4T)izDv-++O&kORb@>5_i>?@#h#AMSS{#%mGiM^?fw6&5;xKkAA1qs;Ul
z2{E>C|0+}JM^9f<-X*kyefAvaM>ADZO&{w(pHI#EQRS@FcC)L7#CU6+`_YoBXa`a%
z+((1G`|0mP-uuaV4aCRyuzvK{i}&!OWp+e+qvU>cGgUq1>UFU1o2UIq`A((i9|H|S
zE<ou=VJ$yhlSnY$x!Qj81BWHavxEQF_w=I;6!zPuw_(4cqy6;vr8gFF@<Y6P{iTn8
z-$Zmi(1IB61N#8l+NY`T=uZ;CS8@%YlPz9Rsij5)mlYU5J3{O}xqJe-neYJeKQ<IB
z>jmebx7YyszBR#4V<Gr&^3DPDxN<^PP&%3DPf;8|m!6s#>*Rueb)f;2@$k0hq%4d#
zqcwmYtZ#|tWQYCo7z`kZkvrR!5S%wsM+Q*S`WrGik5Y;8w5;j<1umtZk3j@KesTbv
z{x?>p=XZ<X=iLSn_kz<GpGBk)JoMrKa#3^qtq}_HRKEc<VAxk5@LP_MKMxr|^3tY!
zKE==;M-8BG`Focf{eua4eZl~m`)x*hW(@Y~NgqI$CykB?HAEBgkw*iF=0CMLCp(tl
zlUW1w_shP1&l~7X@V|NVzvpjRdiSdy+z;4_29R@?#i5F|afEz%)c|^V@yVy&(=h~J
z)i{7SJfhaWHM~u5-p&D}_)FQl{Q;~`U~m9MEb*N^9t-Oc{5*i#4j8Lg?FRh|jt`*5
zwD4D#Btd`tvjZrn=J1023oswgf<g4R__>(Z9<UD=#~^zAW+YVH7xEd$>Omy@TOfau
z0{dCGW)Ka(qy{v81OJ{C8ARE^V!w;;fj)nT52Dr1cFy(PX~cSmr3X>7Y~JI`lJNv@
zR~kf%wx9U=<2=Z#RR@twTHdtrhV6trUwaU3`MbvLTxJx(9~;oQ_+{}FJ6K=*kwH}0
zrPBNQ)=felWIc#zxibHLYzO~4b8-;fu04EA$p_9WbGJdXRrO}`f)9|-)h-UAg<Cl#
z!)z0Y{^EXv2;Vm!KfD9<$r&<;diy7{Iz1u3Ohyi(V@_;!Ji)d^`?mN&^sD!%byqgz
zuQ#^`k>Gc`0Q>K-|M-W4$dtQkt+gxI>%xmcR2Ow!z=F?`=x_XH5UKe%_I>^h^T}ZP
zer|_yjU0shvZ7)TRe4p8pXr4B{h@vkW$joZdAtVn^{$ORU*7t6>x*DNxB3PVSEKo@
zf@82g=Z}M^uh7$`TrGi^4}GWGqd1<-+Y9-cdwLM%@hu)#x-Ct}-~Sy%CN<s?v_Xic
z9Qu1EZr^4<<LC<cB5>spI++xfYhDWeWXLy!G$hnZ%lGII{nxJ_LOhp#7ItNTy+*bS
zp&Z8@$Hy`tA7)Dqq4}#1pHzQ^eB>=Zgx)DVzhFoPe^Mh4q4n337k<zLeJ#-(Lel*=
zN2t5NKWlY{&<gX(@!4yx#C(xPLugyhy{k1}z}|*OhtS&ltMnR}&r_@IhLGCFUg5jv
zV7x}>A*6h|b+zAhh`-3QLx?7S^fC@QLyV{EJ%qAWM+(&jI}v<Izz|wgxzO373C@qA
z&>{MJVKquxtiXT0qlZv&lfM?9D9B|Khmh#XkGJ@|K>s7@L+GeotD5dnYht|AM?)ws
z=rC#9=aU3C$QnZacc(3R-N655BfIeXmHj3grLVqYe199~*M(_wo;ETP;RIK7@4|6k
zpG{{U3LtowO&6BGd&tjw^$CLe9`3?Eem}XU<9!J(rqPAPpJZwtOZ6jolUx^8u1xBy
z7;=O5Te`67@55^r_+KOVPQEV8fBVHK^(KrrxVQ^1JsSFXy7vMhkDKnqk5rzUOg%qG
z@I#+E@w>-9lA14E3C`ZpiQQDkHDs$`y(N{MSZd7FE5Gp~A@_gViB~P!dU3;z>jc+$
z(ut#anyY+=juCuGawqm)I%Q&~V@L41>z!ER$4;}Ho2LjKcc~MfQ2)IC?EWJJw>jO3
zorU}A4!#K?_|D^<*e`o}(cZPNUy^<&Mr;Ab9J_P~c@yfy#|{>BD%uAV{E>7gc5u!L
zd6jEPaKDY6xa9-&q+*p9!7aGy>zR2%`#dH_aK%NPcwF85lGRe!FaJ~rcJi3|8UEIv
zkk1Tv;BS40o{7sx61=Ci19LjWSpN`nCwNJD2hOW=Jhfx%C4xVD(}DS3OwGSI1Nu*R
z)Pe8Lre*e7!Tzr%cHpnahB<8hTqfFkhIQbLTCQr3Z-RcEd^+&sowB<Mt6;xYr#f)M
zd?l||;Xb0hnPms|Gt7Tlz6|`qP_F|Im3sbZxpSV7>!A*8p1!xGpaS%HNV)^>Iqc82
zMKBEH8#^$^xsd@rwFrV6ad%*2&9bULCsYY;v8V%Azp_?kTVq0S+o^W^;K!@{;&IT2
z>xXtMyz?=?zy3}_eyOb;a~pfS_)3EP+^A^BY{^e#UtRJb<hS$M@y5Gbyl$OvA$ZQ?
zcI>-5bVBVWthXkq9cyIoz96y}?Dye%J6`D@@|x@B8KV7y%k5a_ym01>3iy|ZYdfxz
zSehx91@WY2)sDM@1iAk>!~Pr$+HsKJrJO)dXQF?YT03sDGLye@0s3dlwqwihZz;dU
zLJ4{A=63928s!#V4*s^BuN_Cf<lMep;vga4&EAfcl|F_~|Az5hX4>$h<7}~Gy)ggn
zkv8n=K|Q8%;|9^bt+NdaJI;>mISui_Rnvw;Qct5{*^`9)Af*laUbErJy9E0W$!x=u
z)bXW97D4=1rnTWsPTh$-^PWWeWl?RoS>>usP94}=&%X_K=KbbTaRPsgJ4=_(DMV%K
z1rqK1?b`5;dT!@^$*?~OlQtY$wCI80R)}}6{cZSOnMcgw+OtIaD#bR;BbxNGN)!4E
zZEM4MS}Jk6??CRpwhey_e{IBG1N|$Px8X*Ep65H4f<8C>ZN-!sKfkLpppPrxTd{T0
zC#T%op#Pr!R?N0%A8suK{irmy;+{Z5<L|G*AJU6k>Hd*ay!9Kz%i^3?JX-TU@UbPt
z!|4a~{@*^}!PgKE?QyNRKYQu^i{hX!jgVG+W#OhcHGYW4Y_C=vb8AA$`8&+N$)y$Z
zajg`5p#b)~b*vTFnpK~b3x@S9*K5V4S2YJXvwR4B1fo{lCC(ozL4|n!E8U9ie952n
zy&!(QHnrlip_O{U?cm?Pcv|s5&l;2aQi??Xi;G+Fl+W3&reBb6{!F*vza>W&mDigR
za=(!lth!*=v5yNuUrW1MaMoi*u_|%Ue@sma&doh>ZAr;#qWy-#7F^3+C$?Jz#>;%(
zg4KPp?p!W{_*6-6!H;@tM2`i4erVAxSUI5P&N^%G7stRByl(FW_IJ-EiShoPZ^0be
zo32&90Q<%}w&3qLzsoqsnvlyLX~FtOegwR~0QR6AXu&fY$1{Gc1betEw_wrLV-CY2
z5U;#aEjV-1QM&sv`1jilE%@VwW8!s!;NRA(TJXdAV5jN9Q^fcj3tMpLk8=m25@7t?
z$!6SP81S^|!~sHX`=J>xRdGEawFUf}yS*8g+CMIcy$AX#t8B)2roP(E!+>b-mEVlx
zlBVx-{e%21{j3>Zy*qI3T!0QCA4zS-of^M~ULAz~_ad9IAkQm31AiFb#=jXyc|`xV
zmx1#_<XkiMy)Ek!SOfksWZ#S{R~f8Kl!N@2VcLvM*wlH7bRb`z(r(5*X3H9QJ)DU7
z<o7h=JkBJ~qxE3Fe-h33R;?gyy({F~n)S_i@{@>_fe(zA#MO*nCat;Jze|be@3Np7
zcNaRfuWEqt_D(k8O9j^3wNHY7^L}W;r9UY@>)K#{U)q{*(Ad1({ur=NS!ENB{JuD;
zR2}>?J--QedvU8>ssjJ_eb$6$mPdcCbv7dAvr22iQ~Wy*h+2XE)S~D-?w^)+KiE$+
zpb3AClAcOXgnYE(d=q|fOE%NvtrgLK%ApCzdhK_h{(<oa%$o4O!<q*d3d8)h2b!=<
z(w1~DTi8EExd|`2TX)?{2FA;jYQlBgKO-Ge!9I6{oAAo-?><+1sS)GHuWrIpWf80P
z%t8D`ENa3+VZYl(@*!SBel}vKZ^gq=zTp2spBnL+!KX)eQXoGBbT(ok;ZGg+^Mi=-
z0%{tu#PWp|`gdWz;KD|{OYxsn!a|6@&=-w(jzhNoy8`%k)SX7WQK2ZZeh-Y77~6;g
zYW-JxCPRGP4{pSmt2r}Z2jq*F7aH-OecCxcE_)O6QJosGmCnE8e>#9S9&N;X&M6$3
zi-7ZT_)sIx6JFJkaRK~c4mIND<X1_rrC~p-WgBtemX=^Qc3AKBEsZ#~?cVOYkHFqq
z{Ec`~hNJ4XvxkWJ?3Xs;xMa<qJL^C{L31?R``+?woH+E)_(sEK!>hw$4ncmb?xSH3
zlh(Hidq6*9G&=vcCR}6!?t_9QG)&dJ=l@R!=2Oq5;q|uD<NWh*UY>bK!%x^HvM;8A
zeo_-@IO&^}g3d=6ukJbx&tFN{jkCc&NLOfBb)n1|&N1+ZU2Zh2Gc4cxGYHO07h4*3
z&*9}VVEXfYV;UBx?dcs{0`}?OPs7fV@^)+EAs-6ureT}z5tB2^!JjN7XjoDGV`u}@
zp2_QJ*dq4NUftU;e;*eO_Y0MUTSUTqn-|is(6QlgpApz!>qr9*Qh5C(k^=ibQP+S&
z1&vmkyTJJWUN+#h^Xv8<&xiaIAJ>2fh5p<RPJ{fR;M0J!!nZvw^o4xbVby?b_(Wc8
z2!#9a70m`5T$L_f8xQ$#+qMQ=X+0kFFb?ub$I1qLeX;Z~Y0rMbo}m-<Si!G<*>Dp0
zk6L>@epMWLE>Zy2^QWL5cS~D`sYcim?F-WD@zCx&e^w|u5d3m*Jr3j0OyNj|^=dfR
z<MTh}CaPOueVqFBcqfm`qDUI}Pp@1(wjP$PnX0uX`o9pY$2R-*Buh(yU;A5!`?i@4
ztj~kz4eOyg%=s_fb9Df$Pqm^Bmuw;1JKl06`fqwxhyRGi$%R~k^>Rel;j5>f>=NsO
z^Jmhd4!2oY9XzcI<G;74!@Q#ZHulCrytkk_+@SCLVf$mySIriB|7K3tpdRq=a*jG|
zarOE8>v?b<mVK|q(kEA+O)p2p{N>HH_^_lYukBiBUzb;lI}{wNq9q}Jb)?qf_y)tP
zIVILa`;P&&xcju{t_eqTg8w>Eiy!rT_`+Kc{=#{v79TvOyvxfN^erx1i;FG9efG$m
zCfe^4sKrULmj7N{fc>5LQ-lBL1#<tLKS9XD2WxPH@{!G(uEKiWl-J;ims<O;B{TQ`
zv<5%4uN+T~f%*8OYjFFy$hh+~$j1jgYw#+g*ma`6!T$q~*5J2l5vFl*px+|Z8axpF
z^^M;s*ni>H8a#YgcDH2f5@LR><u&-@?Z@ryVQ~M79IM7|Z%m>kD3HIpTdT3e171;-
z4*5Z<pc=n8t#f$&Z_vMAdNoemP#|1)5$xR=T#Zlczx-YxYBe#wyh}CSFMKOLFUW@A
zHw~&WRoG$hfD!C}W>+=t^<po1Rte{s)w*h|n1BQLzk$B0N!2)tyjdZZ2KUW9AFFW6
zdjZn$VbDirO%)c%+v(RK4Eb}*%PLGh@AVutg1u7Xs&K=Fg~ye`L0{`GRpFCiN{=E>
zK)$|hQ-#0z-5d$Afp`_ws=~K6r0~=XL;Dw!Rah;4^Zn1U;16W(D*VWYD>&ScOzfv_
zrV_6ZI#cQE1Nyh^t;ByXtxorAg7wZ7SK`Q+^7H;nV0{UXDzRc~t-ZJJE~39uL?zx9
zxkI>a6X>_+TqV|=_T46RM2L_FnOEW?Gh6Df)j|G|MwNK;*3x|bH*h}pZ>hv2HZ`v8
z<{*z<R*4_DTsto#5BfPUR)IM+q~Ffo2m7+MRp8|=%awai7!l(a7gXQ~@18pjwh%AD
zcPenHTEM+$?hp?;*DA1!{k2(tJJ1K;=?d&*y_mvw1mbz<a0M<eFfrdd0{J6bsRH|N
zxE!*^8|Dw$P=Rj=x*l5G2;*6?Rp5Oi%N;(sgMTZ3DaXEwaWSb^Ab$wa%5io{ir!o1
zc{QI~jw}BrRo5$kem^Fc<C(ut{U5#3CDz~QUyje55`Sd45%y0#QI0o{rtIDE2lSJD
zs2m@jNPBkmE3D^{Tsf}ddbhUU0G=oBtSQHlD`NjWpM?Im=gaVV-gQ*zo-4%ow?C9&
zasGcYqf5bG9@LcK$nuYFF9X59GGCTq_j3ik>P8SR`SE2qL#ifCd0d9*Uv;?*Z=vk0
zj9diwpB}q194N3f^CyD!Odcr19!K0WHj9BiS4x-RFwYlNmwdop68vR&rJ4kP<3(X&
zyhDFV@q&}GUY@UDzOzH6c)7XT%{d3qUrJ>uR!kq2Tet_}v+_B;y;rD->H<BY|Lo0D
z{Bp8*(LkO)!6kf3@fX+BHF2RZp1n;ezNxdJa`_7`LY}HsiUW^LjB7EUe|n`#u`jQS
zVHXYjN0_%1ZxgCnwx$O3V?S4d8}qGKeB%Xwc|K4=fBrj|kpCI@pYjqcrBGC>r~&y>
zC$j`UD(0-sIS=uY9$SJh{kgJSNdoLK<5hyA28(5?x}d$0bqU^9rgEQ43-t4He+icT
zBf&rY6z<17QYF|+JYD|PeF<Xy-aI9E(aQJnL)YOvdp}!@H|g5n`Fj-ZlllY2n7a1*
z&3DR>FRA6lcw!(+9XT%``pah)W7qvT9i&_m!Joz!<H(ZcC-N7ey_k0~-pJP0_Xg<@
z@(k-@e4tJ_azXhqf{SStV{2_ein%i6k4&jz+@AjDmZJ&eO9kFy{6@0XbDsvpL+M-*
z)_ZtGu{sX&qw!!7PBjU>;WY#PF;Y>4gPg45<ojU0%g>AO$Mi*RPlq8s*4!$>&+?Pr
zul@_qPkBB?_-N6s>p5>siS?M<7GZ~K^4`-Wu)crVML1>J#!R~&^pUZ%2(LaVvsic;
z*u#jw2;cm-w&y^&8PR{yUn(|EtCOi-3GtQto{C#{F5`621Alg@rsB6<oo1(*@gVw=
zivKPMH+x_P=iB>uD&GD;rGc6P@o?`76~B3+aLKm^{MX5Wif1#vZ@sWsgP2cRmx@ht
zvv|aep#2|NDvnp*{7YfRkdRlcp<?kX++sJqL7qZ?G5Mf;8;4gj<lEtTj1_%1#Vr2-
z`j1b+SpHa{gwFX@ME^t17`HpWUi;e<&POgKjK4>(Z9Z=V{?)b^<8^t1-&ef`|4DCt
zhx4vS#J^bs`P%c&I~*}?ieKwOJ~2G=4x`u2%dbp>zT{Ni;ZrJ)+Qgi}eruP%!(wy6
zD=_&mG5^xeLY#3~*njjAj5nWAhyxaw6b|x%z5bpr#EUG?YNQ{6^^i0Qv3<4FlLKL}
z-sP(c@wi^c9%Dz?-`ai(UUQq%O=Stpw=0u^&D)Q(r`(16lc5g<r&3%lU&sUhxOjkq
zhkdoDt|5r8`vMd!;#i(@iuwD#jt>R+p1>lDi>}aqRZam`^|`g+*6?v+{RROA`1<(+
z+WpgzZ*CbB(DP}#PFy6M2Ol>S;GASbfs(VZKBduoOp|b2w(ZqoqW`Uee9R$vgyy{E
zD8Xk!^Rc6_|3)!I6M|bF$;a<0A^&bwK|IuM&BrG{*$ggb-p4e4zQwq@?vZOD<fC^b
zZ*kh@NbQVsFu!`tTdenCw`jK#%wKK&7Jt$DI_9|x^nG;aTig-w>7v6Oh=;Mid6@0y
zjm5q0px=nvJj}h@CFZO@<WKqJJlwe<>3&|sK4N`+PI-8*&mwvIbFjW}r92#*#{NcJ
z4B}(ol04kUmfK1xhx^aswl{c&`)~A2C+NHS{u_)#&S+hK3G0tN_Xh9CU)R2U9gOFo
z{sxbnER;~+2KGa%-{9xphIf*$!}!7jukq(2qphR2#EA7QeDNC3@px-4(FJ?_xcnM#
z7*P#;umke_u<mPo|8Hd2?nUZE`>u7b@e@7nOf5Ajg7<vM#U~Pu20Es|divkyV(SEp
z#z_H~|3^qJ*4v`9>b$%G(SF`67vJ1bI54*!{C|yDF0O3n_z@~-Ovsg|b8useM~i0<
z_`7Xc4&EiO?7|Uwi0|;5IXF3|GIw(Tthd-M2dj%n4@Iwp{=a2&@R@`|?7lgWA9pXz
z!5SMXx3&&Ld%wn4c>j8igYIg;Y3Z-<q9v7iD~(~j8{J;vV|VvG8ovSe4<GajpE-HA
z!eJTA-^)ptJMx`%ZUTGk>&wQ`Z}Z=q&95WY|1vWhOO2Qo^@oAKZ@Qd~7q7JvVzUJO
zr|M>7UHSf7^isV<dl8{*yh(4dV6hqa^Zl<caY#tQ6uThAuWZ3f%>U53XB!FTFAaN%
zzv!eiMQi~7u(EiGKer2Q(0dO4N!tDrx5hd1n}~z`9?WK8t*uTP6}8~s##LE3{d??u
zUNOwimY9X74xE%G#mf@wp`Ogb4e9;y9zu{0t|(>Uw!eu*2D6~geM__Oht(Dj3gv-s
z&U%51_C4(0bsp?ruKxntmvbyU8>>Z(=kwz^&N;Ur^;pneg71lZj&Yt*VTe1}mu=^B
z{B{LxVsIGpMMr%mPV$qrIob{R5W8k#VYB|Hzbjz>S)6okG=A>nQe9%aXV0JEkWDi7
z+%!3YXX`z~*NRuK+tUv5SM&WTZqoi@V-^nk`yTNWhf$Nv%*8-1wDT!;9SZk}`2yUe
z;R$|rUrpoNqCLcT31^;Q>~G`n_6PXacdjSc-eI3#MiQ)FKkG5(GZ-u2dJXZBZ}1pD
zGYwTb^abvFO5=}kTTfRwR{-RT{OCt`=7_GG#Q?<LA=yXRb5VZwHd%O{_}26g>vl#^
zFC2&Y;?6z9h9<MGO+8`!gS-#%Vz%bkJIwKx<!0c6;$-2%J~(fBOfqmsL!$qx6qrAM
z`T_136IT+BkSF$YH~s;xHto-QrwZ$jQ+j|Cqn0Z=jIJf*H#_fROCgTa{M%suH1GR3
z#`Fz)cdI5L&tG>Rdn>tpoX`jV?xNhoO~+5T_MZd3^7uVGRxo`qaRT<EJAW6C_hE<I
z>2SZjm3|l7xH<pJkAnHXsNKc>YRaXChRprFzk_A$?Wx@zaKFe6x`R`1T)OZq0ou!N
zy@M?ljkM3+h4c7zMLG_laXIQzmJ{pKaZ1NLD{s9yUqUAM*JbJ0VPVg+Bk2|d7csw$
zsS}o04khyvJTfH>-|N2q>ES~dk8dCqk7tL+uirjU$oRhX<>piz!G7(oSPb}w!-*99
zEA|A3O)zkor^$HJZGlaLCpn1mczz^d{kz>%hag#kuaHZ^%i9NJHY|pCSbrfAC+(T{
zXv$L}<R%3PSaf$tXtxA6!EesT<C=d4mcM>05d5n~Jl1?x8<BtM7qOm`A#vD^{`a+)
zTXhKe_u5-{N1Lfq?2t0Sudlv^ecp`^h%kR2q;Gl?ug<e=5Y=G%dvYwMiaNje+_#-*
zPa259Rd$h0`|CvrzFag0FaP)Y_LFJQ{|4u1yw2JzQB@84o4<&{nMV{dJ{SSt{W%g}
zPPIMM)CckX<6H!mP`Lc1X&c1P&wn?t!^4CBymo9L#$Oh89lLDwUKo50+8gkN;nBiJ
zt>^D367ur&5M1BBJ94CV7r{?SUc<o;HPII}u%}&KFqWEXpLfz-L&%*qgYfPbTUP2F
z2mif83&4U(r@pS{2mNwb`r~V}Whq^)Dn$Ez&Ayn^JZr$OP?X?_-!9=*558yl3=0uF
zg54W?cw8e5c5fy4N0AHo+2C8=>HA59{;ibHWA%$)U&gJ4`1LV$$1B|zlcohX6YbBx
zKZR`tB)IjwR}frb-3i>t+w{IM7{*6NHrQDBiH))sCm|OSG{YBPnCx@jwt(Of{90IO
z?yLNnm6ODL3?Ka8e*SR*{SPi=O8<lZRZoIM+9mh<u?qhfdQ+E|w9O`&Y~y!fZ<6E~
zvRr!9C@{*M671_b!lyBYT&pgu5xN&eIUmf|oMk?S9CAGF51k7q_f7Y1b8#C(Tgfkn
z`lD}9Dw90~_gx!9^Fi4<@2=XA11HO?_oj`ZT{bd;7qz3wT%oh4j^vJ^Wi~wrcVr}x
zXSB{r#MF)<cl{y$o()mtyN%7V-`<a*!#-tV0((@+>ze<)aQr=nd<ykSN0VJBhDW(+
z3wXxS?qto~tIFaiwKAuuh4lBpRy;WMiZ|DgG9dN%d6N1#N>dn5!aHLrh7k`c6X@@!
z<#_u2t+Q$X*~joQIq&Q^@(62xs}|)?`4WCZX*O&exp2idZeA5l@u)fT^(g)QyTd0B
z_~;&uAh#T23mTxm$9Ku}j$K!c5-CsKo|L)PGLFdhcS)`b(#Y#O|7<cC9Y@#S_$*B5
zkEXQUunkdWpFlT*4*Gjkgp=cXE=L~_o<O4yZr;4|IDo8V>*4CHG=a`8u6TVVE0K&c
zvi0i?C(!+=sdpwtVdUORLk{~~CQ#>R)kL|%0J6W`&%yqn33PcSy0J$$i89zH{4+Ie
z0-11Uz8K-YN{;I6qWR`cpnGeT+Ip6$QI;<n&IoRrKrL$B###%b$fi5@K7K)ePj=wu
z)_q*n?qt3<GRyw4Pom)fnI`9{t7MrD-9K&{C($J~!H7>OVdQy!`|PFUN%X*6A!wsm
zEP4EPj8&QGBog1RckKJI>y(<udlVnKPolvu>iEl^IErJ(;?vJ>Od<+fB02n48fE78
z2l?)YlW6FtO`F272j#;fo)Rhg`_xOeSt|aTPor#-=hn^Wn?wa^W2-s3!pK5?&)D|O
zO`^$J)7j0mc*^!2GaHxjPoax3(n3y?$0_lT3_5?xOrZoXtM|PX{uHTD8|$U?_tQ7{
z{b2J>)+U>g){m+=Pa)4R`$nCcDP$VCDEIEwDKusq_4;1XIdWff``Gq-Q^@pP<D_j(
zB3W#^LTeYELPP4`Uc_r$Ca<Lbp?Y@D6q38>OzHlXKz=Bh>X}Wi6Y$>5youx0O^Ui>
z!`&|apXhsRp;NGDBqcyU)l@?MCwfMHx&EEEAB8K%viiQ^Pn7gw^he6ca7ve0u7cJX
zx;%FM0?C3z^52U17Vhw$=+pY7ql32s$lHvydzU<=%eD3|)|HJTzu9jdwzcXfx_i~h
zf1M7Qti3Ul@64y4^uPD_lb+2;CUf+7z8zdVjkNkqlhub}DZwUtvaW2IMsYc+SBe5-
zDIz7c^7}QWk!)zH2U+_DMRb!%fRgPrk`pq&#_>9ta_+Hii;4d<vfn$S`CQ4GT&L{o
zn3g_`Ozg9H<a?7TxNErwH+34VSU!KkH1sTG=UNAHcK<Yb5<)(?=bZ~B=%(T9<@sqe
z&3RRniyT5ZZ}n}&LwE)ydWT%qa`mU2_kW<Bgl3R(tHY_zM^Tij6Y8d4t!7a3X&E!~
zEm0I?*{AR1H-jYk7cR?lOdwxd@bw(;9eVwrM7Hl2_<|_1MbZmKi)K*kA^t{P?%QNr
zy#|HJp&4|=i!Xnnr5l-h?OtOswqIy_{At^(mtrV9^}30nqQ6kPEMLod-Be0u#peBM
zwSJ-Bb!zv5+CnI!F`CJpCx4;*>6YYQ<+mw`j$xe@VZYFx+)I<iHxtR->D$#mJo|;V
z>RdG){~SlYp_$7s+wcoLdH-4Vc&i&l;R0Xc^YLHkRQ&t9Jhj2(^7-iHM|o$_X3--%
zyxLMJAIj>o6cuMt!IfP93ab+ouEUiznijKY_t=BDOFEtu1HHc60hebHEqL9fqk^fF
z{3X?H<LR?V_G5i?;kjr^)Y!d%=+asAZo)ll|D{Xh&70q^u^X91uDTyDR&TjTcKBfF
z<G5lD$+ikv9x#uk$VnaimMlGoo+|WQJ|-PUwiMl)y~tz^4XTBAyY5V-9C;<pljb#t
z%I(Ukuhb-y@n0_!m$W$~^LK``YA%ZGP5<uOrDP7#PJODDkBOvYHd`d#9+^Y_wU+XA
zcjC#8ufw-3;rxxZ4EyQ+>`SKn=F`u+EB6~MX%CV<?q^HcWBwuhtod*B{&appzk3Qr
z>-g^pPv75Y&okpI`bRt{2ifmPGwRpx*k;Vx{3nglRHPHds3#wkCgn|22_SQ9Xg|uR
z?|wGL1y%n|qof=T?q$?l@6|R4by($3_NL8SG3uW$D-Rq{+?Pz&X*Aoxs7L;ctUZ4y
zB!-;(iTx&{KDg#FKW)l0cd}E|j~+(7?(PGh8*3JMkmpJ)O&ImF&!z?#DR+cZE`=^R
z$f#$X;_aoONJ*hggsxo5s4smXIMv-pJC$<n{_h?}y=QjCqwNbv1IP)1Rs4+l%Om}x
z*NZkpQ-Wo?7cuG~%jTYTB5h6~Tjwm8WYi}v796{1))hmxO7@W>>ILfv>eoGprfj?O
zlb2DyH;&iaU+i@}Wg1=o#HgnmS^L;8G%b)Es9W)yQQvkjd`0!9));bE)cw1Rdb6?O
zDFT~Q(kSC6BBU7gUvFft&Y6r&p@>=7d}q{S&3b+R>QqH4IX>S-kx?I2BVr|fa3_|m
zy3h3}qh4v)oertN=0q~@yOc~u{ZNiw>@@CzR7yuwnm?nS=Z4q^lSbOt$m8yj5{&wq
zpS&F6&VRKf!%bieGm-JWG{%n~@$dg~F980Zf5&{8awf9sTe0d}5oN6y{=lkl#j0<`
z$Rn)!R;>C~3_oDiw_??|V)y~8z7?y!72yZ0`c_b<idEkV>L{`5TM>F7vFck9b&6Q^
ztyuM~h;xEf-wNtUvFck9b(&c9tyuM~7<qwJ--=b=is1*W`c}<QM~PM6iqHdzRo@Eg
zCb8;U5qhAq>RUm5BvySZs1L=eZv}OVSoN(y53KrDgdY4@^{t?O605!y=z&$=idEl=
zRo{wL--=b=%5E>?_f4$&R;>C~tol~0`c|y^R;>C~jPrn1--=b=idEl=Ro{wL-|8B1
zKW5dpV%4`|)wg2Rw_??|I#1+7R(&g0eJfUdD^`6gR(&hThphTmtol~0`c|y^R;>C~
zI>h~uRo{wL--=b=idEl=Ro^P?9pn2HR(&g0eJfUdD^`6gR(&gYe>AJU6|24#tG*Sh
zz7?y!)oJ2>$f|F}s&B=rZ^f!_#j0<0p2&x+`c|y^R;>C~tol~0`c_a+iB;c<Ro{wL
z--=b=idEl=Ro{y7eG;p_6|24#!w*QT`c|y^R;>C~tol~0`c|y^R;>C~tol~}v!0b7
zaX<K<9O!@jOT34iL|sC>f0;zuK)ipLL{%Fl-akuq|3)Aw6W%-NH$l8_kS+)GOC;Vm
zN21OW@7E&v*#N52;QdO}eSm&NA7MOoK)<RF1XncyBz+u)d3>123#j_?J$!x`&~JJO
z`lT`P03c~*kocVX5Ri0~iK_wqss^B65Fkm7iKPGFe<_6iAHwMi3Nny;_wMt@6Uizh
z(l7m!4zE!bdK^9xB&|ZCat5^DprR!Ub5@sW>{20FN7-vr%g{*$t1B&K;wq#8iAB;4
z)yOd#_sJ>lp!2x*nv@2lWb7zD`$|iNl+_gVK%)s+wtOD(NT!cZ6TH)s)Pgc<7oJnB
z+owWW^&>`Xs15Coy280dUq*#w;FQ+5t`nUopB~;@aERW1ub6{&H?k2<<2aamkluc?
zNaBfJ#O5&)XD}+LLUKEwChy&kM4~(W-CXH%QiB11(ExgIc=gxA0{c}+2@$U9co3Od
zEj~5xtf)d#-6fP7*@cZ0^!0zT?Jp!rvxRMX+<}8S!W%>=2MS55Pd+8qv|$O-!&VCk
zHG19EK+D_HEqMQPou<>1N`)l1++Tc>%~&>O{lJjx%0g0>e)BG;M*JWsT)y0JV<9Qs
z{mK)o23&l&OvIB<rI0jmbp5eEHCQQEoii#(j4s#a$b4LhO)Vzu^Fwv%<Gajf+Lhsw
zO*fY)E<IF8vOd3XQmPoMSQ-?+*OsQQ=X=b}rSI@H-_}2&CaQ%bzjU?OmN(es$qeP!
zcRjk?qQQgm62}Lo@nm17_xB4Z`g`#qmNR-W5vC|lAKzQ%vU)tenYBn~oTNqP|F<8A
z3(^=fE(QQqX@GuIKx!6Keuw#aG?ND~`B^5n1Ed-;Ki33Q-Nlq|W%7N@dDWPx!i-NP
zCdvc)Ni&gNua>cTKXE|SEld<)q7V}W0ZF_}T*br{OkB!DHYWaG^M&|*&UGh{)(_8w
zlfDO3NTie0PLT_!w&J4V&$XI#?j2UX&mV=@Q<EAC8NA76>hD!FGu^rWPZ}eRj_sPw
zyMfGeerHyB$kO?)Z!XHwsC#>fevT*?oqPK5ueyl@j7A@=2tjo2EhG9d4t4XI+H)d$
zT#y!=PAp7BPo>t%Uu~15b6UjtxD>>;ywNfImmZyqw2a!{MqT0|0VS&$?PKC?*WN*G
z3N7u&V(4*0YM=WXa2L6TUw<(0ow5F6eBj$Xbd|)pqvQ)izF8)=Gy%^&{d0UtCf)D<
z4?l_iPHnq|?=3uR#AkSrE`Oc*(dZ_YnOQifX~Bq#rDpD*V(`_>&&NBiF#LGc$|k#L
zjNa=zz8#^*6{)sn-)JN@Ro$<#ds30kzm&;xhvWXr!Yug)0Xjb^{%C0!Zb*?B+xB1=
zosa1X)9X8*`@nTX{(uCXPh<?}1z`aVnfaQ^Ep#r_^VQ8C@7!D_nRQu{&RgPdS6;$C
zoN`eq&ot=#;^|V33t04XooT+^K02SO^*-Q^-99z<ep;$e=S$}UxlZ8ICt75-K9!?$
zRYeDGGrYc9|8M%;opk<x{HSX2%@F>!hKXN!2~MQ|`b99&8c<c1iEMzRHXdmIkcnP^
zemYEC52*Tsn`oz61W1Zyq5~jRfr(22{km2Y?fsrH@d}`-0TVX?lBQM>?MUTJOaP=h
zF;N-NZzU7^xnSIvfU1E^G-09`6K6SL+!`jPGVu%()c~p7OdMWGw5PsiVh9s00R1GH
z_-_TwPh;X;CZ1>FekKYs@yl{(PXSboV4^h>Wtqsv#I|Kbd(}rw^ak`ZS_hw#nJ5ZK
z;$-5?T0&0kXJRFw-%BPY0jdTv@f0A*go%3rsau)I1?cx{4Xl3<P_>$guK-CYObiC3
zo@SycpdVtQIH2lkCe8`Me%=F;YMGb|NKIwpRY1QpOgzFwH9*zvOymJ1{ShF>C4B&-
z)-mxl6K@0hg)q?_P}PEo8cdV~B=IrvA3x~#BNH2#m<Q;0hlycKJO`+HjEVaINjsP*
zz(f)tbp+y<+Q`IwK)-uTyum~dK-J?+{7?M<x6EK5AhHB0=nLD6CUU6IWy(8N37{>F
zwnYIXZaVi{A#bn|O<8eseA>V`7f3P31jW#qsi)V4>b^7TvRX!UNTP<Zf-&pw%5=Hv
z{0RdYdY#<3u>NkwIiPA6E-jDTUJpL6@mFAsSDeSIi1zZS;ExN{81m82zjh<aK`*(9
z;|#fKtVkyrE#0T2vb<lP!4Fv$A`~VsdC~FC8U}ycpr?j>2YPp>Kh>u5f!;}~I@;V}
zl^SNHLFd+4Yh^Uix9j`3_r%ffYovh`&3pUMU!EJ1hJy@lz0;jX3(d7GuX#sf^d}9c
z2WzAA_Xm46cJHS1bcN=h2M|ApqlsfQL+<x#=}8?#duUsE#7l+2%T+sc(UhBVOFlPa
zKI$7EZ9SwWc|0B|(C=p?>;AX-`lzIwE7(qN6P>4PU%q94GS=P|h&w6DXs>!(&k$`9
zKXTvdIpZ8%<z38v7@7Ue3i?&TIQP;weR_8o9pKMAc<eCa{^#em@}d#yb2ktZ{JNgb
zqh{r$jnQkX_SWGq#QG(Ve>O(J>$Vk@iPP_cq^w&ZcT7<G*te%iP7M9gTyxA#(PLq$
zNYPQodQ@iyxy_K@2kGlS_Q})vs+X&3%uxB9N6+E)jQtpNsRkZFPKCSf)cj`Hk96*=
zvN`JhU?)X#SE6%~k_S`f$Tn-aQ11)Ida2~DXBOzWDy>I9nqkiY(Nzvdk?_$i-Pg|T
zrE|Y4TI-J?<f3A}ZUbXK)HuJkV`%Finc8EQztH{1kCq={iJYXjds2Q#(B(9*>HWu%
z<bcGj`Q40jofacEe;nlqtyNZ(XXxK;-Pt!*$Sr82*~EeEbl#z0u4IjJ?@3s{&Sb2g
z_SNgAHRAamz1Y;6G2f#j$z#??XX=Iix4n%09=TkoYlC)=ujDB&W!!5<%m*IXAm3Gf
zv6<=WbZ-59(PCS)-D1&Oi)e=b=j{=<u|@ZuRf~-F((m)6UwaP~+M)`tRpPEc82c6f
zeRho<@;#8?;*!9St3FucX@{h9CZgjNbm`onNwvui*)9>PfA~$6!QY(RVUKofP+oF%
zj-fwo<LEGZ^mkLn;?JE7|519J|Ir?uO*hf0Wn<V+{PnQ91LD-<;CK7Uxc3P9aNTx5
zyC+WBm~Un5*Uza{>Ij}$+P+sUcTXYRKcYuzW_W+ZE}!yUYIH8WZn1|M?mII&O`ZHl
zp|3AgNYD)X`psCF+-KZt1}x+#rdTR8C0cPS<DNm{I%s8zX%Vh|e$5Pdy14ZsQ|xlN
z=ihN-Jvygt^2{*76tSm&ElS1d+%4$(K@+UnI)0P-gMObUMU|$H8e@|ymaccUGwxxk
zuDQ|1_|}0v&t;CW)4BCjmAo-FT=6O@I#-0wNgsPVjIiW3`(wfp48AIR+{XxioM4}}
z%+R6ptgmb$MmU{pzP43Dna-(y1xgO%%UlXS_b+7Jn+$xnpE!)Qs<Ds%Hg!6;ZYM80
zj5m)<H*D`*M&|?Rde04UrnHii$M$V>PTOm3Xo$D+?jCUECDv!){?h<!ZYG%>aA53D
zT0S7b0CNb-L|)rRf8HTQg~yN$aE9JL@wjRRr@HRL`q)=@8JB!1LqFCp?U(4|pFENJ
z`%clHr$_@)frs?4b1H}axhOF@SGBuy>kxj%_Dh2AD&t=0cjaBLE>=JOaI|NFanDPa
z?%u46X|_sDGt-Rusom2qI{3y6X>;Qz#(e2(xU&ypadZ2EMDig<e`CqH131`!JhSB*
zna)Kv>{mU2vjo}KTKr?|hdOdRL>p&Je}D2op0Qt%Kb|x#Y-?QbjoPrA&aD$7__eT0
z(H*QesX*s`$`6k3#|x@MqJ%~_G30gy_xIu4&!?qC<QV!CiKBhf#7nh1R=FS1rgQ3n
z53-tgSyYTUZ#iRqA}eOSHSomL>gku_x{Uq;D@xSy{nH1y&*m`J<CnUDLmhvx^U1O@
zCdOBiHdMoFo*Z&H|7Vi!kEDZY@v8WlhS%-PH4J~Ej@*5R@Pfz%i(_gT_jJ{UBE7vh
zCG(r5cot)R)%gA{GG20cwO#LB#(bpI-_FX|F80sEMXC(_k}mPj?8Y(|y;TRo82zc~
zJFh9>)YwPS*LxZJA(?3jC}I<pEjvXIFye*UWqEHGUU%f~rhYYsy+~PS<>YbGz$UWC
z(-m~?$A7g%7WcLkS*><u_#<_1g1!tE-@qN86oVM;Lk;mx+|_-?Z^IWJ24CXVE{SW7
ze>Qx{$#_m68C;*)hL?D3nK!@2h({9To`4uu9WO6;S;?@UU%=a)Td-|WbKZ{$#(w-H
zYxOtcE1w&<-=8AlWBg6O5I*_Bbd~%ChW$yanz#h;k0jY`_p2Gt5u`02^;hH7Ja5=b
zf+iUHoEs5df|E=WdRG)Mo(o9Nrsk*LRV+Ebyxo}SPygt@|NQ5<k^WRC_xrI5{}_5x
zmzT87CYfyGcVTZ5{W;Zg=~1J=D0fP*uj>e(#u##~y0Av*UKHhgFkf?)`51D@@wh*9
zE}Yyq-Mh`jZ47NCzZ~k1zCo!>_7L26Z4Au^W$V1VYC{g3EU(_1HimZD$OvB4jwW-3
z&Yn7wJBF6o^c>ugkwBi&Ix7)VJBHl#hxmIoM3L_{Hp_l{KZXwbl!*!KQ6;Zy{`bQ1
z_Zadi)GHlLcA*#^<)$s*8ArR5HFvKni=))aoT3(PA4e4rPQBvIHKYtkJ${~~K9159
z#*^^QSc+l9gUSSpam4ZT`&(z#0M_?TtnZyz-#f9scVd0-#QNUp|I6>4M$GKvGD^Jm
zE>UyZud$;I5B9ybZSgHd9o$jdwG49ckKJ?s)OUPDk!1n%g}5G3)7jdWx;#S{^zzR<
z%??B|C&E7Yc9;;qSES#4ec@)Y>c3qu{&T+=!yu?sr{jNqA4&heU((g!b2nWk$^rhr
z{2SrXoS#7-w`y+M?lmU)b=^2}gG%RrcCV$D(J@!*ctbV)^M!BuDGhYa`E-e96CLYx
zE+)0mF|}^vP#YbEL-W^l(%UJ`eAVivbGZSd6TNh-IT`HTk4dU+q{T%8m^5%}gA5*|
zf9~%-8`*_ORJ<(VQ3o9zPIA?>(Xl@J_jC&)k=)<^lW3-+y%E)^k&f(-JFFV$NP2YQ
zPYojZG5S@~aeiBmT^arJr^T64#dMq;S-bol9cgiFZEqOuGh_>1(y^=R=DCM-6uJ6c
zBcAa&@x#+c-TE=hs?a9DsP+=STw$Rqr_Domah2bmb33Ie#wx1vgBw<z(oi{aVyjut
zPc4<`9Uu5PK9URPrzH;j3p-jE#(#h93;Op&rxxdC=PWfV{8n+{p2%X+Lbs1<MGMAF
zR92J9?Uj_33uAKcPNzEVQ`!Hl<CfB}6?1$|l_<_FPis$YEnKw4pqsr#P34x$o!Iv_
z3M!kfy|zq>H!R#YKX7ZE{-MH)*)v+&Ypqm}`Xk|q6AFa__|Pu7#N#U4&qQgko13cK
z^jh!aq+_At8q;jsrMtK=pkRm0M@hp%v#>B34KWjyfk-V4;}6D#J+WtY?KWXNS1^9Y
z(0}faK8Bacd1uFwlC6iUx6%aSW8P~v$#d&w^i3kM?Fz&>zs*>?cgfSAs7~3}F^zui
zU0d+=9PgbO)SbRv{ll|gC~EB9|6uK{<Er@He($XyCL#zJbR!)~$!2XDF;EOt6j2ca
z3#9BVAPORiB8n&?hyscT7B#TxP`V^kFc2x}j<Z~s{_gX7ox|~*=YGC_eBZvW&#c)K
zYhn*GdprWNhf!?B_TUFCBj}#x#g8FN#?YllqYaC<j-$HkkHX^~P5fE@|LNCLI85c#
z{~!9(ZYoaQa>7G?-|y>rQ*r8+kU+a1=~MAv?Socp_6J|eMpN-$?RP%deE0jJy!5H~
zul8*BAC9@~E<{uDU+q69UQ3;wSDZc-|JB|}t!w>Zw{kQU|JA;=;P?8gNuP@UYCp!N
z(=a>l6Pk+uYQNul;`2_2y}DEJU+t9xY&v`0+;penzuLo=Gh{Fo|J8mH{!5>V|7yQY
z(XYSep(L7$|7w4-+*8K1W;2?K|7su8#w!qukDpWVU+t6pV=I3jho|Dd+OOU0MULlF
z@n7w){5da}ivMc=-_3{qj9@DMYy9qi2AGQfYX7I-ou7*TYESa^YmEOR|2dMb^DxL%
z{Kp8ouCe|OkvZ9zH3R$KzbB_^eDRu#{qNtOr7v(8a$|S&YMDL#BsabD&H4%c-|bI-
z9a?meL6ttudLxKEu&!{!mCZ(!rShJ`;@BlaI68Q;^r+H#$|ADZeM8e;tTET5yyq&G
zC}JO+-=442CQZN5X>&#$yE1*!*8Gk!HOD1STKl(mPW$+N9v9WM?O?GU_7-!h$#IJg
zwPus)2_x)hJ;GV8vvnxBMRt7V*lh|_;@WtH>0ui(Us+&Z&`>`6vX2S%<+<I4&Dgse
z6Wg0N8&bN}YumPCH$R<k;hNj4E9k)Vu*F^<n9P%{W=u(PPV(DhH|o%mUA)hTlHB?}
z$^pCTYAur^4W^Xbw^mI@?7hp+oH-S@g7PxnneB=_u-4V0DQq!4f1dQZGuS(y>z`=(
zVMKk)HLbdUU3OF4Pcc<Kig!GF+a>JD$<8G&?;>hsd04&Q@8J`;7YEKp)ZMQ7?KiOV
zuP6!k(bb{spP#C^jlDy%%|>5f8J+R-+=lzu3+i_cSe#OzdoOOw567;Ta{D~{b}ee@
ziwt@c_H8@~%b!Vd(``g&yokk~|7B*mch7Rltop6UOYDEo8*NrL_$6ZB%lUQ9gn==Y
z{n~ku!Y;6+Ml_V6Pw7T^?#jacS#NOHmAwo~&1r5<KK6Y_LIfhrm(i1t&6h34{$`}@
zq?(f!^=R1tas~EZ?zY^q7Ce;GzH7}Nurnh=tJj|}#OIql2A{B>sMu4h`q7vQm0c3@
z6}#|ybI;{hX3!g!KIv}x?ZJ854wQ3HrIKmJo!Bp39P)Orr&D8BY;X5s?`*HLnO|!_
zrQNvRJcQl+wAH)T90s-3eZBew_J>Y>k7wWbmfGVUewM8p_ZM1F{&1rT6;*UOXBPIq
z=gVHtX3U+BJ$7Wve!e<Y>bjZ0x`o*F7}u-E-pW#?W$*kKW9QS)US^(VLRq>jDH6io
zWgBHi4QNoZJ2_@cV8680&s{ITlsfey&_EV@K!RM|iV0cj+|AsRirC+;?vII2LX@ve
z=yNsfZOrcxddqdG1y_WcG_facF_dO-BPy!agqx0ii^x&_#=PYekAfgFz<xu>kQr)3
zr}XYTIAn_5PXDKt>RMCEQnljd8tm~!qdEtVOVA(BOiJE>U6h`3J~>u^UM;)v^A_xz
z?cbT+Y*nDAK8TpM1N$7FxnU13nNUpUXJWgtUmrf!%~fJZU4M2A*<*+PVMskU|Fzu#
zd#uja#0$rjsjhX3&d0H*R{x-_8(v7|zmdP<f}J~>TFx#jPUkq={@@h$>q9p<oo8{=
zKLtA`oX2jjwsYa)Bl=X=bSl#e`${*-fX>@Ol)=-|QXlMV=9hMqzGqODp3fWnu`g5i
zy6aG*K`l7BwfQD?#bfvKPjQJ+&2FU~cd$qM6^~5+%%E5Y7WdxAejxFH^7~4CYMz?f
zKsfe8d)tI+HYw4Q----A!M@_W+3NuvO=?~Jm;PtinYZbgpJlYE52w%e#ACO5ojLM;
znlydLrMvwNc9mkk4u_w{R96J!dkXeBmsO8FauuKgKOU}UVPCFVpM9ZWC1pG0R+58V
zZ{Zx<+%+oH@w~kmh1mDR2l^-mtfc$|)Z$C9@8fMfew!vrNoRcvt;9a)Ag9>CkfYoB
zp7pK8ZshuHa`LV;#k+Fi#3$@`e|VkA5>lbc?;WuIiamtl6KUSKjB0jHW3*t`jrno&
zTJUnp#(SD%2lnai{hQZi^y|*Lp+2Jr``+SBt^VuuDCU+e-v+RUJ18VO#mu2gUw6nD
z#crYca)T+a3Z*jae2><1jm3Cq_%f1Djvltk*<}Xy2MHH#+WobuEt(E%=3svl`|+%x
zh5*IkYAwcvJzA$?Imf5WRHL^heG9Q~y3z9LwPa(eSBz55V(cnrXke8P-k*;11`1&h
zyxF@*a*YVxcKfKUIQHIGjXXhZCe&evukte3$HnVXYps`3wl&3l^4Q&dkB=ox=u_(r
z(^FKi2YU_4Zem|Z*Ry=XT!H=T+a|#X-mz4<$k&EC*oO=2d%_E}D4zN>c7)xN<#bZN
zNSNMvy&}sHyQ_u1qup06inY6+X@>pp_hJ8LDc!Z$6&cfCA7Kd5?cUh;Z@@k~`r>>)
zP918GebTcn*jH>kQkx#9NG14)?6Jna<aD3(CmUlbDE=;=E%t6dGgBoI6Uy$0LY^J=
z`U`n^D;yY<pLw<GLF^&)?PCYCM5()#!IDR@uMe?vRSy=W>)diLb;4dXQ6Kloj-Rf}
z>wL-$yW+`!9~<Rm>47y@#m``ue-w05;^cc>+r4@DOzgK76uqmKQl(n8#gAOXULtY$
zeMz7y6;uC!%NP5-X)ly-t?1M>%hP}1k9~60VBV;=I2C?!w#Cig-eGlPjL(!RJu=jG
z8@qb2UEKSI6_l{hf=l<XU%B}8)FA#lu;And(TCWzE{*xwsj*WxeA3@WVn2V!lRj9a
zL)}o>zBUH?XhesC<zXf2sJ%qfbL=0sv2pFWrB7vt2%dO}ol4f**?nA>I)zNx60ysg
zDKO6o>rmNgj{;J$n;njpD0DKWWG`w6XJFTF6>L<r)~C*ljYs8Rzaux?#*L4^oql7g
zh1dh?yNwF*{*V2>dQvfVpNEHcx?CRBy&LdIuL66;dNIC;CN-+7Xnkf4_WsmIg`W?J
zQsFPPjT*3jh&*=7kaHRRdAMzMBX*rL`kKCcGIaOhT!Zh}<;;WE8ZKK*z2`le{u6ua
z@d_1TJq7BMg_TYxcFCC9&-rfnc);%UvIl$TiHyj$%QDn*-+sA4><v#o=RUt|OwH1Y
z4I9ONa_hZrg9%eAd(SgoS}#66zp(H<WTQwg-r48Pj@|Q;?d<#Y^Qn2Ky$5Gu-_W^k
z_L+voRNWjqdrs^oR^po1rkhawJNzrSv71Uuy_8ZEqxe%f5I^?5{gJB!Ikc%n*W#$9
z*pDi%YT0&Gp4wjByg&r|SKZ>}?V;+_7l{pS64;;fRTh?u>r!ct=Qqe;PrU2dFIQ|p
zwLB6<3fQk&$Gr@7WTU?9xg4f~eMu*CSy?BdvL#GuE3gYW9jK2yxr|a<W@Dp`z2>|{
zU<lu!uHDPxWIA?%A14k=oYSP_rrqT;z@8HP%rNDEG1YF7anuBR%l8!vcFFXmKCU;;
zHOGF6d*^!J99?SYldPZx_Q3;@pKFpA&==oyIKC14{k@-Enq_pUZ^~R*R@i@RdhPh`
zD+j%@jhA-^_DCMbcN?=9)V#5?du_3|&#`6(m#I+e16Rk}VfPks-5@8dMJ@PoZv4RS
z{Ll3+JE<jRN3d(`@!ZH8_$zh6d4T{&>|Z=wYIZbhQ@-MtKDc1tF~T>%;1{L$=<XCg
zg?;vQNB;25EvdpIp?l6@AHG_%&!Jg|y5qGr(gS-?P~d9jJ7X$r#-V0!?6t4=ec}70
zPRT{~OI^YK=~m(R*fSHV)u(&!HSCqtQI5lCDP>k`6Lu4OxWDk^+7dnL_*=dD+t{~G
zo0c%Ql0li9-r&85y<{hE@{M5z#f;g$CJejL!-weUvE|gcX~7<ku$xB?#9nWepqw4n
zy^X?tz;4KAVW<(cgX2u=GwfpOXU>iZ8BqhB;)3zm-}c(RuJz@m3K>RgUSp5aIi&a|
zy<1m_zv)yG_L1{atwz~$l*#3hClvOrUi;d0RJAFNxPXcb?9cDkf8*qpqbogpGM<CI
zEJ-fl7)z4c;!Kw=#IDiim}$A&fNIs<w6+*~`D%9)RWo%;c7BIbId-K(?bqhm8Bua0
zvu;;opY{IcyC?TdsW05oNp;wBZ9Iakb9E`feZ_U3u;=S@cD1mHQOxP5M!sNwaW^g{
zp3<Z43_e@@1H0ks&qIc6E2zTt2UfIUZ!LQAcxgPHvRx9p{ulPY*EhYb&m8K-?#uDO
zb9jL|wMMkYV-PzW9~o54v9#b(>>tp#7cO@UDCT<gxJm3neQJ$<8-{fQ^EI;A`tb7F
zq4383=`#AAhJvb@*iC+o7v`Tgq*ShVG|$C;G^?<%iBF1Z{vJNSg&poEmZ7vhx3cqM
z?|w0R+Ta^OD)3A$_hRe^=FLCK-ylifN@)lQVz;vA66Or1Qw<MvWkj)O`pyqkjGjof
z7pqm4#IE`MmG7{w3Z<pTsVR%S<X!a#TB<VT+g+=xfc-&h@bZZYWy*gALth0ueBW6?
zIkD**Eyv#O`D)qA?IM)T#*fBY*aKzblGhnAs5656Cc4<OW6T$y^;tpnY-%@RU>_)Y
z9kSO#h-&V(H88^7rMzaj>{%1a`-iih8TPe{E*Q(dexEubyG(lxc8`q-mWjCkxksH-
zTaP_ADsYSYd}B(>%2jR?_B~7aEBY5mQtndRVq3A_@4u!gFPxvsoW7oa2lkfLog=et
z^{B@U>T_(dyY4LgBKwAiZuF2E+lxJZ%!}!fqD$rLc6RK?K5ZlCr5ybIH0EyZM+fW<
ze5Ui=U5qH_NYnSnu!kgVlsS}FpPFjolym~ST(jP`ZXQueX}@Wt8+L6CyYeg*I_2A$
zckMLx0@c)PV+9T>EUVA`Ja(@Wm3)$R;?(x{#kQW<PcP|3<4zLvR~=hSFJYH|Rce@X
zz=SHC>#uMHyEJE7?2Z9-s&KZ;f@|1y<x7HxMn`og3g-3R!2W*roq^-dDpaxJmdYUP
zd)SvR-Og=9vG^=s-Njxa-8X)4<7BGS?rAqeu?x*~%amu~?+d@|j)!B{&hWcaCu>R>
zg`QpW7`u)0{u0v*#+14F8krdEF+vBuXD<+^K9!Wwo@0mee+>%X&Qu$ZUB7;L?zJ}z
zioKHk#cS+ejUCOU*mS9T9Iq}WVOKXkT4&VVms)yCXgh_yxP0II({us4_bda&4D3%@
zcXCx!aMFvt#V50|xBs$kux${fH@-_R$;X~Hs`vEafGH&%yY#_(>^~QoJr@fxpwuSS
zkCbAMh-~<N_mC7l^VU3_O6<kl8X*N&dUf*+BWHZTzNoiOQ{l)w%C3H*q#nBvpPU=J
zq%_r{xHR}P_LukEPJd!?Q`K{aY`<a;oqOq6n4}TaViYX%1AD2()0Nr>b*NcU6YZ_o
z|Ni}A3)`~zPVCC%cbs1T)S?t5mpJ!e@2<w@5g(Q4yfq~&2C%0YgngKQ)Rb!Yv36h>
z`^L!FCtnUVr!vI?Uyoy7x54}V*{XSz?z)H*)B5rH&r5q1_sf9t)jXpz1AE1uyoP#{
zrPR{LBJH!VZ}y$PQfu`Js&Tjf<9XO)mxP6yoK>LDQY+ZC0DDw)!_s<lX^Q=0=^|e2
z`A7D2P0RhR>mmENcoBBBQ8wDXw#9U(+Ercx*oOjMcf~lUQL|p9YKdS!A7MEEs(=ZV
zdU~==9J^Urm-F3=>Xb<@PpCBZk+-{6^;qdrQ4NFZ<ghyrheU`qRHaG}Kc7&<?)D_L
z`DfT1`kL9=v8vc-WrkUdl$ug~?}N6lz<$!6Cblg_g08_<z@d$OxWzuZu~&>bbEq_4
z_xJEShCGvdwW(9ASZfA$mgDMEv2IFqxy;?{M%eATrI%3xBGd=@j;E&B(@&=C4>C2P
zgp<}=uExIFEOFJZKvC+G<ki7-*!{|mY`HXwzYi>n2(iSzMQEe<)g$<P;rva#E!dr}
ze!AhTr$#+%vT59geR0FCiYxSi)EgWe7j|M7y?OKb)jVBF`mvAbZtNQ7${O=aj3^Da
z)-*fp#(c*jYJzmAFUrey9KhaJFn4L(abxPyMUx>1>}<c5p1j^5KsQn}ym<_}5Bu1&
zr{xT)wN6Cw1a@@r$<iHPwW$RLA9Gx>$Gtfvc`sXny3BWG=PB$}t*7|woDC_Dnd7}@
zu@}vF7Vp<4M|l+3`dq+nqO$j!ufR&`@VqFYi`c)lnRMRs5v9&BD_&g2p7F_Ze4)`;
z>YA#r27cI2=3NY0x?nn0o>W_L4ZCKkRe>|hn6htpz4s>eGPcW~v(6wYxz)WV2)oh@
zqo?h=wW%)w63n~U;rwk0wf@|jd7;>&eZGr*U86@eSgYN6h`l&$h+9Z)K0UeWws<7=
zbg|QHEvLlkUO_*eMqy8TxS?nwO_;7>CcgX`_6IJgLs>zSQVTRoiNikcLa3Zlq6x*2
zu-1Qx{buB2uh?x$bnpAybKhXM`a1LT?fa6{ofuQ|Wb6q`e66>an@~>O;zbnpyrM4V
z?TbqEql-K6*IIo2B{+IUiK9NXJ?C*rHg?g$iEV+u^r-{)*IVRcFMoRMP00>kx{7gI
z(L3yCleRf4rJGP`wr;CSu*;MtiApWhpgeB&=aplxo-wpu;u0TyE7RVv8hiAL>n1xr
z^(p^?LaG+K(*0Ur&9``aUm&6R@wfAzY2Bb`N*x+J7T1WKuTI$A@Uk2|UnoKP8}<)#
z@zsh}BWk*2>%AY?omXdSykx`k8@-sP4f~5by7lQ#j48%iJ?~EJoWm)bEkrdbuUPBh
zZtUGw;yg-k^(o;4jt>3U%{RK5&brJ?nJr~D3}Fxbw!o5MFH60$y}V`&yBckSbe*vf
z-K)koWfHsBMJ?JMEoI7b>E&f?1J_td%04ENUri~cY-SJ#cE-8z>}(Z7>fSMz>2t8d
z`Nljd@QwWuPVDGa{L+nXrj)<h=9&fAOHS&ka`<r5kDt+J@M6EW>X?p(^&EPrf<n|H
z>{5n5G`&=`sew8^E&=Spi*wPgUx+Feo^%$*o;1@~wD;mlYQVpxRt$TXgG_|~m;sfV
zQBIfoozGrp^-Y<R{%uWKm@M|@jgRkn7^_jQa-L3Cz|QwoBjI9%0oBP0*{h8G-t7-}
zghlZ2vD`mP4STKfCZmuJI>mGCqPPb3yLB6?xfpb6;4+h`jh!_yw(-K?GP=q}=11M%
zdARBQi*fkAUFJn?2KK*yj~0G-J<t%lJbTR3HBtgpu4#Cu3HEE2yP^;N6sEsoPcb#e
zZss!gXoZ*-C3m3y!CLGsp^Aph&e~M#H1@&u*f(9+Y*gwjL}~3_v33*o&viw6bp$l2
zM&9G$R@fJ0UM-Dzvxu(n^wq$2>^Ykx<I`*K{xqJ=+y?uu5vg=j4Nc1b&CYwfv3H&E
zNO){8nEJsutHTcaniEpBDHYQxt@h=52Y!28`HsjzHtOz*mscIIuVAhpvGY`+oMZJG
zj$*%fQeA`6l&7;k)hu(uPUpCpEBQ#A&c5lqs|$8G{_#`mZ?DL7$1Zb{^=x0UJY7d^
zblw^4%vtk`1oz?d)!5Q4=dlMXY<g9tZcMS?eDlBqyHH{q&)#Bjs_<a!kBitpOq1{0
ze^8#9NP4a0gMIT&hKkkel~m81QfEKx<zuG)@s@^^_t&wcYuNe2mtH+t+L<a|s5@~3
zyUms@^2b-3P}xS;^@FfW*bE2XzHUtQeHio%#_stucj>1#c`ARdbIv{N8RMoIF@uY#
zmfbTr!mvvtMqBtsX}a&OXT}lOZMa@FM;%;5cfEYj>oN9pc{S^e#}`rTw)D(s?6G2>
z-Fw#>QlbZCC!b;G^Dlj!<)=*<Nz1Q%f&G!mkDvOr+7xq%iR;VX!@GW(-cqhicgjBb
z;tlrXniu>}4-BWSkIMa-gk8+rp)L9mqP`g`ic{FnCptf~j@6)ig`RI?VYdtJJSlKy
z23;*~)%7gwncf>ye)i9y>`u{gbFpt-yF9?rq$O2%qI{$P`~7z&)pcgv)ZwHIr6TM}
z#k)8+t<t9$az(pKv8Vk~U8H=Pn+huKzgdBO?(UoxYnl|jSwc6b8oTnulAzlU@!t!c
zg!R{A=eM)C_p^<UzNSh->LYg8-{SK>x!jG7*l))v?C$9`r3A$<U-*jsvSMx7Pctn_
zN$b$_=HI!N@sn6{d_TyK!*xHguWstN^ot=)b;Vqt(Sf}@YlmlOlp^InR;Ap9ed*P}
zXI~yG)6KTfxAkIQ|7F}oGu?;^Q_Z_DfW7dX$c^Wc%ji)vouh}b`)P@+SRJfJE#6>M
zI)+{Ov+&v8y9Shzx7NTU_Bx+W;ZapebbgTy0&IiVSWdSd+h4)gf5dP4BM$77_j0e7
ziQ?(o*1cyo_Eb;C=d{gzsVYBDUYv*hljn@<Mq9<G1BtRvxUm1d-^7SMk;jAmLgl-#
zpN3-eqa7nZ_^<~!+_vxVkfW>UiOgJreOO_Cmz|#~<^IS)N)UVY<@kcRt_oCnV55Nu
z_Giu}8ikkTsl%S<c8Oz;boMC{)G(ozeltETh5bj2*VeYLl6ZM*2FYTd;Vn2A7mxp5
zQ(*Z*9=q>HPTo0qe)ZIY3zV>1aJR2WsWzne>*st?#l9kUZSkrP@>IB5)bMibYq(cw
zO5*#(FF$o$poM)r;OaontrZmS+x^ljv41<8!q>J)h0@6NU8#p%`#q1}Nm)U<$Etb@
zeeAIP@=(j;x9v5;egO${Zn%ZNuO8uWHN`&j)gtXx-iVrLZ@OfT-OJg`N+)dr_5MNo
zowe9k*PrsdZK+5(^+`vs#~!JEMP==CL&|AeK;lO1oiSgG$~P&}J9QQEwqTE7PQ19?
zwSr2XH&nR|yXX6^{%$uFYMn-Z(+=#5ekRUz)L23<l$Pw=g}r1h<AUxUb!yD~;_x2q
z&jk42S-)1NwsS3Ex5s{ObwGO7OC|iA{%6jE*jYzW-;>A2RGMrZ|6%O6*li~1QY)!h
zn`em}!(P6x{T$CM0s2_UA!#S<8`@g$os2i84zo{JbiuwLyoih1t3(y=C{}aFo*<d>
zq|^@|e+^4DPh)?jNgvtri<|yTY?kgh>}^g%{2s1L>F&E-(FN>BRfD!ad}Ty6I0zVc
zVPA4kJ>kh#11ceU(C`v=(e2Mhwhge+nVxfveX;AFdmJ-5O_Dmd+sgPV_P|F2f>Fmz
zslcc8M%S^=Dek=K&}T$#DY#>J6Z<VY#}i!vy3{Q3Yx+UhtJhx5f8nG-g$kzY1!FIB
zceUH}8c}H?%U0g|J-k})xNp*2DmkD?;{o;u-a0M}K^^Muhi9tc*kOIEQ@q>r<Rh{3
z3O;Tqzc!ree_BW?3cHzs)sMs<3`#OQPUtE2J4da0t_>OD{&$Y=Id<0{eh$&QMJTTT
zpLy}v+3S){q}hMc9T6{|{t7$i4k5JTDn36p-#YXLduWkOcv_k+)p}U4BMJL28IgwS
znNpNdyKqw~cA4J%+{!>1dY`;)Wjc1n$onVNgc0?^zcDuxdt6`a;>D~L)F;=l#2oCc
z^qS_iV+!;jld$M~?6#GQ%%x=vsOP&HgWq9qae8y*g~2o`N@BN9G4_|cT1Uq0q^QhZ
zarZLp*I($%2|Sgfx2j0nS7N`r;+N-2d_AssrNhP=>>Eqwi7PLaq~|*KpgQbl#+j}a
z{aRG}%2fG}*o9;c+*stxPM_7C&)<k$uKVDXO~R&Bc<<tAU$Of|em2n#*QffzpS6C+
z{<vqx7EX03s%xiLMGN-ifgORoA*z&tXIM%b_8VuAchhuJYQ5vMh)(P$haV(QoH3*{
zyr1}VV}GIbbL-CmI#nog^H?ADgU9Cw@D*xO_d>Ea4PtL^cH=B9;iLMt=xUE(Z#Iw&
z-8o&3s(wBqIF9}OTd}C0Th-wHxuO61`~Tnj0RG?Dh0;^Ek1U;wpXd1V+{lILD|ruy
zb)mn{jl56cR;twOLVuqdiQhEfv};`#`up67kBIL4Is3ZM-{(d&qMYO_Pj{ie&y6(B
zv>%{ubfLe`jV#d?3CWB8ulxQk9{y(B&FVsbpBri4sV%YcLl^q{+(=IJ=UtJ%y3pU}
zM)V|VWL0K%qrcCMypgkcS})v<{ysPIl)Z;HN~0V7eQrca)#B!@b$Iwc&y8eeIc|Dn
z-;Ms>Z^%ly<z0EM8?|2b(;D{eM#?)iw@TmcMlSD;wOL1WBSGJVL&0&~sB#CpS7S;y
zauAfgrJUc5Vv-K1UaIUyGK^O?KN`D{Q0<ub`i^e2wphz6W4Iet`|Y{BlA{MLiE>|&
z#?ym>8qNl+66rx@JSW3H%J=-|KF2w{9-|`0JqSHcuqfWpgItP*9WUDSppR$1>@#-g
zLCZc1EuZh+gD&jtZ~E-jgN~;JxFiSkpr%hE{r5wA&_b><d*7!$=z48k>G{MSq%7d3
zeJ-a5&1L)c_+ohv^5L@+3HscFwkYdG$F=t$hs%_C`S5?;Upb!8*`dbUi&Q_X89Of4
zi_}`9RwgR-qDg+cgju@1NO9z={hn35sQbZ<T{&BN(aOu8!d2~h(Yt6J%_ok%$lOI(
zLi&6!vi~sS$aBA5^o!vrz_{Cs1|NK1UjL*Q^&M_cKmWQHeUDn0rI^)=PBe8GeJ|}r
zfA8yb*&z7&czZ7rWIkgz9_dArVf(YhXZ0aDr9rVd{C&vRWVXzxL?5~xwZ67rwGUM$
zd7%;1hZKEw+s<0oht$fS7>MrZLsm4Q4*f%YNK@^K{So&*RH~ctI^4Stl|R4H)D+l<
zK2_9o$wl;`nzu(<&&K!t=YCS&j75q1#eInL<9KjFLm!%a`r(3NTOWF&aNjjyxDR!z
z8lTsn)sGD9OTz2;`_Zp;sO79wKk~4+zeRp|Kaz<Z==);OkGO8^EPS+~AC)io`SG}I
zKdO^?tzmksAC+W(sh2s|kH+(ESMpr#NAG7&%FMdgkN)1r%62MhlsmZ}y*1h9D_zi!
zZe9t#Zv3GinTf^n9sALb9NQX1BL@1>>;~7QrWpgMZ=k4Ij&A^6+^qBBoa6u+U$#W(
zqxt|6&3eDw#Bcz;y_PzWWI2GO#5a3r?HND=>a+4P90$;e=rxs_FAN~9TcPoN*9ZP{
z|E%63ml4Ys11P<2t_u%q02#YherzZiK*~$^=_Y(0K;Lz?-MR5=0C@#&7(P3R@3&Rz
zvv<b7yWqU5y~Raj5c!t2dV45izYuA57Y(BEcQq?0i$PSd-(XAIu0b^W=+k(~<AVt8
z{A6*EIfw=XpJ^psAN;TTc1v7mpN=0yY8fiiIx+@Pm-pnJL*;{L&$<$g-Y<hFAUnY8
zQtu$*S*o{5hJ6Uta+JlE^A4ef#cP6nq=wL-ev<GSjUg19Ct<SGbO?!AKUmafHH12D
z7=_dx7(yD4RBH=Q4xwOs-`YIiA;h)S{ZVPi(0}e1c3)JTJR@xg`5C?DS1ZBex1VKm
zs1dhw;|qS?J%oG}WJ@Qe52M`4fVtMZ!|020%*HIKVe~zx=!K>x=AB*giDtuy%QF9+
z(e`2V^0@2Wj}F6V{kl&NJkAcIaPd>$)UOSr<e7!XyTgVN=fuXfDG9^>xlg$&arF}C
z>R}`y@pZ}GmSGgyGxMs=$S~UXedlTWc_Sz#(ZA!A@CZ^@G;a@489^WBm@o?rM$k?v
zy#%(+BgoRW&)0na2-^BmWnt*a5wuMyW8=h?5tKfDa<fC|2ueP>LhSpC5p=4zBHbZt
z1Ubv->P%LR{OA7Y$sY0MHKQZQ{>{~8Gv|*YOP{-ki$zD#D4#`QxcVrHU-g#H%VZSk
zZ2NxIY1=50%jsTr^zbM$wHfVkJwJ-Rt&-{SyD^H)IUcIKh#W;C$L_vuOdLh!8LO`g
zzaK?2!+Wz1ejY`$g=?%cd+-D4FZFlJa*X}wzHEhkBejBxW9U@r<gTZTF(f`Z;%>TW
z46QD+QtIA6hSUo#`$U}{L$7~u1Rl9IhU&97STQ2T(824!8bsfYAs7B5N?h;8&`8$K
z&2vAGA?K&o)_lEV=#0-ybH$nC=s>|N`HceOsK<wM)+Oa}RQ<59HQ#XjKlg)IH1BC~
zJv@%?coy(~WsV~k+eycrx5m*$wR*PZ=yAm7sZ)I>Z5-LYn${~;F^;x!2-;Qs7)QH8
zPOIM@8%K-IE^*k;J%N@z?B_L+o<KaE{43R0PM`sF<%iPx3FLZYzohoQ3FNsZZ*;?{
z3B-6?<aYAf#DDHXKU#RkyDw=1b?^6AG%J}v3ob4WkNGx%WVY|_6d0L6a{6xs?{Q6{
z+sO`^@=}w?+3BNMfzBji7$3EET|bG2j4q#4v!6t~Y4>8sPfsErUCHSm0w&Ri>!BAi
zp5S`b4UJ@K5_LOXlh3S}M70uf4z)ig5#0C4MVpHMcjpoR-TUXY4B>O8;=iWi?{g|s
zaq9Lk-@ndJ#i?8VPYL^<e^15#Y0&@eKZhnKNqs8*ZyP~zUO`SuNk(z{RQx|QCDEay
z<q=2l{qIxpU+o(;car<xr{cfbPaoAL_rFiYf3>IYmQ>I=<)%9o|J8n~=Pv%%|L@xW
ze}Dc0`rYK8{`bG~U!PC%|IYo#lWceti3YT(_>Tz~nh66;#eX!X4fAo`{QdmdRQy-_
z=*EYfv+@1&Q}JKz*Zz4PZYut(ebS%%=cnSo+T;B1^K<|CU8~I5<adV{?CgZJRTBfh
zpD$uwA0njH_Yg8<JAm##fbW_h7i%D7o~$NhRh9zP-T`msKt7lbzB8GSmiG!=Ee`UB
z(NJIb2zV(J^6@)_47Zzv%-*X&r^|%2J`c#<&jKgi2w9h%!1<04(jM(6WUj#Hr+EHY
z1v|iPtso!S01R3K_2s67tSWu*le&<LY61&Xq3)~z6qg}nREPn+1qo@oi@@<uUHtxB
zTHHMF!!yAZrV}zd$NGQgjF*Fi%u_w!MjgNfErhhsU%+2{BxHHw^Y-8Kv#kQ^YQ;cK
zd|r?1%+@UM!Zh$_Nrbe3S3vhTsPB#;WUP$@t_&k&$%g=igMbSI2$^&J2pKajL4BGB
zIPENOnmZwr{RAOx&QU@Z_d#$$JIG~s5i&Hl1I;!QvaHvGJFX_A`Ivx5=o2#2b-_Pr
zLO!VmF0KT*=`yGvlO$x_5dmf|g?cX^Awz;2e9Jt@eP;qQrUOUD`^b9Jz~9S$FV7Qw
zgp8NJpx)m~$kJ*Co@;`79{yhUdwA{-P~TYr{tSQb!*$wt0n{yWfR9+f(G=jOw}iA8
z34{#J=Y-6|(NHgb1a;Lg@Y^AfPXvJ<xIxIOxC(WBAE?KBL0y~)3_1<@JU2pymlGjv
z;t1p?4?;d@2XwO~WDHvq(#~2DvZil@x-b5I{Coa*%?X(gjG?ZmPsmEu1z)EHd6POJ
z%}p8V^W~xbL>g!y4*V<xJhz09A;L#U%UnRnvY!WaPW(L{e?03o8|1c=y<~dkjS@1F
z2fz>Y5V8b137I87p?>i@Aw#zb>irGC7ayR0q>_-PfUhUu&tbN|BV;|#gZc@4z2W!#
zYo|k<mO{uVd_%~*l>qfU&%sq=AfNsi>Xi=(Y0>wgem)r7>J}kWC4i7M_bSwXUIx$e
zB4k7{!F|sFkGc~wH#rm1bdM7<qz(fY93W(k?FDb!1+2Fwq!n2aGFcl5S+6a?pRFcj
zM4Ey>Fa!@lgtXw5;CD3txH=&#L>c%%9vCS@$cU97WWEsr&k%sTXc4e}A>?gbgtYOw
zQ0JNjbxC$`9U8dhSP$t34nu^rOMQgQh%TsS;OkPq*I!c$`1J2UsU|{(`A5i)*Mi@v
z0?#M|Z!ZF0TnIGDC8W7#0-vN2vTBoooNo!4hA+WS#St=I;_GO?r=#NuaM>fs?Zdz$
z?}2~61C+T%NOQo~<8V7x+*LxxfDhF5yumMd0L#x2GKEirA9e#zIRQTJIJnJWLR!KB
zsL$L-$lAFZ_<ASQxwZojZGn2OB_UJN0^D;o_%~B<6C*-K3<JnThq{Y4A@k!3a1%A~
zcqO2aJR$9h3~)q(ka0*9yg?9Xv4oJB#Rs`IzV7*ZdA^trzHBZqVkRL=m>u#E8gR*Y
z_wV6p!T9>=@8!8<0Q_DLxX3R;=A$-nxfbw*Z@`sJP|x`YzM&5IsT%5sD+n25CBUoi
zAr~nCf0+X`%LIN(Bc!?F>%PCIXMQ4h^eaN9Q9L1|DHeD>2I|63z|-;dW899hI}GaV
z_X%my!Gx@JLBReSP!GKZZt6$K?70jcdJ*z99^fPRdNm#|Gv+k7wL2kWz6*GUBhd9I
zAx+T%@^AaW@7qDXWjB!92J&M3yGp<3^NJNA(|i+f&IYKzTT96BHwWKf3gkBeHZTZj
zkLZNV!#dy^n!stxfki5WjJt}2tOIi3S~8H&mIT&|LjAcAA=6_i)VD4oWGV3iIk<tJ
zIe|%Y2pP9#f;+MkGA*V-U1@?`w_wc2zeDwV{rnmvWR~^8^^Diu;K7}cpKpV@eG72i
zccA7M$i+SrGUqiweHj1!;`efFu7bR(9GFuAe1m@<>-XnI6#zqW37OZj2x%Ab-$QWD
zJWYY0NG4=CyoLI{SA-1Pc;Jrbz-><<w~8WUZHXkLS%pJ=>jS87zXxs;4Ef$5s2{iq
z^<&ow8E#i0XZiwt@$Z1)>7w280zSMz$asDZn2P`I^Lx7Axf8PLT?lC%PEemb26dhz
zgbbNO;JW+4H`;+8+70e$LrA-CO~`z^73vk6q26T)b<XurS6B=6HRgn@!={k?8$lkg
z4|$ay<ijh0BHDyZ6AePfQFTJvZ57B_ijcR-LB2>9aw93o9mOFJ6M?)Ge)pS2TMBix
zMNr=dzyHm;!wvPK`Ghn!_#JSj_H1xR4#=a~z`w%pfirc+$nTUh;s*#>%eo2i{t#TW
z8S)44d+AJ(ddMGE0j1#g)0s~TVL0_1LK>A0xmhxJ^()Bt#X)@_8tC%~>cS5QX|IC`
zS!)BqTl^vS@*!l3djT`gLEY{oA#0{Hc<fQgHys3y!|${+qii7Gyp52>wuzATY8}+=
zSAj2u-*IP^=t2FGHX)O-95|{3Ok74tbCU$u6afw|0aCn#_<J}Z%X|)S;SAuXN%CF>
z=F<^)Kf|ehpm`TiunqEG-@$Vlf%ocxF4d4*;0JH;_Q8^W51gGx$oQE7UYH7ueM`u^
zkw8d08B5669R*w+LCDewg<LWixG<2A$#xC$ejngZFG9xW^N?4c0+zTC(h845p6dY2
zwkKp|?S?#O2Y8+p<nJvBndNICuQLPxY6$GqgZij8A!GIm;1U%=mYh70E=|a^6azmX
z2+mwYNW05J$au{OdD$$ecd-E%Op^CxFjPl?oBH9s87I4d584P>xy_JwH9=kABO%lD
z1JI=c>XF63>H<R6tQ>GU3*0FMJmwAfmw0fYSm3rOLS|3|A)_jkki~ZwXmtzfA=iP8
zSD-F^iI8^8gOHhc7RYuI>g$~e8KK7rSsjOfdiGEc*bV%?1L`_kfdLz#-ntHGWKM{`
z2Li_!gsknlz+_EAnxH!PIVJF~%LtifQc#Z*C1flX1bQrjdIt}1`+P!L!EA7?8Q?KA
zLZ;vtd9MlU`XIdDgrgUDwv&+2{}cS!cktFmLY934@LLVk?J5Xq-;2Tb7ed~e13Z=i
z^?_7E+POsVnXe!Zhyw~eh5YGbaP4ql!F@u8bui?ef#4q3Az$PNe0~XXQ%~^5bHLN5
zpuX4@{58DKg|+DjaYp|E$Zy*Lb!-WlpR6JGvI3XiNXV*K2Rv&Ilr<q_ROu7aJn29+
zZK!`)4j!liG*uvEj>>??O8^gu5Hdss2wAoKz(5}0`uUL0pF>D1ngP5z4eIO0;r%q+
z!-TBLKJdF;giPCZLWXP$u=^|2Q$7>YF4YsVHr9ZPR}eC~i=m!T2)vmKw9kZmWg7T`
zWZ;k2!1Q>?gW<h7tP{~tw}=EPJS3#ey${}chmiR$5Ey$M>eu}U87`LzY1Up)*Jpyu
zoq>FzJNU#2$bTLKRy#mFXFnn1)n4$(U62P^1AVNZer_Wn^MnQXq1C`Wra)^$LdIr9
z$Xve?>T5L#S?21%Rmy)TPsms;L&#h!0lq<mkhVntxMLA;??OVR0~aC7c`o?*nS_ih
zY`{B{<o!d8$D@SI*MsmrqTF8anqQE&wn2U32XNsx;Ic-@84ZN2tslUhD#86qfl==X
znK}8uuh~$ao<T^HprCG)1it?@xNkf#E|!o{6%8DV1WJZOzBZJQ<#re95kcT3Hy|JP
zhq}TQLfVc?ko$Q8)6PS^=QJTh+MSST?F@Oqai|v@2A_5ieC0kun(J<;$L}O$c5VYI
zYymo00-vrUWVM?El}rg~PKJbxHwfyZE5Qx4z<rj3m#csaC=xR5ml4tuq@X?_23#Wy
zdB{>iMjJm+cOlT93)nOlxMCL2mz|K=NCRq)llM}wt_>5?e)bbG40{Nfp`DPAv_ii1
z2jp+QLeAF+b=L-{*L)ykX;(r0ei<QiS~1k^3kexTxlmu8MM%4!4$hHE$U2@#$Y^*4
zZWd37-y}oGl#GG;&Bufc_6VrEJb?O-5U5+<fqF?G)QtiNX(?ABSM!BD#v5`8Psl^h
z1DBj3WZZHG^0*K(uR8*{jsmY8f_%Y#;ElaNK3hUs@D4(j&^AJ5#Ae9lEFn)=2X&p*
z;Mu0&>x{tb7=#RaIw7l98|oe!Q0G<$K2#=Tswn`oWr0>wkhh5enZkrLegVjzErPlc
zFCnX80k|tC<O}9N{V4|_&5RB5?~~*`W(?0Up!lEnn`QRH`_1<D5Hi_+LH?wTkY(Ni
z{_7j$flW}?`2=jLBc%D(fU8vk8%hb8mx>@)F9iRb3w||=kg<{l_10A2-6Y`ZH;|7f
z5Yk@65wi9^gZkoVLS|7U)IGxqX)7N9dqbf9^bR3&-z`Fh=nbgX`xDacT!H%L%Y@8@
z7s1Of0B@WlWLchuoYx(^+L@4c*O8E6a}+4y0QH~y30ZM=P<Mm($T5)()Mr`4a1~bI
z_cswT4{ji2Xsm-e+iF5uxhe3W5ztW|XrM>PT(}avS(A{Fv>fVJRe^hypspoPNaK<P
zZ<ZuvrHKJ=3j-Ym2$^dZ6Vhb)z}a~qZ<-HGp9}TSS%i#pGoWrWoe;nI1m2e?J_ejI
zOvq~KCu9`$5Hb^f0q?W}&;Nvce={M=;w!jzBT(WaaDE*jZKRrz*<3-$s(|<Pu`-Il
zUlc+fmPben$R=cXWB{GhpuRtakhMJ#+~PIlMhQTjIH;>WBV@`(6S71f1D8Yq7lsis
z=HCaOeV35NaT|PkAR&_$0QJeMgp3K_KfLs(?nTI?c@VOup9ju31Dt)5kTKttkh$;#
z)R!Cw7d=8qlRX5kvLC2zN60YT4f#47@NL$R@7oIQw3(1~-V)s30(gH7AuV<lA(Jv8
zWEC4iy@>(dODAN^TuI0j&;qKgAf%b7f$vZzWSvj|zp{*w@kkn+l7PHM6ud`>5Wl~P
z5WmL=Xvzom-`CXs|M>6sdtokZJEI)lGGFia_%gWmqh&7RhPF+Mh`X(FMEAHIyhlSN
zh^NeUL#(sGolk58h{xogL05&1x0H=25ua{&0kzoNN_SZ$N}Ns13*ANP8~0j5zIDPI
zN$tB+o0FnQ^2RzJG<3W|rfI1d@#Hst$ZbLt{~1z_cyqutls8%{NV$m+SJenW5uW$l
zmHQdQ7f0MclB+o~XGy^H25|+Vj^~M?ip!Nro^tvYdTVdSdpE_L_?;g?h&Ek5Z+oH{
z@p&8XAn%>|qtk?8dNk64(Z{eN+Ocv?k`Ks+Abu_{e=+st#I0}MLz;f0Gas(EAnrDP
zADR7(p54r@L0ohH1GJc1@jK@O82`EhVaR|wRd$+ZEy*hcA0jK;;&mZDI>eWiJwzjZ
z7lXMtcM;!yF&sT|tMyrzw3YZy?FbaKf6(E)9L%q3M+ABk(-@(+T#w|R!X6=qRaI+#
z7Q*nGH$@^f#{Ca=4T$8iGan;KeLk*=&oDn#$&b<37q*)k<84S@a^wlRzaWn{cK#~j
z4@INUSH79uty?XL8&yQ1(pS5_$jV6)Prn$AxY|uJJk3YwzxxZ1Rty^0(z5H@SzVH^
zXpKR#<^f$>Jz#oO?mb0~pJj7>Zo%}7tbK+=9(;1xEM`T9zc={|naFVs?Z3R8IDdRB
z^51s%w(eF~U;FnwM>BZmF-^6MNPcNy9J<W$@W4Yme&XKQaY#u?@<hNZ=wHz~FHo?o
z(C6y{4kRDF@d5??YH5%)J4Rf)?FBm1;mC+;fzRJ<7>~ZLA2T@`ew5@cA@OLFi>76J
zg&pzZz43@Mc=iRSNE71QRwtk^g{B1#1~7i5hy;{pB5)=-WgE#mMiNk*g}YYJ@P6X=
zEMKDC7cK^MTM83biFt{dm;5?1@d)x4(_W#5h-T@C>1-qy+V%>q+GVID5DwGp`r;MZ
ze{jzR8+};6Ni$!gZ2fJA>1@z{nr&Vqhh>}2nB=RI_S4?HMmw98ANEg&^~=He265Je
z9?36(`NO}LjS^iWZW|>)UYYy`alQKDbUqLIYY6vS6#Bu^=4{6SGQPD3-lC9`718HL
z42id=y+!rM2YGp|Y>A)bOGICfs-7>+gW<az5>fl<JkdVey(C|snTQ^8Rhbq993dXD
zI0<bkTNy1Nv6^_@(IkX#qi6b6>?Y2ZlZ2i*PYY=~2g`?BAQ`Qh#$Woe`XI@<9g~rd
zo4nU``#r=*a+8s2&MlQB6<9u{f+<LW(|<#-{0@@ebV@;@8Xf^5GWNuc@>9_Jb2AF!
zVpWKL6iP*M2M$_(6NL4<_e3gk{i3|<m(hBXSLdgqA8RD4>R+xSt|3gJB@CydbKXLK
zJ9mOY8}6RI9m%$d<ZtsSq<;8vf?)+r-$$V|6zx<ss%r$>cbiihilzC5^(n*hY0XPR
zb1&_%xG4nlUnZE2@B43GJT?bB+A$sRA+5@!oomSW59Fq!IsFaackMnz+>eum)~>cp
z^zw%OQm4s6LAKfo-yNMvF1&|@d|fI6W0#&Hj(;Z|-7nL%vIsd(+~*Aojr&GR{k#nG
z7vIQ2>aRLWd7NPR7tP5)*TlDdGn<6zZCajz)EiD6)DH)5v&leV!O|_K%wd1nemMgL
zU6^PJ_dH9+|1BW{xxLP@+~ErSudE>hr3JION4C0={1rzg8jIgPY;)L^_%)SG<Yil5
zWvO$V_@3>VsC&TU>=E}3#O1s)QKD^!Vyix^&z9IsH0boCb@U_bFG6ZE5xX!)>Sz&6
zzuB}bBw+T$rRJ0)Y2PB3h5C|DJm#}FN8EE$7Fr&SE<9|9{=;)F3ylUTX^CsV^1A&b
z3(aX&kW1k|NrvYw%R=wCV|>G#Vf|bl$wH#T2MUWLz`G@~QO8hWzSLHje#^DlNb^OX
z<1t0p-^93Pqg5$|z2mm9{R}?HMlt*Svo{aH_MumhjeO|&`%N!G?$(oyx^+il%Vo}x
z&wnbAgC-NB-H!bfBVJ{cgJh=F*<VkD?W6BV4$|g898Xo<Nj~>>4pL(D-JXnq{wRRo
zdo0QG_)z;eY#*XOb5O_${fOXn*dCVf<f6g596P4_xRCbqR^}qt3z?jGKTZ%I*qe)P
zbZoX1Ujkm^my4vEZ-fR5Igvc>buRK1<kn4Yh5mT%Q!Z+B4IjP6fc2q2GY^$=y;Ezv
zf0_(Gp`3^O2fMDuC&TdZTl0`_&YDfvI$-_mxR8f7%LOZIEr;!AGCB_hZr#!|R|h`t
zc6lDMOShG-@q+Qoj^?2{uCSir;*Dhdu@d=czWs@F9vaYJ<k#e*T{hQ?S#zO3hB@aW
z3xRNj3WhZqp7VY_@-pFB?;Ql||5#2w%3Pb%S0D-fwXh=}>BfJ3X?_*<{{s94$Y!Fh
z#K8)-w|#mA2p!h+6IFxd^Vq%swJGL%HoA0^<7I<?0a7^|!(IFf`qR9(1?b|omkjsk
zuzu7&7oY|!p;-(4V0&CQvk;x0y*pj@1@wnK%7y6KIu(vZk6`;fVpWK4I%@{*nh)-H
zz7Q>a+L_k+3Fhy}lS0IKxUft7Gc4bo_&wM6lzlpNj==IV9V|p|m-6&#rb2sJk#{Je
zYNvnPBADMvlXuAJ$Xa&}7WC)hqwi2x)Q_h<ZO}i0g5IIPV=+xmGogQPOnZm2zuWF?
zoC*2t=69${+*R<NDeSM_a=u50bgBzCx`JD;c#qutS%<80VSh5X<2`!f95i`hH}vN#
zUhh%mtaq2M<iqmid-fhJ^zM&n@`wG!?TYtE@cPF2rFqbwct+nN7uEH=S&6W}^b#*Z
zAv|6O?HKTRovVtFu6&l+YHygob&f@-vs;|Yv;oE!eWwULo8gpbsKQ73!%%t=Dtm5y
zZ1xw}{un=sP?*yEmCN41@XYzes5I)18tXeu@9P!C=<uxC*hkx7{eRn0jONZ&`}Q~m
zmhU{TVzemTcK?beu)O4-7NeL-$2A{$;P`>ci;<nhr-~FmSl(-gi_x`TNypmDV0+jk
zT7v2|&j|&H!tv9>v;<v@Gyn1Y2JGLAkCvc*L8)6OCV!Itrgp0YWpOzgmt4~)^Ml`q
zfdpKPrmYo)`S1Bsg8c7Sz1lMX`|GdlrAX}li$%N2Vf~peE=7?$%)AWP;e6<+d?`|R
zr<NBM%_QTSjY`o9j#Xv8(LTiYT9%^o9&%f@xPd3_D@6x1i;Bw(VE*TvEJeq|ZcXEO
zbA=4Q%@4P)kk>iA9ri~LACw}|qDKRUGQK4Lkx+_WNL?TH+y&FSEVmRnKNhpQSa^x#
z_O+#GoadK{?Ai;&!`gBCp6iAF%VB$}o-9QYSIS&Ulp&wFunbk)e~_N}3f7N?bQziz
zd7Rc8x{9>lrCo+X>RM`FbnGVXwWbW&Wm>8}lek9w@vbry%kx$}Qwf$&wo@5ella72
zn;-TUA1{_6Cl2E}ixV(>-<>if-_NHIBn#_v#<McSZ->P6${}BvUWT;Q5A%Qh2Io)0
z<z=WH)&1Dq3d2i$FGD-K=!~yPF#S?PWyqW>Y`=sn^ashg<%s>#{g1CMtCQ&y5iUpH
z_P)(aVT1i0uWC6eXxcxRqy@_#zXt_5s7QWe?e-+Y4{Rw%{onV_+}^a2c+<gh^weN8
z*U{y$KJw3$qwg&PtYisql0Usxj_j6fXtk^MAbush95t=tcabrJ?+5!{mm?`pxf6Rh
zVEyRkm!lbnwY!*!SIO`T>dR4Szr?DSv%QEnc9f&$ATME_d(dBEX%$G6t6W@J0=74o
zg%yaiaO+|E0a#z!(iNy=&tl$vM_~F#v?|cFfy`e#X|O)ttgb+h-}W9{>;lX0m`w!=
z7)vo+KMdoSbgV#pt`8D|E1~~Zc~+q5%f7F@_7TSC6;y$~n4B9q;S2j4rRWN@S!})n
zw<Ywaij)devt8J;;URoKaw)DrULHRdF4zgngSV*y#UJVzk~s$Z_qg5)bm-WEb-L`Z
z{){;)k?~dMQ??SYd}<e0qJX5_Uf1m~zX#<j5znWitE(1*_t7iS^M&e$4bx%!JhQ$M
z9d>IPh_3f1%WvA=N))qHDBZ3F*3Si(N~D^)-Szr&Xg_hO5=DMD(fINJmN$O?4HEjc
z(plrKDQVyFtP(L2gVh>6A>Wl=iR2S<jUJ{ze=aJkL@Rr0$3@q|_NVo&5=}ez=#+>M
zOn>M=C3;O?nQSWy{dxNADl`!?dy!xqEYCdxRp`}2=TF1C;Cv)au?lfT#g$0ig!RME
zs6wacgYQib!tv^mWfiKqTVEx40oHelT@?y{xkoS{0p@SETNMgu33W+bvY$-9rB4+~
zJ$_SB?JneZLaNXghGDeNZP*{y$5x@Gf`{B|vtWB(%Bn(3mW$2V_Dhqr-&BsLXCWJR
z+a~CrSHD%EQss<$as#k_GX|=VzKOe0!cREfch9OuZV6u8mcG#6gaxXR<8rkVvh48r
zri#_5<n$}%*;H5_M^H7|^5oo14+WUNYa6OjAO1f7>-|OY`Oo)Oqie!LLLXX9h!?n2
zql?w^y4gNLe`>l^jpm7@9#OciNAmvQYLt*&kbGAa))&XKYQ(oX(|*GYIDg?ut41E~
z7N;9m!ul5|twuY~d40S&?nm0=_a32|maXdE#c({7=&MFQ(+&2_`v&Vvf};lQ3^9#*
z^XL1A@ZuUYaBn=-ry9n`FIR)!?=jiqz6AE)b9HOb!c6Aft4mjs@sF&nK{>Gx_PjTO
z`Tx1A2F<Y5+~ZOP>$}3S23@9wNT-Xy`c3kzK^mGeT??PW@(#IGgQ{iXH(EY|@t=ND
zgT~kDxIa>c<z<yrgEny*%2dhjBcG@It_CeO%8AM!faNjcV+~Tz(288m*hTW1&KfkV
zW-`mS6t=%e+6NSL)hZ<G3k-jp=L4E9uW)UVKCC}Y$qy(rpi}mq0QA?96(7(Jx2iXb
zPQ(19ntnh^0?NDR)x-Y8ecK1b75nZ>%p~+5b%zhgRBc1)n|_$zpJzUxLWS(ogkXCz
zJt6)d&`S>)4gLn$epiQmK&wYr3Aq))@*j%-fYzLI=C=NGzV|Te1IkD^a-qNy_TMH|
z*sJxcjw{0SwKRV~pXhw=17fVm_`Qcdps~1V{@Vv&d}4EI(P#T@re6x-^YHtw(7|%E
zJNzPWy~0AV7D-&y3CuIqAnhCVYSH2!FX`#huzep{UyG_1jEpQ^3jJqzcP&1?-pOFd
zKz}=bq823@?AaK9{xWILez6wmiM(Bsn*+xuub^5axpRJ7g*{Bq^r%`CJ8j#w><AeC
zOj0dcJ>$4yN(Ah0dkSk&t={P$s@tId+c)6PJDB1`Wx)ABbw@2~W}bE{kcR!C!DKBm
znqYe|Pz2K(yPyu$Sy}EnETu-Khex~)mD=-8M!bU0cU7-L%JM~KFA(fMs*UQ<LfyJ2
zT}H4xRkzfkCQa+Q$M2y3UD;oU6i*u+y&whswaL8>g>4_r{6&ZDU){G3DM^ZYA9w)E
z*E6IJWu~p%yLTS+&*Eow=wtDS^spA>i__{*t7mHW*IzI_J4@<Ni)@kS{ZKd_g*E;U
z_TB`prtSR$K6TDXg&YYXWX>Engmdj8WJ>0lklA%JPa!g7s!RzXv+Ei{2#1w9REkn)
zIAyqT4Y^!n>iw=^b7Z*q4gdf9zW@FCtn=OLdDio+XRY<DXRp1_K4;yOYV>)K``gQL
z%>MMJ*l+COmdTYS@$zMqw<PnBv?tb6_<ZbUbxYc?sd4P903P2KR=Fjei&2ETCkTIS
zcuO+fF>-n9V%)#6&za=2WlKlRAH01fd)<<jJ`U`2<{hu!dE_lAW$lKl#XZ%m{-M)v
zNn<nX_tM|u{=IO?Ey?jg$Mg!hygzoXza`zPRXF+H0S{LG?A}{aNJ7S)h0XbRq>@{b
zVu!i9Of1hoi-WwcORuPBynj@gx1`34hE1K7!|k<tc1sGHaPnfgwtW06s8XakPZbYK
z)a3qGqj-vxv@FVP$Z{UP?5n0ouPy{G_G`rFTm42U_#YAHz|gyVe%E(RkvhB>s;^j$
z`&->!DN>;)=41D)<m;{KBU7YOX4^~(Rp<U!etL@Jx<TXopgJ#axg<pzZjv<eZBgDo
z#_Ln0V8!KUuBCW?JlT^X6;3O8szYBsJ~vLLNa2Gg78=`#k9Xvi6scaZQW5GSJpOFe
zr%2E1<=V7s&Ev<srzuj?+PB9fNAc^`VB=J&UR237M#Z^5{#-0o^4j85cF8tAepZ!J
zrPEV&vvW?1_~MW%4Lh_)?Qo3Sd#q)ubad2T4}ZJWkBx_4_f)A!SNE*f<$h*)>~AN<
z7QW=r&xE(fW=g6QU%0mZrzD=w@Jp3K0?hinu;AmhWlgGN?~!RdFp9_LfxA+rYqQ%w
zx#+{&SMGSKR3-dCNXBx0KXm<as?@r8XU{sV_;@WzNtOC5izbxq&HKygQL3~&VA}Jg
zf!u$y-=#|HcR9^^+Lzz|thY#$y45;cqog+<pH}75q$^f~R|MbW{qd-7nzUf9+wMD-
zuB<)FoYEwd>h-&Ho#@H(^*W_VZ=N@+v)7K#&$xkUQsBwwqsJQY{D^UB(um;2iyvsY
zzZv_cN%huQ*#+O@_m4p<(xe8JcQmTrpWAD<HBEA!JtFfs;o}t%o+f2A_+?3-`0lJe
zmvd=Sv9;~Ymj257KPE9v%6_sn<y<AMugkqOshUrP?53@Fyt@7Z?bEw^*bL$GuX}-X
zJU@w8v7^-}rZ1snx-_8t{)WawxIentrAvE4p9C)-#MfWv9Mh%W59>|_C-L!V(k5Mc
zdGYzxdojE}fA5tpMZF$SqsRPCOke4d=~97<%Z4b{^Ytk9HI$}aZ1#soDLy|QFG`o*
zO||O0(|j;1-(_98v~qp(kok-G_#XK^U23{1s!EP~3&t<0OP3ZU{5@u^g6kU}oi05g
zi`F`raQ}}@Ntep$Og47k$lF`xQMy#Bdi*Ji5`4Z-eFyzpyH&~a?alPvHPK5|(_9+v
z%vsCwg^TE=;R#a%*Prde^7TvVr8<6t{}}ZL=l3YDmuC0PoL7G;zaCDjrk5U94IbRW
znEUU#x_arisK4r4+plBtx<-1*`}ZDQ+a2QmbyLzy+jneqc~+n6d)ZnqZ7Z9w%)*4X
zx0t(Ls+qN^hNHx<H?@1}rK@F^)C=Fap6P4t0r`^Np%a!%EZ={)Uiu|B`<$E4Dwdz%
zrI##?ewnh{KZNBMPSH!FoQJ+`v5@oE`{*Tor?l8PZ+~L^y?%Ph!M=O(>8E*l5~!D!
zI&ASCI(r`D#|G=AH*b5y?e5CQD<xDf&3M+Oug#TZjGwhrFU8G%UMc**3YLEsrk5sE
zK78BCcN)vTi_lA}5==M$>BiRws#AJt<jvk4E|d;p{DK$t(*7yC{z(00Im>I}^^)1d
zz_Ld>ZDe_?8+xhHtESVEwsHGPX6PmV0<&KCU%~CMzOR?Ax9R%xfX2N4t)J?p_zg=B
zde`FpSK_r^3cuXh=-6alUooQ$>D}qQ)uuM#<5R>eL;CGV)<U~kJf4{q&5+8!EqUyj
zj<?6SREBhCf8?C_huptk+h#}y=2d%pdJFH*Cw3W9(UF5k#@^b%?7d^3AziB<@!O1A
zt64tDF+)<;820Cr37mh)DMPBaA>u{Xay1zLm}`bq`CTcm@p}SU{x^5z?Pl184CeN&
z?wKK-xcPJH;Z-Xcf38P{6nCgz?vona|9%~wA#IHA+}CkBzh3q7%8;r$t-NM*m&bGG
zDH)P+Rf}4S2CZT8c0L&r+1l%A=Q_MUE&MX1)bwXzHzx7;@+=@j>N`ReQ*7QKR{r|x
z4Cz&BACH>{c>FrDF+;L`Ja~@hW8VJNJ2Is1mKRHVjN#)od0&PU6S%l!@8bQKeAgox
zlJoSTY4_jq`mm3wbYkPeB3W&Dd?|DxL%KLM>glgHc>KN_n<0hODNw8bW!_&WucN+*
zvM0-);_X?LmLV01@3rc9UvA&Xdl^#NiAe*`I|sA+q{kSK)2p>ssXSg=zQ~XwimRVG
zZnS6o+wU@@ZkMOkjLYEjDO{Z?ZQN+`>(DVgUicQyl!mWebg0)^?oXYHXG$$<Ha~m5
zNjoNAwrr+U%=_;XH@EZg%Bq|xg%7RMKYKfmhX-n9N_q2l?7H+Pk4MuSGNqG_dnb3&
za({BxW=drjuQR^u!uzX$OQvL>zA`Ja0r$`7c9~M4UeBJsUNDB$7tkeBsvf>&{^bXJ
zygT*DluB>axLpzVQ$+`7O3wFE%Wodf^~I0Ol$!pMSkz}RpML@4GNm|&J~PPNUzxu4
z(=w&7q5(G1^G2|IfjOCyGRk;l@2mX!acW_vG^tsOGYJE@|4v($DV@GLyLIs@oL_%U
zrc|Zyy;a4h^8U{X&6N5KPIPYH$AjrxzcW(`n%h}X{r+&4cMr>yW^aDc&&rGYANH>$
zw+p9tt6)F>B>nz2$mb@BdoyWZy_!o|zR}p5B<RoGFAj8=!}2!=-Xsp2JNQg1I*jFK
zb-qca`}|$x#p+osU#-PWVz+CLOW*ZAEPwT<o1|&f+O!LqUc7weo5bmD=Tb(q7qEQY
z;x|c&jr$%&uH^bM)HjJ~pN02dq)ul1pcgmD&Y$;od%kx(%Xj$W208iL^ja?a#<09e
z@(tqU^t46&i`?EbQ8!5K?Cw*K#ZO`U*+*{>jk4;La!VGoe2ZN-$g*PBF3!sA%kl-*
z-5}FUpLZMFZZONoEWSZnJgM6weC24C5Awc2hBd!mc3i8TEI$xi|BNi37Sr~KAIsP6
ze}niOc%f`onzvWc@dlApbGn)}Xvg?hr5mJg+v7JHdCp_`o%T1#kda}22M_gQd7lb5
zNW$I7;f*d%W%=Hgu;=Bjxck}FSiX_+26@`Nm-hfu-rf?=lgWsQ&;MR}bT;F^ypv2G
zrghkD=Mcd1DT&F%V#sojC)LKX{F(E~BqC<$=sH!sS$_ACWKw+J^Sph(^8UxZ#bopA
z4SUiC@b=GNlT7~Xd&g{G&J0$5(xPNiq4gN&-&XSe9Wgzb{8qPqgA*5ddk2h8CRg&J
ztXiLF$;$WWmrQ&*9sB*fIroQ7ZpkF`?4+E8O%oX3O-d%cLYpNVzrg#mgMBh-(s{P3
zvh^a)uaHd4#%Jk^JNvVI7t3VQ)#cp9oMBEZ-&>hXE*<o6QkCk)@`Iiyk!?>79y|S%
z_s5vKNu+$;-%8BxSeNm=uO|`9t`qnDso?Edav_PR*6pf)(0d}|Z;VJH6*gC%x@y=c
zmJk0eiOg!e@Gs|;+}_J;lSqpLjVIeS<KuUCaS|y!+wX9ZmA|s`Ml+H~y9wp@y!@H_
zm+hD&a<QiAo}a?_d~zO;L~hQtw#*sH+c(5LiOjY34)>ijlF2V}P9oO_^l+Ftnadxj
zpG5jSKB{|LZ6V{QR!SnHx(9kKJ<t8EAoh!0w%?*gjhby4zp+UYY3g`y>5I2q|EQPO
z$<F?&71^o0{*77J$(V_eeOoM9!pdL2ah;SO`Z}x0FMNJrziQ&Q{uk*^{o#z?R(GAu
zS}?F!gg0-$-=6E_S>#jGo=QIdqc&V86-V4!Q!H;1D{mfnom~5Qe!cJ*KHhG#uag@Q
zZ;Smrg8O68IPl*z3_RfG%gUz@zE0}IT8?bFj<>I7x9eo#Ddjfns(ijrZFQY&IX7{6
z=jd^){KZDsNwF$x_g{43@;244lZe(o2em)R`D068C-;^f?qYJ8%SRQwPU78D_SQA!
z{aNu{BGJ9{@tOaU_s7h~iNs^=A0rNJ<o%zLo=8+pT9U*QynlX<Pb4Y6ow`0g%>5zs
zbRzs??dhry`Fv4_Cz3~(Z~Ok%kI#o+wn6^kU6OH_&xfR-M3R2MwAB<l-d`>J63I;C
zib2jL_<TGtHIXb|^_Szw$GrZEqY_E+B89E@HRR*Bs&68R?r~|{PxH7v1>F+K+4(Md
zi?HdeKYXP`a?`HF!kUqMKEJb1B!g#Z?{}Qa=kL^tiR4^nVYhin+`nHHOC<V~Qr))J
zZp7rLs1wQa>Emu*eZ}KV&Wi-{?o3bR`PlA^?~|24oQxXuy=Tn(%k*Xf3Hz;4wTpJV
z|Ce7*AcqbOTTtN4FRXmI6A2{RGNxK%Tdr@<-UQNodf28Jr}+H*IW&RnOubyC?;PGg
zamx}&(>a$nmGR*IGSoMLlxa5E<mBF3Oy9c+3B=5`;)1Ase0*0AO(2iSv724PJs7`!
z&jix3=aV_NC-d=$YlFXtZP9=GlfryF#x_kLRf=X0xns-ct5xj;vgg@Q`&++p|2|qS
zf!v$i*Dl7I`?rTCf$WH#H{wOcXr|xHIDssDGQLe<FxP(w|9O|(Y0mFghqYn+L3gha
z)1Sw*sa=`-w`I~ba@O;=<14oC{yG<RjgXhIm%Jvrv+`4qT_ZtjUu-Rs%j38G?rUWJ
zX8ri_bJ{U}*7|GYMvJ$Z2itP_Edkevb+LnP?z6f6fwQlXz=_M=de-CD3)}J6$gGX^
zNBLgn{*mc<jYMhO3$OW!$G`2}uaR!5=EY96<MDE|>ot<n!~BZX#1X7MhbGrZgvHuP
zePa3eVSjqED%v`(>=+(zFPFVWp8a7vz<oN`x3<VNvVU!<`RNTDnfxfDYvk665lNaW
zTwk+iSBdv=j~cGSxqn;Ty-Lpht@}IXI&a^D>sQI#?7W{^E$8ENF6t@?c&uJ~wmJ9D
z&|_E0t*MsI-WR$5&)R*Jyezove)PyLtiAyou9D{^>b9vefcKwsAo4-EtzFak_*I#6
zmHZiK|2()6k4J?jTqWC9)!#Gm=l~}Fe8^R@Vrr`)kvUwyzQ<LP+u5b9ad}>UbepTB
z-rCBcQwQ<(>zZCA%FQv0r`F^8_SC*gVl4j-7`mR1&!+NMN#VyQ?_Zkg%=E7=dX>~Z
z=dWq<hR;8L<yB&{=<W5aV|>2){T)w6JUo3Ta2EIfxqrlyQW?MZsjK7hVa|<sVpIN)
z<gLf%GJSI{$CH``jW2ZE%<G$XBAzs8lv_L4n9sk3`{KzPv-+`*8*={++!RkLG&~g$
z+l1>|vm&0%iJo0_(mFoBw$6(uq{y{BbL#MTv43(r$!X~t{$$29R$t_Zcru_}ZvUKQ
zo{#SnPnwKx*z=7)zh2(y5Kkh?Ym&E5=Kk<TiYM3B9b9|Zp0}rH{dnSAIboic3AeXK
z<#@8<`j*C<ck=OWT_T<+w-0ryKCT0+&(k!X1g&#P*;I!2&)he0B=vT`aY1%me*42X
z(&J9iMaw(z_;@KTj!f*9c(h>?-apxK$mf<?YWo*o4_cpzBatp!X6Lr!^)){fN6HR*
z@w7x9zh3^jBaZAcsd-?^2HrpG*Tj*v4+k`CcaQ6fSsX|5W(GGV2e^MIX2uaG<9feZ
zWOILL;1x&O-Em0$doI6Tjv5q4#)exJaTor)wQC%)i))gaQGkz6daF1xvX;Z((yMtq
zv}qhi2Hwi*_G>}zPrYl#kw(q$ExaPeb6wdu(tAZtv-TT#{b@zwNV?6rrM&}qeU*&k
zh)v%+OQ&b?_9bRrA#)oZeh{GJ?H?9%g)Fr0Qn=SBu0MDG6;e8{Ow0bqc>Gx%bcJNt
z<ZPX{fya-A)31=QrPY5wF^k8;<N;U6z~Z+1%K7s3@JyF0WZuP4yXe(C9#*e@g+zHg
zox3B5$CKp3SIA<u{T)S<R%|>M{uN6a`lOrRS<C&$IVqMLJiTyyKuK;-&hc1s%id#=
zlm8%A{&;9C$!xqSr%<CIEI(sjELmjc5@NQF+uLGfESd1+&0m)ixqTKLV@cg&qm%)0
z+<#JkiX|R*>R)~y?aAc#S;vxrt=wvzJ<Ib8-o=o#>OJ&jBl!J>M`jGM$PJxTbPl)A
z=|T)SQ(5adbk$HMUvYN~$*B_blb<)Y*KAn~nLm10gK9VV_2=2d7;?S$fVRK1=lXB=
zjv-c6ax0_;@%f%0#gHo<N8YXR8}F~nl_7u4V$9qW?%(IlVo2}#dv7m};Mc=*kE4nG
z@S@{F&r7WS^VgzD=UUyZ29@UJV<MtSa>Jn)m(}9&D|vl1S$(C`{O~g#to*$>(d5=I
zlN$Urv=__28Wv4<rrdpC70dm_qC+%k+qY?hsa<)0+trUIr+eE?Z}QVGtbEIo(PVA?
ze!2T5^Y#tPxlD50d@bMQ4P*SJ8Q7$&Y0pX(=W~0GoWD%|+TXg>f_0+(zh5RhJfohj
zTh8k%vFtKQ8XpieA&$r6wv#RsO_vpAs=Vd?@7w1xIqK}+Jt&Cx?<uFtM8E9MBR-G#
z_#0QfOzv#1-?&y{0akzOf|tp?jlU%&E#m91fb2`e>qxg{HFZ3G-AcSfYHqWtB8Bq!
zQ2Y2LvhSC6oy)%E{qGZciL5DiynM_QKHfLxT_VF;&A44Muqe~-FzOO%Resg#h`9q<
zex>^*5?OvoMw>3Y{Vy9_BB@hN&g_oj*Rug-E|EsTWKM~PyuU6fE|EZOrG_iw_<FO+
zy^AE|c1gvZ&b&YNT)s$3M%495F3;m<<^30lcEZ%XQam58^+6ZOmC45a9hdU{D&u{T
z3}589Ghi5x*Bb|3BoBR7X88@|^R-Iri)2-~kYbnb@bdd=T_nz{D{Z~Mg8PHk@*>$e
zy~w<!owTeyF)yP?A)8;LW=-e)KPWYdyz?#^>T{Lb`{r~M30Qu9!t4UvzTllvq)}qD
z=d@W3n7pHZ6saCir+iFB-oGj1qln9kS=DRzv|;?Yy`o6Zmz84|#PIlIFGZ0`RnHzP
zafDx=(<?_2h03`|jb5C;!aRy>8?|6UJqO-DZL%*Aix&1rUvK5(tGa%H6dYBsY3i^p
zO#kWQ7l{9~lubhh@%b`u(*<(YdCr#IWBGh&x8MR9<+<SX?7_T0ivMzfjPOwFR6Y58
z&g^`FoIl>JSF<c0KMpuvAhXNO@GCWq*Y8*E0$F7}rh_`3>l>iDKw4%M9P-Cl?%z!x
zoF}sy1ub7clgAI6xbx(|nGm<5;(C>L=sbyfxAszOL*Bpl)}1FW-~B#&=fU>O{`lGF
z$*-gBc6O@3+aEdXJgM|3q*<LD-aiLAoF|?C+OT{6pWL3EKb<ERi<~T-?#}NgH<db1
z0t&6j-TREoZ_GPK%376)v`?AI^l!X-j@XsRt@p^3`^&b==SaZ$dtUo}xqt21e~yeD
ze>}B$7d~H(tv*M#*S@@=>C<{l{^E>tq_VDVRDhDNe^LgYBfcd~_xvq!d!Ds9M<(_h
zyS-91-k*i-&yhuw_FeRz&c~}}iF2f|bIlU*Q_3@a9dgbRqv7?ZPCCfz8<%;O6zt`-
z^34$5e<4w4Nu$t5KN&aS^D}BM%1>R`&B@4($-iECmh69aTB(od$nrI(pCu2*tS=R`
zkn8gtc$TbeS1zjHz9NjjzV%t++xM@ht;PLMYVEURmer_EH{-bfl(#xds@q&PFLjys
zkLQ~+B>tF3p@&x7U-s(H;Qp^|@Ui<mpL6~Uson5YbfXqLUbfqFhU`3T5gk5(&zH~@
zXNY&s%z}<J`FOmXdWHmMoUV8ACNJN`;|!^O?&qyVTJ!$d-|7shpHs8Mi{JVBxLEBo
zWU5`L!@;dJnf=p>ogvD?w^wH_=GU{^uTPVT?L9ZW>%-TR9rdS4Wa-5#Pd4T8GV=Us
z@|QlWxir#<$vf;hO~$kePgWdKu>9{UPLqH$*LFEf;pMAMJ54I6uBRQ5+A;oikJF@0
zOw$0P^L<&qTI<uq!_`{Xt0|8kdupF1NufEbhIZrevZ2*!a->$`q?RrCd^r2&6mi=z
zv(cp>9v{1AoFePH&08|{CHIf43#Z835d(r8(s+F{_MRg5LX}>>-{JG4)T&ct_p!CN
zi@xLcPZ85kkv^wZEe=1@o!QfC&?z$HlD63|XSjX2uBS-Ii-A2{V|jmUuX~CV9bQje
z-kgs|mlCJQ%G}Z^ZI<?6^2&FSr0a&5dY20G`E}@aBuT7mZZX7-`}3$vk>u#j8$Esz
z^P$TANb=5TX^(9^`1S4f>PS*!+s{`bL->5yGBc7K+11c{Rtopu5kn%$>+O%LPFA;I
z_1U+NB;5{$6|2^Tm(QsmNme(n^s3>@PK<xCR3x#RX<2RMG|mrEM3M}L>t<80@pyYD
zmXJoXDlRX0m-qkb5JDXKo~YSwf`-X=7)eOd$it=IPU6?cB94SSURL_rgf85_uB!<t
z6Or*)bC~;2=(Uq1VzK|~Bc*t}p0w#C@qgN#9B$9!NvB^=66x@@f-_(6{`%?XlVtSI
zJFiz8$;YpB!IPxgn|XzZwlk~W^u`IYeMb4&kG#3QyzM8*9HVY0GK%x@dN<(&QT7|x
zBD4dyN73R0@w`-fSDQuL-hxF>kf(0RO}Y-{?JJ$GBc(Q4c>P>}*VkZ=j`T|EnG~{_
zub(<i*OB$QQ8Ok-aQ~RnMn~?<a(%u);`3{3Ngc5rdOm!#c;1(M_c+;7QrUaT7+ziz
zew;W>UuCrFPJd><`<&xs@q{+6=`VP^S>=8l@ieJjPyoLk+$(pSgs<yV^2|7HpW~xr
zB(COA^XdoHOn%kzW5ldh&$yA5`>_1Wg~!Oy^0O;cYt)V9`}I6VZtMJVS6$@uA-d`@
zGW?H$8EUZ}Yw`C{LN3MZ9CL!lqmyTjk`0vtT(^(s^*3LBl(^k(T;-M{um6(AQSzYm
zpV^Zd@c!;o_b5r8^T(7SoA`XleiuPhE0?HK$MXL5kB%UgjYlmXH=D;#hjkI;M!B_H
zBm7%3`_e{4kY>}B4xZz=eM=o9$h-|EN9?Nc`O&gK1W8jJO4Oa_>mT*?Bjly!yJatL
z@czEE^#~z;zqVeypWDA;{1H;;Sec|6Ww^c}&5w|*;U{V~ug=F$Dtd(MeR!v?b}`pq
zUVoU}@A)Y4(W+|99^-w7$(v%+Tne=3<MCw1VNx#3$#+{F9`En8KTNj13s}@x*_@TX
zS>`a=<z~63wR3HjPkC^N3=8h#J2ZsblYaCN@d)l6|Ewgh|B2rr;#RqxW`ct|E1%cn
z5LsF0g#Jxg?*FB#9U@UlW=|GccV+yhFTzQD!o-A0Dcs)&oeL)oN}5mZ>A>gr(v{(4
zU3k=?N^`iqrw50V=C<~k%L;S(xAnuxufZKmW`*<k*w{Fnv?v!<HSrEF?-PHJv?^=X
zcC0hc$Aumw$^ualg}ZWlD|j6weK)t<`E&_ie@vGSl3#~!zA(g`*Pm(u{?Ov%MqcIP
z(K77-S$6c;?H+k$nEm_r93Zu`x}Qp4#QnYEi~~endVr0pAMgM5?GKRl4(Y2jn|XiO
z+8iJi-PG2ndvJf=`saS)=NJ6k#G23F`p5T^5<5Insw;T?XBX`!588!X^)JW$V?giy
z<bIM(Ik&ysKNU6hlf<BrCA!)1@!R$~jI^#gqQ!-1?%!Q6hLO<6EAk>v^ZHe5!pQSB
z!|fHT>ofZ!hli0Xq3Nq9+VFTV(=m)(f4An8`)l5xEltD7-J-p>op9j!N@4rRsg^r#
zHJHH1|9r=N#PhtF@wgSOnZD^y_LA`NM(g{|ZN~CV0`?LT(dC5SSU$e0x_imdLUDg(
z+~M&eId%_O>r;PVpIba0k}-Qo`5x)NzrDcQA7+7km#5>0o3>~AcJJLy{3_P-w2b?S
z<qx>+CJRm%Ez=~4&%eu$e<xR69}MiVl(+A(|L<f`<k}v+s&T$e-QUTW%%#(pKj8Up
zS9X!zTb)}xR5oGyf`8pb$n1ebjy~c3^|;6`;yI+H&-S(4{*Gb4k>c*z$BP{1^W&KN
zZ)A7(g^nE_@b#YK)1Bmc%FU%k=J0rNY}roovS<6Bdh7Z8>rj6unWQ{+pn83NKk@MD
z4$}UHf8^x;yuP6EJ4mN)uMc;h#Pzqe+CkK+Yb!PheddR@leTu+@+Z>x^(Lj;c9MK$
z&1_8wum9MKZ6rC{&au3|18dLb)!WFW?&%RHow)r$j@!tZz=Dm2JSxrjD{pKi{cOyB
zDN&u*zhT-|vb_5dlUs={jDM`mRx-`e>)u}-xqsi(Z6R0t4;zy{p63hq-$JsFzi7MW
zFW#Q^d7H`8G%{pkC|}>M3f)WwdX3CI7Rc*=;Jlg4c5ZsMQzy~B+nY!|PtV9($$Wir
zXznJmeu?+w-NC%PL)A^Bw=yf~^=5uOK71jR_{9|&+Fn<X+1GAFC@EHW)sYEjv@HLp
zc_<lToU*%TXm6Ic?X{6a{?%`0hjmsg9}u#EY`L}gj~zR>zT*1z<mrK>tIO8Vv;DXB
zS6WZ}O%`mfww(LNkYOR@)rw(e1LyI4z2Dc7iW^H-%ouLQ^c8!umUP^FD{{!(`Yd1Q
zr?sSDlD=L!HJ=Y<C$AxEo8(Qr8sW(J-Hr#7DvkXX-l}QI@+<RJlgqj8{a(Fo$nt--
zSWR4ZNBbZ1e#Pt=?iWP7@cY^siR~Ewar7!u=X!U?6`4(0esR%NWctacdRy^4sAKn)
zq-eyTD^*$ue_ywPL{=HO?|xbhR$ifBPA(1(xY{b#mgNgpSxyS(9^Sa?1@HfIBbSjf
z9zE7LIdl15`vS?Ho(;F(?ZWeo?+1_>>j!nXn#Sk%lkxtfX2Tf|u2$#s=kMGlWXO)T
zxl`+uWBSb(EheKXOf#OhfR}eKzKA?Ju`_YPrbdi^KGcuICN&PoN^QXMqiZc7^LDsM
z51jdU4vv^dYCliP8_~WL<BxQiOB(O1T-dEY_uox%bBML$=s$~=;QedXZ#G%*`drA(
z#GhIDme*zxi(X-RpA%JBe$7K~qS^L1Z2BD=miITAMkY>NpvbsYmF4f*PA0oEj#|Cg
zx|a3-fTj~j^C^Gs4=T;)@AU3tN#U_-#S807to(%AqsgF>H7(ty6=L~@WrmS>tE;!;
z=W+c~mw}{f`CS8>PPJfs8|xlq%D!$bM^-mtdH)iviOrio9eyqRjMYcK^Z(Zl{{NCx
zhrIvWk(h|J)d#NA%KN|dGwsvGH*l;@-v4dP#mS{?wgl?r{ojU!Pu!Y0eyLX8|E;Qa
ze`fl!B|3Tkx4gLr+MS#~P%H2M)?i>g>nX0wv_%%a9^La$wq!mqrEQ(<!CHC$x3L{F
zOQe(w)XMw6b)J5%TFE9(T6zDs=_lOIK3X?QC-48(c%4gQ&AA|*y#L#UZKDrb9qOc$
z_kY{a@abAocZE*g|IO_8$45sx&C$yHzfD|}bksR;wocyvZB&uf@s%{obn^ahcZRo_
z-oB5&R^I=uz>7K!=66}6llOnqdTv&XG1{P&_kUY_WV&&1`ZAro|J%yBZD&usuv9DW
z|MqCx%9S&Jo1=9cG;z!{$G@a;>I;WwhON=c`@d~{{`_ROQ;W3n{%<$#JFWTY#2l@>
z|J#hh(vl|a*Xrc`-?~}u*_UNGUn}qbwxzV=^%QewoxJ~Bg7dAet&Ib<^8RnWl@ePP
zxinT={760XT$5+gojLWcj(k2}EARj2t+Mw2BV>_Q-v4b|uZD9gR9m5y_kXi%<<|Fc
z-^Dt4|F?_>&B=o%K{|Q=H=SyYcIm1OI(h%M%)bX-Z+K^-PTv3RO!a<^Ugd4j$@{+@
z-;iC@?B*h^y#L#?*WF)Nid(Id_kWwR+}>uyv;I1H|F__&18%2Yn5~odf4k!IL^W-l
zt5)9sZPFso_;xEpwDSIM*@FTPZ#gwyEARi-{bc;JL6_HPtJP?jc#}MrGMhi#x4Oj)
zt-Sx+Pg6$fZaoav%KN|F?$PV2*};`MdH=V^D^84<Hz`0T@Bg-2yT9zoX+Ao6|F^Yw
zA3X^fzEmgg|F(NYS)*FV*J$Pa-~K4Owok^YIa+!Dx81E<soU2N(#re4ZJs}3cA0is
zt-SwRzk5FRueYz$%KN{yPV2s|dFBe8y#HHJxYNv2zAJR{{%`dcuAiuNU80lsfBVU%
z*8;P{>vZz|Z=TIwy6koI(8e^KHFQJh3#psufnpA+>vZz|Z-olx4eP#eoKD{VZI_>R
zc$1T(bn^ahFD&L)DWdh$$@{;pndUdY^_bZ@dH=Vji9<%;*cqsk_kX+gOT8YwDhKN1
z{oiVpFgA}E8mwJl^yhf1O)sUoYgCUX7oV$>_kT<5P$Is)<wmW%|J%%|#g7^H^U})u
zztvd%%b@w*%XRYpZ%OrwCzNf!UMKJW_BO_O%iQaJI(h%MV=ofcy*j^9C-48(<dFBX
z(<|3#Z-v%qes}jPscO6V-JjkM(#re4?Ye!xe*Z)-oxK0s=+(D37mJ>!mG^(ERHbK~
zsn^%*<o(}{&pb5y!hm5qdH=V@+1rA=+fCBR`@hA_E92eAdc98G|E>PL*kvciFVh8P
zZ<({~>}%=dUt_~sd3$T+{ols4zc=Ml<tbWu|F`;yHvQW4TA`EofBU^*%8b7DL0WnL
zw+!c{x5m_6uaozGJ3si`rJ0x4Y32Rj>b-kuaq&%{R^I<DZuB3Q9F_;@_FU_|W@FYH
zX?Ao!hnP*PwetRNmGAhp|2u7+PTv2mK+;_M{yu|r^8RnPe>rwMeQbzM-v6!1?yfUC
z_ME7b_kXKXy{pBwoDDj8|F^jtYEO&%d5%`z|7~2zDCyF>4Z4ud^HSH9%8^oC-4_ng
z%+|{LznP!+)i-LnPAl*Kwp;6(*THYOR^I>3rLT{xZueNNy#L#+HuvK%D<^8@{olr|
zpVOsj@=~3=|69nksVy4mLUi)}Z<FV(A3NQ3y>7wQw<*>=-$^Eo`Xm`YnxmEXf6GdL
zwD?rHWjcBPxB7>E8KI~YqLuf5J8hjkrN_<XT6zDsKJBbK#%x=rllOlMvYIx#+TqnY
zdH=V7=-+%6Zt&I0`@dx@Ep(}3;&ScHz^$A2ZOxTd*oBm=6tY1l@Bg-BPtovaD?)Vg
z{%>K2x6XflVZBz~|E-08VX|%03az~V+oDa$wKJ}*(aQV3nKdwpvpl|DC-47OZpF4|
zU0fGv<^A9Om^vhA!k>e*-9vg^ac>+beF-~nbiN<zwvK!W=WonOb=a~)`VtNfUtFWL
z`yuirED>>VP{ORU(wDG+^N3b0>RcyZ!pA*4gSMZU+U!gCPwS$3!xsH9E4iEWC7kSb
z>{q%!)t8Wjs*+5x|J0YzU+gdSC43_GkNOh+ll^@Euzzv?zFhJDQ(wY=GJ^jvIZDav
z$o%+q1+)#c#Fy~v(v<7y%*%WUzp4Sd?y>s6gkKc~lkVR|zJmWG4}Lal|CjNfR75rB
zCBB6JB>%70ukaByd<p--0DH0j<CpLs#Id!HDDfryiUPW4<k!+yL>bE#pI=L?&=)`8
zdb7Tkz9{&f;WG<cEqo=tFZkJ$JSo8GYw5E>hQ!<=3dPrwVcE}}8-w_@^f?(r8jV?B
zONM1Xdro7<*V1Q&42U$=eJvRj{mdx_PVu$$8Ig}jQFn9l0{_U#^SYmt=l*9-p8X@F
zCrD3`p5^34g6{*q2l!6l+k&qFUjx1d{7~>cz;^=Q7JLQx*^iO3k^X`#_)g&4g0BEy
z{}4LCj|4vwe0T6Q;Ady$<i$P6$qNHN5d1*!1HrciUw;o}!4C!B2Yh$%-NAPUUw;R5
z@O{Ad0N)9G4fq=HHQ<MW?*YCO__p9Hz>kBCacDyv+Ta1cE%@26Ar3Z1!p1=G1Hlgj
z-xmBh*boZ75BOf-JAv;6z7zQROX#O7;KiX_Jj!1~nFQ!bMEyz7pNux$K)ttMZwmCJ
zqOLT^>Y+aaGSQ$xJ{$5*S3!fk9`g3rp%e0Pkhi@Fosf@&yauu!>Cg#zMP^Rkn3C`E
zvdg~9^Fh)eh1$H!vqy?7^DfUFNniS1o)?k=DX`SLJX@qN>vwrhNO6!IigX=vLy=xU
zZaz{8r0tMxh;$xu-I4A=ZW59SQV?XTA{~ZoU!-Wr_C<OKId7ywNFk7|g`|UQd!!V|
zjYi6W+!7=kq}`D1jC2~ZoslvjHx9`dX*pyoA{~HibEK<~9fb53<mMn*B5j7OD^dhx
zU6GO@Hyr5|<ouAVk#<7X5h)6?J(02?HwDQQDHyWNkoH2h8B#1{`y)Mu+)N}3qz#a*
zgLD$IZb)g68-tV!Ie#Pvq^*#3KspQAu1I$vHvvh7v=XwFk-{PCf|LMRPo(FNn~PKf
zX)R=HARU8jTcn$i8;SG=a*L2kBkh806QoO!?Tz#Ra?_A(kpdxWixdV~C!{#YdLU&(
z&Id_@6be~;q)5oRBk3XMg`_Er@>ZZBMHYiRQY794b3%$N3Pg(30Ffe#0FlBhP#;nt
zWKEEEL$(%D2xM)LLLh5{6arZrq!7s3Aca8I25AXob09YwDW?#|5waDLmP6JOX*pyq
zk(NW&5@|VPEs>T())HwB<o|-~Af&$_9}HP*BtOWSBKbkq6v+>=rbvE}HAV7+tSQnI
z$Y(*eCsG#V{UK|CG!wG9kei8=3%Qv{xsaQQlnc3;NV$+5gOmnYH>5Pk&xNcCX#(V*
zLv{kvbI49WdJfqMNY5cV0qHqpJ&_V1>w=U3`Du`S1KE*C4<I`d=>cR%B0YfYNTdgl
z9f|Y+vb~WmLAD9fCCGb0J{z(gNP5V6An76Nfux752a+DL9!Pq~x+6tG)*dMm@*a@a
zL)INB4zlh@agcRKii4~>QXFL6k>VihgcJr@TPlw@s7I{zps^U&1CPIfFMzLruYqrY
zIlx?C9?%GN8KX`WPz@bamc~)Ydprk1-s2?@@*Z!1koR~8guI6WGLZLB0wM2V@-EML
z;)LNt#!MJ7*tvs?qV<q56Gx00(q_zrA*01r&ZvyCX}F0(k%)ZQr8jx6a2^TNVBg_5
zpdH<R_~x6u?1G>JT?>H@3<P@IdXr~b7^}OxZ}N5m1OIrF7lrbnKs_)FNcSy{1ZqrC
z{vq-}FQCQ@t16%!(Du=rJRhJvFqq=2H+ga9Soj08fbKvA>JJ1u0Yia3fj;lv<Rw!&
z&;#~_0;d4OfRVsR$_K^)vw?b`y9F>0bfB%`ZQd)OLj5++2g@v<0&g)7(4InX^Lhep
zfnGp+pdZi)7z%U;MgX&cnxZII_-&p&&>rXtbOL$+eSm(zP+%A^5||9s0~MC2$Kq|C
zEk&ER@K5Lgnp&ZsfQ~>##kYA`G!Jwt4y=XprBKcu{L-io7!33PMgX1ay+v$-eZXX(
z2QV9$?SMS=D;m7bvx6QDP!Ei32>VN-e}HyCJ<ti54eSZDZv_27Ctw)R1E>dj0bc<F
zfp*r==lC`+5a{0QZJs-|2RIz)1@r+10ySlTeV_;E)c0*(6wtOm_%<jv0QFED3_dUv
z7zgz5L_I*;A*h#@UxN0Rh5RbC6BxH1{ag<1+5kPkuzlc{M?MVw1Jv(F`+<Q6(66>A
ze-M12A{^}mh5?5Iy$-={l=F#4JCKh9`cy%CuEH*$Qv&3wLM{>G35>jfc2|RZ3fg6d
zJkXBfV~hjj6;I(O6(Ii-<6If-09pgRfc8Kipes-h3<f&A!Z-s%fsUw8@%nAvPUz1D
z>Y+F6E$Xk1@<2ymVD8(zDM0%?$OFBUIeA&YP@tj)><3x{6)LQgfc8LFpa;+c=mnet
z^Z^C}1A#k%8k3y7C}4JhoIKN-&}W{LX9x5u1bJYjMNXa{%@;*^pbsz-Xm5#fwa{Lm
z6VSdG)@3vg%%XWK)K?qr1O@`Lfv<py;#jZMLHmGHfRVsJpjQd-fj&S@UC5P0y+C(h
zC{SSy`|M#a&=wd645s-~Ie8I4Ctw^f5ST^zKt(;s*&t5Vhn{k<+X3yfg}#QUw-V%l
z_En+B5#{Y*PZQWtGbgX77X4NS>r0CDk#9!l3EJs|ycYcl)Hp#OFcg>!^lA?Kfq_7c
zGw47&prQrjfL?B>7wFy@{fIkr+n#7&OVIlw540T$JAq-qSHSF%(9;I>jDjAZJ<tj0
z^DF8HhE9duls*mXUZBTJjAMK7fqGyd@D;_`=!cFdHy?C&<d;EDC)lw9^#grY!7iYF
zHROTWKs`_q40)gisOb#*fObGHpcBvs*b^8C^a4f#{ebRkF+N?u2RZ^Hf$l)B137ua
zf$nFqh6mc>ek2&E$GR(w=CL+=1&l0@YiU=Mv&FiVVntj}f%HIFV29B(_s$BVDH@Y?
z-3Qq!$`mSK8fZir2K@G{K!J4)XaTu|70S3Eg`L5*hzf{<()%Lq%tsFajaD5Bx_uE$
zt%Du#L2s-rG)s*6iS<$?Ke6>!@e{iMwThZ!Vef0gPaNkLP~noOun1GC0?mPr=S7J#
z9PO?M9kD`b3`b2gM^j!bOzCSfzrYgXrAmKQfEs&GL+5j($aLNwl?3~6P<kzx5FzM{
zDCjPrhvlQ+0k1FUJ3$XsAtP%4-ZoNEi$EjQT6EEmwlUDiu#KuKFzer=N^U=F^SJ$)
z@dv$UJ~|!yuAsYv9*T3-pY8C$T4}FBtWYdbsj#$BELF4N^*2$`3r4gGL!*dc<ziKZ
zaBgABNEY^7mR{}^yP-E&)Ti1Ay*M1u*t4Jqf=<^ysui?85Prbln3X<8s;UtG(GK+a
zcr3!GAwTH4`BWvLi~c>TXur|^v_XS=VlA0}UORy9o{z3Y`C6d6g6@QK)s?pLxZ0{P
zKNU-qY(ST)RCHw#&4!H+s0AHwTHg{OZ&;r<=yO4Lf?hpP<xBPE8$W+JUIeJb<oA{1
z#e5T0dx(kPU?+lutq2a*A~@s=3iiJ0`6f$@{gnYKYFB0SZ0OUE`=Kl7TF^~nu|~%E
zdmpZabF`KDFn48t?#clsDp&AiSEddf%X;C8$_D4G7kEFc1kVe44f}!h59oHn4pjgy
zP&g?4Ea<lR?4xGrKzD?mK%A>ap*-&#&3t3k0+2+XP)oU<Lbzwi%Ko(8%Ao5%L)U_y
zoR3c9y94O%s5i_ERVrz{`Nr!T<2%NU#lAQH!hHKU_9+xwq4PQH^GL$I5;ZHoZ2?N&
zOSZnUFU^;IN!5x*PCL<Ww!)XJg)e>LL#p}eCB{%!g*M}#r7&3Z`X;32A{T-SoZl0~
zt<Tx{J$)Evq|*OT(C63x%G5>RUrqqohg9`&4xgoVx`0ppkIv6e`tuv@WY_XgGu0vJ
z`2Hw{7=fyzVaJrezc8-fV@I~Bs`n51oI-)+p`t7N-s>gi-N*fb5l~oI`^x?`U!|IZ
z0>YcDg*UzTA{3?vo!?ubFYN87^HK-;&d<;jKo9*4{UPYV`RFu`(fAw)dMM66H-5};
zTiDA6Dbhr>1m!GjWy|v~tf&^YZtM%a$<S+02_p9J*<i}r<qdvTK6_|;SAwq3N3RU}
zZlTW!=LUAtRfD{!qqm8Q1eD8$ye-b<dVP&mSZyjqFPpM*Iimi2<t+1;tBiF6wdZT)
zXb5kQav$1D2j9Y0Wk<nOLE|Fj)AlMXU{)S(Sn|i7@A1*F0xA{8^ZVxtABeC5hHF9*
z{|jOMl*7F^Y?Ti>9+g4&%16Hgx)$`|pa&|E`N6iZUUFBh_@VH`o8oTR64jA^mnPl=
zto?;?&sO2ne$j$%ZTd027R0*J@}N6W6(9OVI7CelE#6P_-N<>Oye-Oy;u4^$*8IK9
zQu%)9v)3dx8M9TYG}_=VUS7oH6n8t>DtdicO0P=UKP0Bm!d@%*uLjTFJaDeM?TioT
zLYpwhm{EaB74GgqkY^j`2P%Dy*}R_s`MB~Q_Zyubqd~W(&-5@aRXeC&dg1%Q`$D}+
zRSwqt=={*D484lq`_)1Ov4h=Vw7EZM8|x`2)nwYRA6)l48Cs@t`nPF1^6%0FJ#3u&
zB9QFNH_miEO#nUgGxQ~(2j`<xf7=RrAm~mw7whc&_Y`=V`{_LeEl%sZBjf?^4?0g%
zK=6ZJTb!$sr1xWrc}K<Mse@AyAB!SB3j0(CQ62}?QyFwGS<jBI>+wYSt|;$;@;*3M
z`O@+%G}x<XD?Z%+mP1ayTPTF{{I|S(R@pC6;a(Y60=X>BLk$QzVXqU`yQ;b$*~KQ7
z_1Ev4m{DG;M{rpSdvUS<;tiDCS==ZudIPnT-9W((dRRfrXk1wxi{Y8`_g^oVEgq`1
z&}1>3-A`J0sn9%yg@+1J0|ts%^No*vJbZC~$DjGAX2P`jg;a~6=Df=OUsM+GUGm(o
z<`%>HqWH)0kUF3@=&veqy6WxEpz!kHpl1s@BMN#n=vkoK%0!?I(jCwPp`W%*j@9xy
ztScp<vQY5#jL&0kfU&AAvf|!GTs}0Qw*D-&fdQ3jVe1_&^iF|2in6Gq3+xxy2^Agx
zLP~nQpldCSiSZ-_8%0fF<)q-LDtrZk?~as{0;g&$l#@cIYKkZ)?VPHrg0@7nD@+Xg
zjAfr!*yK6SKJnC&y8%<q^a?#pv7t8Fzd86wmJrWzE+3R`h3|B{oX{UMSc`*Rp9+EQ
z*aq#XhNi4QWcrr&giU_mo}H7a1rd{Jdm=%u`h)F(9<(RyBW={~XxJC*jPGC!?56ZP
zpvN_b-E<a-gZf1d=n<{*`32fW*Q=EQHYF5_DDWe3u2A8@z5=TUrHVS@85VKQBlaQV
zf^r_M4a+T2;yI5KSkbIp4EKl8DEDd%{F6qjAH06zlCH3bG*c1W>;32jG}6rQ3JQfd
z*!beRxG9sdo`vpz$-XeP%HdzIFHHTZeRRBb!@l9O@{JdJy1?%*D1Qq0^gB|O61PSF
z=$~-M;AyIH&`sxw-!$r1fzzmehE7u@;qv%H^X<JJrk-n~emEKv+b<CQiF5g&^tqr%
zf}VfAd4p~pg!qTXt6DVvhW5bxs7Y*bMcWfOiO#pUNz{VmNvbON>hp)%13gT!p*Cu_
z7T4>nWuL~6uAuuY$9lzJ9@6m}4f@U%pC3OukCuQR0X~aIUzu;=DCe~D>+_B3OF_9T
ze22^WTg*2^@K#{Sab0l-nL8+_h=sif{i;73;o~doZrUabJ3JFp(Gw@tQ<j&XiGBUc
z7AN{dj9ztBTYg9i@yg&<=Ns#S4355NQgmrN&%T2GFhLWWerV_W`>fBdheSKCK#9dS
zE`OYSagRlx9`hy2cT1i8p}J_)`hE+q{gBkkACjs7=lOmMxvz-z-6v1(KVEo#==mQT
zFSgG9-tj_Tu=|YmSm(H2`*a=W3A)o~=zT$V6m(Ue22>4uemDVid(b_QS9JuP&ox`N
zM#2|}bfEF5h+YaYmFfZH+XU*X{7VJ#bpq3OR@CnSuBwQEKHO(3KG9bP#INhK!kvk`
zY~K}!f5|=<)HWCTJcPdYZT(K$XgrRF9@pLcz6x1(%*E#&(8EBdk37B_+gRB9{CCYP
z3b?DHsRw`eeLJf4L~36i*R#DmZmV|u^xhW4WENFFdN#}|v{!Y59KHmli?3MzJ<<E;
zu3|=L-p6v3Ve6Q1)Z<0#feuy25B2=$ch5zBsL{Ml`M-bhhK&<!aX*50iLz;bf9+bs
z`oKeV3&ng32ADICpI=Co0eh~nuYb>o#XtS-#JAx5LZXa??U$|%Y#b6$zdPPd%BIz?
zuK!sZ*nrSy-eMefq3o9*dGof~&sWjQ8%pwc(6<8C<9Ihp!zlbC1ke@qK+x&CYpO<{
zub;W%x4i!lXQYZj;qP}!Zgbp6-$!%1sij8K*xMdP@_Qay&}@)Q(QlEob6hNJjYn9R
zIs>|MaAh!seGYw3LQ#6q`PmoA5ATA}2%{Kmp=pC4MfFZV3I#okHoCcm#^1QPg>`@u
zs(n?hEwas&rHw3X&p2CHUjZ|=IaQr)=Bx6@V@zgKIK(t~rz{kxaJJAGJJTW><DSsp
z9;5`MK=7UDSVF}Ts(-1nxdr;SxdrCCGkveb*#hsBw6+K|R$8mjo1mdeJ5*_lDy?H6
z7mccEJ1V37K6rP{9_R8w=~~c(KSS>dde~>^qd|`X-LOBXp1GjwKSK`z{T1kj{zS`%
zgP#2vIt^A?`RH^E?+E=qK#Zfka=MXxxnSc#r=-&@u^y-6%tzLE9v{?}3}&)VG0vRS
z4O*yv7s%`JE*~3D$SXsP-|MG*Pw>6c@oplo-&T44<ND`<Z<~R28j$%}1h04;2Y(K3
z47}K9+mH00g`EBE&(}};>kjylcR%h&PtbEfj{rRk=hTnp!jY`!DO+2F8qHi|zP8Xh
zixACv%MDf=O+!t3-)MES)vZ=3tx{X2wMuWLZ*5_H4kBln>xCN4HJ+!;FG97ldEiMy
z#J!K7)6nO2-k_U;uE)7S{qVpg)K8bHTU&$~8+TW`nX5ZmsNF5qol2-XmsWQvr|w!&
z-L2}d*fv+%#I=cUb+y&CRtYT=TU*${Yi;4R2Bw7>Q`6`(!Y`?zm2*1_VZQYIjGdK1
z_xN9AXE^K$gFS}xf{tf2=sQ9GPmiYqE<f3yslPqwS^tIl!%>g@AD?MI=yst0$J>wl
zDX)C>PeA{-2Yoo`kvKQ-XUr#K<F;xyjk=?i+TB{+$wuATR^6qtx@#eIH`9Lb;#P63
z;KePkwMl3LFE;SrQ0Bc~5~bD9`F$4khUK$|`a=rnJO2y);ewTUcE0*)fAj@C>%ZI|
zG~OnlUi&Ou|8P#np+zARyaO~DPfO3U{(26+JNWjLFAmy|g>a)W9CUY?2&8oSK1isn
zPw-L@%eA0KQ9U$nzpqDG+lbcW%qlhZ(BR@~Q#ca8B`sap6`vI~>JJ1bMkw@w(325L
zeIVE~Lg^0#TSh4JfuLaon-2u~d+myvvL6W9xs*`u13}LS<v$SO7{T@fA(9f>X$pU!
zxKphI-(Lk<;VRHl?|RntoNKgejN6a2GQV=o|B`025vJp7gL^XT`{KI%VSL>U$G88F
zwETZbL%)4|JN!s1|JRRi4&G1k`@iwU{Qdvl_|mwYg7-{bVSH`*E$aJu{Ty_~Bm73|
zqquGCZWw?<Sr9ddh=G)#Y-V($gWlyseE(+=<93E~XE;-9a0T#S1cNKU6h<%z_$=^h
z3<ACrD`61u?HR!!;M+2SLBQ8Af<eGnP=c#reD|W1fntr{Dy?OD%d;)dwTy20acuuq
z`wiwkQ>^)~G>DEl;&uYwTM5MYhJG}@;|#BWfviIehBuTFl#7hg+J7{>27UN>5#u&L
zGQ0*C0C#4ILHF?CH5hMuR>EMs`S2Qyw}zGYhT(mG`Tj7xA5Hxq9^U^-gXjdN;~S3e
z``jP@-}rtyegEG-zBF#H#QPhXC*pZ29dsP@8P0Cdv+x^91@3b{thak=@=xQThS4UB
z&W(YF%V9R-+zcbP2QAaZFg|!uig7EA!JG<Yq@IS6*q)M<rHnNBC#UhV8y((<(l+UB
zK8h&@bA?s>iM5|p@rnLVn)8Y6pIH7$Fa2s5xJ+qF4DU=7j9_qGvZjQOt{56h@i^=9
z=~dzzwHf*^QzpiFWpSK5$M+f^jq_l`ZV6@P8FV}A$^M3|c4tKle8ZL!W*YW(Af<FO
z^aL+TG4?X--!MuVY}mo}l%kw(e53u%Hh3h~CY9a{wffQ+GnJpz`p=E|#D-5y_~+J+
z{<n_tN0*9!VT>`l?768o-rop*fpNxj8$9>)F;Y%d%MUjDf)oP&EBtmjjIQ7Q={a_`
zk+Pfe%g?d#2>qic|1{3zK)-7q-haV4d+s{R!jwKgu%hp0fG(cbIw{GA=e1PM0emkb
z{6-b$3MUH<1xjxZ`V`O^!GP{5%6rg);-KxL?|Vd`ych06{-J#?_)Vnp3D%8YdQR_*
z0)}tVsIc})f&M7`23t@2@BRI&aSx5#huiu{>dTsr9|&wBY1}^$LfNx{P9F$t9%(v%
zAUH7{T|N+e7@_M20)ODp?E@i{O`%|8_VBAse4DFn*uyVZgO&CF5+lbMP9ay;7Y56B
zCq^&`lOB}tQJCz>DHb0Z?@lTGMBr>0`|-mQrtlwYFbtin0!@DX!q4b>=?>ll3B_;l
z<LEs5;0NOk{eX{<fgkWuHt+)vHmC-Ez(?7@57?k;4E!LJHO9aXBAE^YKhQHjn57br
z^4s81K79ykc!y=+2mg~sPB8QXzx<=*!w3d`5KIXl`9UD1eD-qrjoJ*yoGGJ2OykvA
zd<5b@6x`|c(#66<*+wOYQH29YcfgOte<IM|C(`lvrQh?+r{D7!E2B*<tPxW*`0fwi
zA%+_J8qa5U%QT+Z(Dya)Uk5BcB2N!1a2-Go1N|GmUu03;+30I=>*JsG_W1Uq#;w1-
zZ2NC7+V|Uw!qvYVk3Vi#?{6=PN%*Z=joW>DS<Jd`R{I@2+w<Gie#aoVe!JGT-(D1v
z=v%wsJDSDk1wPx`;{EChpRNl$LD%P_(|PL+dKT#K=dIJn^EL#0Yy7u}EqynLt$#3Y
zefhj?Y-VANIm^DIXY*FMgg)(H>k#_Bhr<5TdHWFbDWKcaIPvxM6q~nB|MT<qJN&!P
zw-4@j%-deyuJwE7ZJTdb`yEdEJrVIc0_}Iq+wTY*|CxFF9nHcd;PXXQ8Q0HxpUztw
z(1SrYT+h>WwSy?H_-I}2sWDg^@uiT#+K8=u1{f~1ZP{8V{{l-HWW-)-XmizYE&N^U
zvd`CT+}&^i6P14f6PbSj!`E5{i?2{t!eDjB*E|NRI}cXEV0Gt22_JpSl*}mxi&gg3
zWB*wG3P&gLeWGh@%OA1U;HfjK$Z%22>M>mL{%Cuc+py=5+N${e2><OAO5^E=b@fN1
z?2&(znInAFRrL86$+m2f+*v6cqfO!$T;tzXm$8ds?`N@LHMk|wGlIcl_Z1@;_(~)r
z82AeBYy)5Mp(Q?AA7@j_KsZ9n1UK>3!$(f=t!5ZF0aIx>=HF-+hO;k{jUAp3G{Apl
z{qy~~(pUZEm4&0>jX8H8_8(H-R6qR>Fx;b2|M8|va1DFw>zh9DMi{%^pM{=CXI$6m
z3c!iIcffw9lmdD({yWTr(p9t)_M2t;nwfZ)mdmTE<9TZ<5$8~f9&G&&y6I==4xlSO
zLvIiItCpYY@dP~^bQh|4Dt`}>>h}iS?lXE;f^Pd6`fkvzK{tGVa3%Dd1>GL>K-xsn
zPW<PK9kSwg8uIV?K&5ZIe@d<OS*q!0sdP2=sRrsJG8Lz^eSK@7eXTJrIF}Dfp8&cO
z=uR>bNa;&J9}fBsJeQIWO5X~)Vn9ybEn0^-C|w77lvhsPIkaCsC_Mpm`rm1Xshl`y
z-#<j&?i}i+{_s9twF^*n^;Iu1=@;#K#^s93d1w5V)p&_XfU4CQm*|fOR29|ZP!r>G
zA%EO!w^Y?`iL!NoNo#*~XWs(KM#fY=#wC{PC;+ASm7Kpi0B<Gn-_dzP&y>qzo%-IM
z_P$Ev$!A>7(^7bM7-=iY=}}HW?Zz9cMw6D9E-lc5{y5LyBtUH(gKsHY#<slD@=VL~
zt?3-XqcHGjA;$NKZu6esMcf%zhN>Ls^@|bX@V@>ozG~0+)uR;lKUi1YsQi9o_4;y(
z`%3kqa*BDX#hTs46|u$fKqagAW>cKQ*JkjtCe#brk+<$k=NpWSRv3k-e|n=<>@-p9
zOq6;P^9Lr1zuEZ{Q#I)8&D8tNl!<2M>1K*Y?0mJk`ge2X6?5|&=88Yq`G$fO6pFV+
z)j^iZW0vM;EtPjIt1K#}SX~TuZ7Nm+r!mDS^JOvhVk_kyD_Z1;6+O?eQoplOZYoYG
zzZa+Hmy6?SCbxpN+0gbPM(XosczgRxd~+j}X&1TKkkuHOoK_t!XdsZc?q{P0)nV7T
zBKOPS+niLRP)o&5v+JsZ#T0QxHX9?i&=PDyKQ3FUkxwml!vtL3oq6kq8hJE`Gd^mD
zpMt34%@v!JYMc|LdVWFt5hXoeuTmd3SL|2)g!6|g^-gnzkD8tzSF2Z<E3T+3;5^V|
z+BGx9p#thT=8C@y>@`AWpBWX7HAB7P$Xi#!NJGcAn%Y(22<&ahTWe$#U{oFyKO^;D
z#T0?YON`H%EAFY(uZk+(snq_KibZOAzDxbk=ui>G=>qEWMU`_*)eDL$@0hBiiYRxP
zsX<RPQ>R0~%o^v%&DBsbyC9S<F4z{Qxdm&*Stt$^s*m$mh1JI_6k9C7{JV&GUJ>PQ
zn%40e#lE8S{E+1#Bb52lxEPM1;kkv8X-##1#WcfqEif{g(FTNFM(Svla=Eeks7i6g
zSe>X=?og@&)XKX`36ul$cL>=k^EWERLACh_wc@qf+}A`ATma;_0_vQC$_=LK^97Z!
zOw~)xl~J@;_nVs^H&>>ZSD9T<;ZNHbT(BZevkFpjXd(K!zYxgp8}YI48QNXQ$mFES
z986nw<gG*geu0#q4fDH9Hqoz-=)w5G1y;-9F>hT1qnh=8r7w`Hqm{}VM&lHUbYt}^
zrE;zk^*>gcZ&fMQs_5r_+DzG?ymh;bj5Zq89E4eAq>fiA&l&9i&qt|VT|l{&iat}C
zA1tH@QaLLWf2!2G)ye=hsIh8FeL_$DOw>^(%HK_J`oM%z{b+|BEkI9i6@XZnsrsp@
zGQkwo6=swgZiY~vVx|r;SLV@PJZVm;Y33+<u%LQDA?5XgRTPTf3Q=n0N8Oii?qY6M
zr&k4j<gG)#GN!U&K0m)|FPRNpgN=GM$K`Q>QRkh;ig!kMaB<bR1Wt1h5KR>em1>-C
zS7HoaD%D~5gDllnglV0LI?_~m$)p9ktbqEVsq$C>twND$YL5SD_BW%S+i0WEi!5r=
zu_|q3Wv@;!QgpODYNS|f1e32Ap~!nXt&J>$jnwxmVd?!=d0(yAK|AyPfh96KvV#Tb
zBuC9<j_!{+2GZZ;;mGbIa4g5r0FF*K=tbtkA?y7>;b*gXaYcSyB<NEF{wi>&Kv_>T
zd&;U%tP$8pU_*h`1=<LFCCthaxIv)5zzzauh<Yac#R<lM3aC`B{?#9xu2N|jO{iB)
z5#`nN4{~v+*eAX>c+Sh4n)YNAygJK{JAZTfLxIl)<_I)>!TDAKZ3GH&g-2;zZoYDa
z(tqvz4<26Z%f0_x1zz$0S^GV%{%7^uUi;7L*MCX>-~XO^LlH^-lZRL0=k>c+=YIcB
z=v0E2`x4q;|GfTxSDR$*+beO6ay~3y{t+%R^pN>E`SNDfKIRt_d3u{g4|i{l^p#6`
zWa)Xk<@gdI6w9%^rw9usytu;0oSz6#3>5mYwqyss;%0{&$9h)a3V1EJ&%(Q6^pLNB
za{Q8Su{5JNU#5q;^E|!vqlXv1JEeyi2ZdZ89#&u>f%|4r9@hz$m)n&s^2a)G!Pg?c
zSLpda`2S}Q=*xcox;InI6Muml1nw1hQedpWG=Yx=<_feB>#1@A>j-Qn&`n@}fnx;D
z6zDH-gTTE4PYR3`m?rSCz+8bAGx@ld6Ie%JGl6ab`wJW+aHc?ifg1$w6?jr$tiUvZ
zj|Jumw3sF87g$GNGl6ab`wJW+aHc?ifg1$w6?jr$tiUvZj|JumwD1x23#=osnLsyz
z{RNH@I8&g%zzqWT3Op$=R$!XI#{zQ&TFh3kqnyAx0-FhR6WCwi7=bed`U~73aIe6V
z0%HZH34AOtSD?ilQNO@C0-FhR6WCwi7=bed`U~73aIe6V0%HZH34AOtSD=Njs9#_m
zfz1TE3G6R$jKG-!{RM6ixL4pwfw2P91U?p+E6`%Ds9#_mfz1TE3G6R$jKG-!{RM6i
zxL4pwfw2P91U?p+E6`$|s9#_mfz1TE3G6R$jKG-!{RM6ixL4pwfw2P91U?p+E6`%T
zs9#_mfz1TE3G6R$jKG-!{RM6ixL4pwfw2P91U?p+E6`$rs9#_mfz1TE3G6R$jKG-!
z{RM6ixL4pwfw2P91U?qXYyJGE5hL?YxkRmOV|MB&&_!TZft~`r1qKQXdCKKNL|)dH
zAHBu>++2Z61g;bqB5<p~-2%e}Mhc7)7$-1Upk82>z-)o91S+0!J52>@1X>HMEYMz{
zkGOAKB2X*nP6Ay8x(n<n&_m#GfnEZq2=o!?Cvb_tl>$QqZWXv&V7Ne?z_S9Q1tthg
z5qL-7LxIl)<_J`Y`{+Uftpr*Nv=L}4u(CiqfwcrW2-FI65!hZ}SAl&6dJ6OsI6<Jd
zz_|jK2wW*JMBr9|y9I^|)CoK*Fj`=Oz!ZU50-p<1i195XP$SS<U}b^!0v!c933L_c
zF0ijaPl2NaP7vrV&`;n>fgu973fwI)T%b<iS%FakqXotZOc0nXP$B%^N}!!UCxMmo
zJqO7@Z)ucJBFWD`<mVLf^91?6U%o$=@1y1WUHQKBKYjoBiQTh(6!JY2<r&RZ7-=ZZ
zk<rIUzIQU@)AN7FVLZpj$m27LKv(#DhAxwg=ipl<bh^^m$OvZ?jp@TL&{Y&!-mqb^
zpg_i_4b69;-Nv^0X#a^U>@@O$V%q*lj;y_uPTNK4J`9mV`(!$bvcnkT<byMctUN_p
zjw0;`ifF%*>O(t$#tK`eN2$O~KI<n=SJInf@Kux#RGzIX@=mOr$@`mU)b~Gq(D5-G
zwtpHgBlrh(1Bz6RqOCwD;D7sI<4DH`{_2CuDPn{;((#l1m?8`}o{O+T`IryF4~)e)
zbNSiGQ9eaJ{(K(LJe8;8&;5tdnLm8&7e)$O7?ST$(t72GLHT(9m;L{54>13MKQW|n
zmiiZ+U|%@Em;H|UBg-33;Cyo6D@EK=inyixoPWw<D6bObRiZqLV>17r5b`Dpd)5vU
zg{wf1f0Fv2<fHTHgm(hiBIP?;w`kGC)~>Z%x9YYIbsXw6vaN4lufF|H^?tIo>paBM
z)^*?nPOpuZfogjW`G4B`8t6!>>&!P9jK>DdfC<bHgBzO|V?fibpBW7SyEUVp84Z%A
zQETv+;4QVftEC$H&t0t<iRG+i$8k7uY-=5FjIl$s31(Tq8*O3}jzfr?unB93J@#1}
z4p}(z9>?*59ma7W-WbDv_q}_&t6o=WB>qlv4t0*Ys=m7KzWd(0@4ox)dsQmsXUfg8
zH+eb!W~<XRznKW4vsH(%?Y+ei>>sI=oucR0Lnv5yje-rWo$I<pSQqgtBkyZm*VPEG
zwtBo&U3{tO|1~K7dK>69nO~eie65~?qsD8s@mg(M9^*Q^rW>#6#%sC}a+3em_mr3F
z3BA<x|0cW=)#cAsn)ykbn+<cGmaA&5>2^(3XSyb5ymIj}uc*4F^ZvBzD$Z4r%AA`G
zrD=}14d1I(LpKhdHQaKZ67W^M+*Dm&)x&SooyBhnH+WVn=9_ud<xV@LM!w=Y(?z6}
zJ1{L29Cx<h)|(E5EW4_!(5y9lh+s~K3m_*JlpnZh+42>yfTT6#f}bv(waI4EN76#A
zQgN$IYbN^QZt=fQ)a&s_vs^m#yCH$|g&J-DAOsOQ=pB>S;ZM@bJ|#In$gv8F)zcxN
z3*plXjP@u=dfCS$=SN9E97Invl3rruR{$g4l3w;j$yxS6fkYpe$%l?X+|iySNiX}5
z<UGa?M1G-@^VLXCdz|E6_BqLUfpa7I=}+WmSWPf4>1AJ)oMm5?<S*%^{D-advQJCS
zvagHMzY%|SdeS1QlaujBhwMX>v*cr*w)eZrJ#FR+rl02hHF92%4QQNz>VOUjN!@_!
zV0v|vevF;q=KO<0QZwdW(lM2q$3-x`?3<JGn}m?hlE1(o<@BvwzROp9PCVXvqLZX0
zA)h~iGvzN-iTkNHC?)4FNyTckv;IC0JedAb`lsDE<lH-|Z(BdoegfQ%i(vXw-)u6J
z^P*uV<XQ(?H@LW$(~EvB(SIMqv9!hTIi&B}KX(3qjz^Tgq~EmFq~EmFq_^A4PXAX{
z`YoJ(3#Yf~?fZwU^a)O%;PlH@gC{^AJRZdjNh<QozO$9{jQq0wS=dPaQm*eJZLs`H
zZ+(Ymzw}m<{tkK=I3&HCzmI3Z^s+DW&;=&_qgMM#IypaWrB7dE@=sr6(l1+U3W<O$
zbomVah?kUK^_ukhpS1&DzFl^N;s!@T|F(br1(#M4%|rTU?>OdUL#shMXldJND{rQu
z)7*ebztLiD-D-Z)_X5e4+HcYy>o@3mIPE}UskbdmO#4-%@;~-rlm4MyOvooY|M1iB
z9W5lucp7}N5!OP+$1uLJwU0N9pQH}GBZ!#mjTm`loC-eO2#uEUCyc*d$+!~6Hz^q}
z!uT6n<3SjIqZ0cb#$oJl3L@s37PiD52cK?KP!6%Tfd?D$kFdpl24J+)=`Fh$#y2am
zcVYYt*s;!v+o;Y|VyD9NZ&qS|!uVNA>`EB_MJ4tkjGwK<4utV@l=SZ~zC}sD4deI+
zY|<YC4>qcE19#?<^zs+Tld|fc`qxS7$1m6k-U48Q>a3r4X}q(3s2goio%NFePWdLR
ze1BEbx8;|9L;lJJwN-86a!G%jWj>1*pE&tHqWRz{+k4#V<3Hke1N3AQkAn=W-_v-f
z{C5E-`IlD0R^+R|qv{RJ6|HQGzFo>0yr1!Y&R6!qf0Xe-3;!D9Sqt9?F^K<ljQ>9K
z|1jg~EMu31KXo51599L2+W9bQgeNTeD}hsa<^8V(=D(Nd(JpCj7l@~igUshr<|F3Z
zW&8@p@yStrJfQis`}HE@UjrUhpCXUC-w>vmUgTM}<T(Wc@dnt9Ed8?<95N2SP2*eD
z1k=lS{cc>Wman|`mbCI+vGN^?;WMW5Jx%TVJ0njw^EpH~>Oaf%lV-fZ^ouP2`x&2Q
z`UR%<82@WczeNr6xGwGT1k*pq^yq2&_zB}%e$nX3t&9)Ak05#OWnA=Uitz_5{Bw*S
zv+%Dl{=XTg{z=E*GJc%#j~Q5rKHR|dL-vJ^K8Q#1+<10apQRt&WZ|MG@_wS-UfJ(l
zuK7y+jDu}dyZe+cjXV5;U_z%->Ni=QPjkMfGk!ngw^_KzBkxJt@=RFr{9}wf&$B!e
zPlfea_{;m3Hvgi<|13=6qsrR@oXVU0VVM7Z!cqTUvdZ-z7=OURTk`OGptd~ImOOtH
zBaiTr_eir`&(h!f9}BnR|73ao7t6!$oXTO~Ao)){2Nj6pzcHWZ8NZKl(epGei2gyw
z#g5&|_@fq{!ep7~e_-L)GX7Hw7d>D8k*Q~z7twJO({I{h<SZFjeTDHl<K&;x@i^lP
zjC1%y2T7vZ_e~h`seOOI`<-PxJ)iLv3-1CR#b<X6eh|3!E52fS){-fnDro*&RR1OK
z&~m?1|Kd9pjL$L-bEJ>o(m2K!ZeNk}^BO-*ZT@G&_&Dqc9baKw{oLTU8CV@-{5HmK
zX8cLUXL;YK;6K;+7PZXwa~9(e9j9YnMD=#X^M-$t4M&3UI`a`Ze?{YGspYMvyc3!W
zK6$`+g5T2>{fw*UIQ%I1M77Ir#NeNa!EcYj?*UHbee?xWUMUyN4+%eJ;SVtWpoM>f
z@kPcrb3HuH_=1H$#rU$t=Q!i{TKG>HU$StBsO6lu_@B;r-NMfY9#x;)nEtp$zk~73
zJR6j9?PXkMiGshE@fC~D`+-O0TVeY7O-2EQ56zFM{u5TdA7Z>NI5*gDFrE~g>;JbH
zPcxom{8PZA<oN@pUtoDQG5@<`=<jFxcb;M77ye&m{Ep2ApWuAI!T2Vo-@^E}7*8-R
zdiWUQi_Ayxr-4VwFZFqBYjl0qnZMMt)aSC`R(;M3&T>k9E-)_T#nd!Xo*RH~z{cHq
zwtFJ~?*b?LDf`rynEzjD`m@wL+l>jv<M@A%`QK#me?1%(;xGH(SD4Rbz&GG+-jy}-
zAJz0*)PlvoF8ujDec}I~n1A}0!uBvuetf+}*U!xsfBGLJB){y}m-=~@`7f@K|C`a!
zRR4<>|8C&KU)}={{^Ob+v8}hPP5uus|2r)HpJe{>eu3~`V*V3r<o_`9U$Xc=$^7NL
zg=KEvQ{Z@0`!27M|3#X9i@Mk1KL}jw55K1`@)wzZg5SfP;C$oS_k+xT+2a3s<}dGA
zi2V04|M@lYkIQ$x_#-;s)6~jkVY~4o;8Aua4zFRNO?LbE8u<vl>RMaAzs~&A<A#3m
zWYYj~^2FhvVm^vLoC0;y$BF1SuaW)^=AU5tg%>I3mqpH-!}aqp@Thj#hJb?}H<@1I
z^xJ`xKF|LP`>TeXN;95(-rx&d5BnKkKq@*C`WN4%V|<zEh5sbuOH6;F`uu?KVfqQ?
ze*<umUu`uWviQAm?GlII1U{?P&%|2||AoUQ<EL1jg>y}L^|#LP=vl_o7aCmZ=Xu7D
zF`j0JUg~W#f5#)i<&yeITKE|-wN&0T%OmxcU_5K#Cn{I^H>1n7cp0}N=23J=xt4cC
zmn++EaQ&@k&`Y`IuV6l!i&9dqMaD&bDOZB!5nRfZwD7ogTrZyFdQ;DsdRXC*@VkLW
z>BARd@TD01ff)RoG58ZP_&>(rufxa3qU7A7KT7sv_Nuw^ak_wU(|g<a#f-NRbCqJ;
z{w~!Oj4xRUUaowviplp{;8ErEfK%Lcg6G9)mg`21pQcXZ^<>ejj|11^^%F)v*{mpu
ztH^h`7P+6^%KR6ZKf~%S=C7DPERjC$WBx0=?!CbH!<v4JTH*0s7SbMP`ud8IC(ZOv
z1CJ{2hO?vb_3Hn6>CZ&I<R9AWEM35<K3m@*;tINw>A%-w{6nd?f5-HTIaA&VZiX8)
z{Z@5{RnMPg{5A{!@67*)7XNQB|N7O2agzBzsp)_GLdW_MKF~w*%lDD=H}cU2rvoSd
z(EfhdTQq*A+RSkbZZ35(^HKa=sd<jW?9}vVcT3KLjQ_yGs~Z3D3--F$QQ&VQKl~>q
zN73icGM;`r_w0+z^S@^N*q?^!>3<HL2|nr(Q!#0-p9JHH#|)n=<0*|xDck4kVsIZg
z$+>9ddw&f5BN{(NZNA22DCPQL4E;s~>WP2->2SH;&UoTajQq!0)HHA^?-GwYJiS*3
zG~O<cTusH`A7Va<-!}Z0S)soeL;oYDU%r6pIfHXC&YVH(MBg@XT3J}U5;$D7j^pYW
zd`jc+)7}>5|7pf2&NcXoIjQ9sKF<RudEVJ;`YEbiA7>+QO7*sKv$>acnP5EmFcV^4
zO-B>BE*HnKW&ZvNrk_7<1exc0yOr?;tKI(?IJNK67Ytv?_dCo#%XUEcKdbo|+Tic`
zSfC|7^Us9&3<D=Q=UL8s*}p9Ur}8e)!XggQ{|fMgM#4Wg#^4K@PneeO?vBC#9QYaV
z>sB}pBjduifs_2{{YIVy2jZXCd{C|@O&-fE|Ah#Ell+MlgHM=~>d`pg1WtQn@JZ%#
z{HrG4B&V5UT;0b2+lQxO_`L3XlBaXu!YLX*MI|2z^G|3zARu2}9)lkQuG{y^hL7mU
zA2MFI@bp_rp3cJsPJFVKp4<YQ^yH8=?%c!l^LH9vlJ8F#U$*r2yhL=qsTh1v<7oHC
z4F9w_sb2+t2FBmI6(1-A*Y=J3k+jzb1+Sa>Nt=_pi}5tmXO%hb*Ert<PCwK5DQel$
zhchlP`7ZGHGo>EhE;xS|QSc<=$M}1Uf?vt_asCcrn)4phct8-o^keXk1E=;%Jkz5o
zPx?Q`(0qycr|&ijE8i;r8^-6ko@Jlk*>8((uOx8Nlcjr%AR_-^#uxkz`oU)OPdaXn
z;qyg}gU?n&zhubOQ_M$iC<7+^&wIP6=M~<^xrA|@j!QLeu7kfd;3Ve+>vMu1ev<hl
zEPHz!<Hs6Co@J*0CgT&|=5jIqIOFvNgR@yzXI>axZ<lHu{)UzBKn#6}=~r$s{H4?W
z8gMGt@qaRcNd5d#44;2yKG}!D^q2fH*N@eXHvy-9bezA>JJ03)I@7OM`EI~)N%Zr7
z5w4#%YMc`XPLnbCTnzp(;8flu`+G}V9e=Co;s4Nv798?T{^N{KaCy`EDgF}!{6Ug)
znehbU?_j*ndX;4Sa>mnNGl10d`xws-ntUhFq;%96U*Yy;wNM`c4wddW7KQ&?Oo6go
zuE#arL9U)-`uP=p_C|9ae5WbbLfy!-g7_mHIpBP00RAm8{i3CZ{~oy3t3Ne_Qr<fm
zU-^Q;7f&+hO&6PdCq88aUpBBx0w?>N<#kdfS80uJRhupU>N?Gb69-N{^Ur?I@Lx2=
zQy&3Na&G2+o#r%OV)~WO82aN(zY@d$pJMRjySP68Z<x<MjRyqe%Z~yld6unuyB#>y
z!?ZO{k=-TxywCCvzp44dZ>gGm#b5n7^Iv$*WSHQ5&%MORS>J35s{hv{p1n)sOcXfn
zXZocBhJM*(qY5$fzXm)?e{NwuE8jH?SnbqZF?{}B^MRlLNWYPW<DhT4)X0y2?5go4
zmh}K|s?YRY1`s{`Fw@uRA8g{ta{K<a;9oQJi{_;M7&z6l>VrYRvFU*~=<{QmUSEcO
ze#Cr|R=@a#%Zxk=);RJ@z_s1`2g7ECxm~I85Nmxi$9&X1M*ayVIk}7YbRO@~IP~1|
z6GjC8E3P-Lhl7kKA27J+&-;OE{bW18!X5I{OmB~;|3%}S^4!n#3zq-$ZRVeR)}%?F
zY|a;NGxd|;dDAkpyiwzP6F4mZCpj1IG~gmX`+5xho06t|$E^KA0~$wsc<bv7hg;2Q
z3^=uydf43KRv(j$Pp}`JW&Ehd`6h7svl#qaz)Aik?xza#0ez&R+xMIp{1T00{&k*d
zN5$>+Uf_Cu^vfF!-%aM^$ME@L4E`4}_;-Ml{8{dIR8@2w=r;9sjQx<!23BR@)W5E_
z>i_qce)$O_e}cvR6X3*u!qWf8G(9s7oPNrD>~ZZBxV4*UA2N?4lH?rVXUa|BTmnw@
zhW}q;&{=aj3Y_Gb=k}6veKLm6oiX@x8i(Hg55sqX+iRpZTAtfAj(mR@Zr^)=>-N2X
z<zzk&F@2Klo5=Yj<LUcNzS6G`^hM|UpMmRn!T&>tqT@M}&x4x&6m<;$1cDBzu|B@e
z`21(hy{zwCwB6{#(tC{I5r1Gi<BRM^rA;!mA2{VZY|S4hm_EV&_7c;795}Vh%H2jD
ziOZd_Bf4Cd04MroORqkp>ESo>yhiHnGr(zFp0LK{JD5KGkP$@a|3>31T;TL~OrO|b
z>OuccaXkMSaFQo+osoa(43p?$41a{zEq&Vsoa$$u^*POXT*LH<KQw%@Y*&8<oa|VZ
z_faI6{?wg@|3uEvFR*>+15SFC=JjG_hC{UvcvOG6PUGPJEyG9Z;V|PXTtAZUhhz9W
zAoMpG0fo;wmm4{kEPp8poXWMtb~w%D8f1LJ(*J9LlO0%Qy<&3ZFnxmO(UR}=8W*be
z`GZWKwfO%&<4ZiRnK#v;?gUQlc#QpF;r}e-*?SCc!4Lilm+L;mV3D()0#1BZta`YG
z>9fZSeS+!l);Qk;PA6Xx-Hy9s@DIk|pVK(Tol}iIudo@q3pmL+@wCZQ%JoDHpOdaM
z<z2MqgQo)Lt`Lx3sf5s5dbOSL<KO3cV?SrF<^y{^$pXS&&~dG%H`l@6S?04~$@3xM
za|`o%y-D>uz^S|o?1xBszbW*ajbB0gfa&-?(=R<^?&r-(ZFqO|IJF5l>G^T)7s=C2
z0!QPVIB=Q+uH~`fcwc6Gk?{#mbJ}|h{V}WGoeeyyzwgjE^toc{Im>+J7*G7A0p_{>
zABo}fB=8GhSNB=-zMixxZ~7k$AF0m)jT<cZ`#z1so<C^h;clQN89y%ZQkKWpxav4Q
z0i5cs&ixU$`uKZXQ2nnwZ1^uRpQkl$XoA0Q7~t`O%e9XmUId)@Y~~m6WIolU@gN6t
zeGPDuXY)_Yz0||6GoLK$XOfeC3^<KbH}W{e?tuCn^O@)VxWMZBl%~hL(i&%9(EK~)
z8Q5jyPyT^<ChhxQ8PERN2K^w-8Q-t*&iD8pVETk5zbfR*WoN2Vt2%x&-)O2rqv<zi
zN~NxXa-7}c2gaP?q1?FR;BGK<w|{rwQL*Msm1~oEe726hbKvA>W)(hLP%pbpx7fA4
zr+25K2aZ>q#a&-YnU5zFXDXFB$tN>9sI%EKHZYQL<c_kD>vk^sqY65gT4TzYY}E2a
zuj)6w=1kK?LA>geGt>0SzEjV8jp<6oxyGd=!?mfh>-$-N`$k5(3I(-4e<bg`1Rl=e
zs<#^jMZUw{^={dluGNbEg%=Lz1_zXL?P#vK{fN$bsK4p@%|hOHbNQiM(#d27Q<)=C
zggIv@*X$+1hq9@Zb9i#D=?*j+`MGR9Luq@Fmd@K(<8dMeFGuF7UT4H9dC(u!z1wJJ
zMt3?6KEvS@W@l479H&}qRG<-F({1EY`9oQVoa=|wm9eXE87zCM+ZjalG-`9ys6)e(
z$xH^!iUvc<RyD3#H9NpOlQ}Z(<aUMFOB<}3nCdm3%XG*li4UXF4~LtLRLyZN%%G)n
z&3?!6YWj;Ij^JFxmqW>h@F@~6U-oWr_vP#5T63=Mw$#kI@L*D{QHclL$(gDBqeGot
zp=;Rb_R7gpxt4F%^M&i(W><GArKX(fOa(3MH65}Qepf2hpX}{QcBOh$E?+H9)@G?A
z>F!1ssE>o)sE||=-IZ(rx<<Azd3aLV8_!epd`H907oAG2=t$2P%QaKIlX>4OI9>_b
z;N~ks1z@SdbiUy<8+otk4;3<*Y^yH`(~{TljeK3H?(Y61#Ov-QDRvfW)g$Azp=vYN
zs;+DMo3-oRDynj=8G=r<Am>xx^D`MK4)t-UuQ4zVq<0~6p2QsN4tMZqsy6DuUdHuH
zVHsyLM5?&-EwR_%Y5iP^`)s=g19q*5!WKi_B7bDoDa}+1O?+mDOhYqYh3e9sPYM#D
zXT80BXshmSRu`m(QK>g-lMZ+l!G7Fnw|N%UvsL*qY5bv5TpDVjvR8FuMCseEeBWKK
z{HZwk!E4>}Bh4!E4`Zww_bP7NAT)HhBR%YQ#wO8ETo)QDw(hE&5A!Mgs<v9c%78BE
z<lHhwtd!pz%E6w34Go#3@}&4=VN=^-_l?PSW~$x?W?V9wJKBx%>PfQ0mV^ZE?vZMM
z{ek+mM<5cvLsT==uBV#pPS#V&*HJ-ht!ArAd8mc}dT8(P3tpW@?MF>woc7%e6{B5)
z)mjnSgnDarIkaw%??O9B#e%v4qZqE4)XoTHO{I!71UZFr4VeWzplIr(p@yee&mc#C
zQcOOatH=~<5Mg)Qieii@Zz~tw*}C?4%lXEX>m13KXI!TT<A)Cirrf^Q)J+$5I<NiA
znMt_GhJ`m-LH#vq=#1)U13r&aLAS|Ixfl@fQO1hg@@K(jU}Km7!)h~Mu1zWXo)dyA
z^tcH6e7#Pdt@*H6;3<78tP^dxejV!XhM(k(SuT5iQzRo>?NsqGGhdMF-8oZe0U$%Q
zW*A{$?ZfceFOSF*fi)<_JVr`Qq4~Gc>N>0Bo6~qq6(77WTlaFSTgfRjaqoLmRaA$6
zy+X#S;#Jw#RD{(^B`1}d#FyJ{a2qvzjSaOxpHHJZ)jV2r>V19sT*W!q;M;puu)T3>
znwGS~nR2Vh*cpHC0SCz(D_uxYkkCPvJ}0kD!KiAn_YLjcmmAtUGLXAU4IkJGIHQK0
z=44r+`MWV;a!aK^qLN89T;diq(h$3nh;y|<`Ou`Mwa|W9<!H{`QNwIcfH`y6M%B}3
zZi7BH{B6}qa>d-nHn-$;W00Jgb*kRfbhA9SZL*QC7N#$QWk^mnx8bYjJ^1i>uaitA
zacqNz7u_S<s6}z<Z^J;2Ddn~!<$QH&n^!HAXNvANN8dX1UGFXr>Z3pKU9TN2_3E~C
z3iuYfTZOJS%=jBYLLWuXHw)9IMzmLYLaHD^|A}*Ak`v?<NfpTH#6@C?)$@rYl5C(f
zsbqI-wejOsGKi!Ia<8w>9gk1Iy@Nuyn`U3V#aH2Nl7|U`tovhYg;MsfCUz7-fOUM0
zAmOU@5%E00w|6y(dru&+{XDAkr;_UB?d;Tjw{>-`tJ6pL{(Tr`!KpYrwQpdYzVF#N
z4aK6B;}J<UmL%2P|4I~3n<#hI!AN?vmj)hZkUszE;1-yR0l}-{OP?^B%E9y$gDs6R
zMem4L#K51Kt)p-T_p0zJ@MThG9K@K8>O%Y3+EG)aSD<M`_97`BWY;od3ZHMNpbSOG
z;OrZ4eDi2%bdOW$O6~0H#vtFTt{%;g2JdxKz2Z`r+<bF}MuBpE3X&J<Gr9xtr97qX
zkJy7M<^5*GtrY5W?Hf3#xWP=SdmH^AAk(NCf)G~Lqk0G`Op^<DFqd(1xlFgd7#TUF
z&tsXrYV^RkGc-Cho*7gJN5>8f4`&7uAsrbS*A#)LBo$n|ic_m&+KZl!fe~Nog|}Cj
zhEIk;AFAUbJXY-5iK<R^^{6QqF^u|*SA>xvs&=AgrLOXoA`$me>;=)6WRRTvFRG?i
zQk_9NPkPeTm28dw>{383?Nl@hb$0FwYVf`IG;OI1k-XVirw*^6R)yj=;SeSR=BgWh
zM_WAY4e0<3mCZ+F#hK2ROCT_1qz2?x^Yx(Z#3iPgIi+v&<|;&0Hm7UoKT?m{={1!Z
zouOAPdT^~N>P(;Ub@mP)*flWh9N4obhuFaQz^>s8MYY8X>2{`f;<o75AbYilPxo@f
zTcXcG2zO=mvd7A(oWb{v4vY-#Mz903sCMK>M~yJMF_9&T8^wo1qCx}F{7w`DPVK~;
zk92Ol?qHfz)0IV88|}-PX3)iEPr==RoG`&oI!<%C0lR_zGu50n6QAr=g>-uF@X)T^
zhYmSCupLy$TG`JOJK>J9pHS8w$Xdi?O^ZpBRJcYu2S1<7bY^YzPWmAA{QZWS=6)xZ
zM}k_WCE_QVs4G#6UZ+g@gZeBYzEt5nobImfE(#8f>X;xkZAb2r(^!O0^)xv!@zq>f
zk(^Z{q<uWQw)5)l(Scl=CizYYU4t5tVr*kqwPLE-Lbl?;Kgaw!wHwh>MD}+h{+jBe
zP^$TOHpc0)o56&&0y`Tnsb8%(Q2C`Wir`*M&VD%O!#d~gRK4L!Fwh8V3F&#+fj+GP
z=tr#x2{fe8aOq>&*{ec0MKN@2He4Z7=;|Cy--XbJKdjZ+e|c7gD87MO?1+OSqAo>i
z$2oP>J)liwWYF2dYD|OLT2__7r^D_75pxLJ3w1=qJd@pn$acS1^L5?Os#Lgsh|cb+
z9EollF9}<tTv$3lG#|l9ZF0?WMS~`{n6i@OfrUm|>f3+B8FQx)iEtac%Xy5#n802;
zia=Ojfd=f(u7V(fC7_9|AO{}NoNfegX>p;WiX)=PMA(A?u)P8ih%)y(LkFBaL&F(R
z1y>PpTP$boUhI(gjiyt|du2=YjfiMFnqy1MV_hm1y=Fs8kGYx2-DZhp48>@#K<@R9
zxYgD|(J(atxeL@ZwNf!ZXNjo4ZQnL!G9lN)TwylvG%)tUQl!%`?E|}poD`fD(^9=O
z_I5Uu9RWtDaHlg=M8||Dp<~G%p+hWnjyPB>LMW#g9fb6$DQwQ|=;>O+uWOBRpHLnI
zMOh%}LA?}|U)u=N8tvmp;Xog*klPgQzjnWD*>Cb9Xni@BaYU!?NUVJj3VzmPQ0I}X
zRI9sHOMR~0S@aNeBkdaNr(ZKQGKybkl`ltFGgM!MsV74a7!{1EKWrz*n2zKjE8n*M
zAvnhPa{x8mF~cTUhZqC>f`Xnh-k0Fu1a3@ViCjo+!L<F!H}uMgZ`mx=zYitBLPX~i
zJ>=3qoS^Xti&&}chx3Knq?fOv6Z5bu*4;-%^`LLoX_{fG<K<aYMZu`oBgQ@JS;M>T
zfNk4v9M=;$Z>u=8)YcJeb=a2DguRmbX?aoI+h^)<{3#YL9!vo)rgmYxvDA)TUULLb
zuo&wUYcp_Cw3nbg8q-y6(Z%ORT+{L|eYlrAjJB#b*DPZttaCw{){%Qq7g)Hi$-4D8
zmZJI`={*6L*zUNpw5xs1@PJQ#>j-s{DCf!QCMcwKo?1Fd%iqzSYpR>PO2;>=_ZjqA
z#3X2I%HhN4W>8OBzTVyGs&)#;-bl-Z&<2oJU^-Mj(#a)L8QCu4WZ11zAfJEzt<W()
z&^t1C_X3Th?Zs5>i0tv)a?u~C7Dq4*$BdM8DpJnCzJS#_K_AR9nPt6tYL^M9p2<Yk
zP%6a=k5%+$rn^64K`n<Teg>N~G#6-M<Yt7p(V*p!P`x&=y`odSwK`-1Iu4HwUQ=ZV
zvuF%7kbf*UN&AwZ@8j4j(9!lezf&bjSf#dy5sdA!%|aAly<3b5vRQ#5E=FICnQZmp
z?p~VmR!qZUrd!WXdWdg$u1~6%>i2vHJ*yWXqnSD_jkrac5eq95O2V|)IB)?K+T&52
z1ba&0(c<3=@z_AYH@N$7YZ@30Iv7z*3Lsfq_+UD{T`8-WJRc@+d%)!BNd#HE!`c{V
zjrDe*xD-{%WDDY%wv5rsvJs|LC^H>YeiM7~tWtz62hC&5blg@}-ec8ajSsVKi+Z#y
zR?FF0ucE+3%60R;mL%pPai%i7TCGL~4k6q(nsJ6RqkG5qVa^ktLF$cqW-pMgeu{r|
z%vo9?6)cbFkO~wZy>|5-a9CZZjcq-v$l9l;-n4NByYjG74CCq}tXu7vj8lGV*=QBv
z%9`P&NOQV+P_e_F7?%9jGY^mQDrCEz9u~u{WaJFmjQ6PYXpb@&;Rpo}l77LXc}dAD
z1SiANfzf}lUgUQ8bsa+rcX$a-Q|KC2g94B2?;!<TJ{nqW1BrbUWFjos)U>W>6Pwh2
z`&yc<)7p}HQ!ppwS;F)erpId|bjo7070qVitPMFE-dJ}sU~K>)K#$FWmc?n=a1?9x
zU92Rh)H9VcsiVrFvAI~wAm%jJ#3(#9ialgUU_<S)6eGRl66TV&{}?ty<XvICoT^pq
ziuhv2FX`^51~g%e_KvVRHhCgqLH=Q|MONKe71<)M)_$!MZtbChAYQi9c(9nvMtK35
z9)u1$9J`>Bnm|w2u+lp<>`2uKwE=Nl^pEWnlQ->Db&s}ZHYSvO*zO~GYfX3xhlyse
zN!t_cbq^7Nosa8^*BJYc30q*ZIeD3ui(p(5YorW`zRsQC>rlwJ0C9(z=<X-a(<_X)
zl}RXl+fgp=frW#~-~oaB99oir45=hsj@>g21of_O^>1TGY1+od6hn|G9NbBCZ<#p7
zIiQ_=2o+eV9qDi*WA=nb?ZZ?@qT|)jD7Pw;nD*>5GAtb#t1ttW8IzpW@)}1c*U;H|
zDUfLQHd>(Rh`yk%BSa0@wDr7Cu>Re_p)LKSfRWP}noR14p+TsK3C-HHOOFmAcLN3N
zK`X`XLWE+PO>26=2p+lB&%!naoR9$jZ4+^4dJ9Ica_wwwBjwGmm@gyTg120-70R8Y
zcw>9zp%r9;V>y;{Y&)f0KH5bfodjc!f4x^f>W7^UbpKjksXXIP+l?O@Y*t<T=_Mth
zH8BX-;|w9Xe*geB+DlJi|9?HNCB%oI+ZI9B8UiG1nL^e&rjS>yHitAuhHOZ$S*F!?
zKiscEegmxSUKg<-J$)a?7R7ZL@U@gS+wkzF6Ji7hbwp~ni+3YP#Zl?(qpj)@thJG-
zM_HXFwY}4G(?jmM${06DwcE3`et>ed8UX83@P)1UF!oHeFk0(x#i~&uaj~nQL*8C;
ze6@U{xIOH;1<6P69Bp*lwmLi+o;9p$tnPd16^(vaa2-3x;!{lQywnkGh;AilA1&*R
zdGY2a5Q~U>;R0TL<UpxQFK)6dkCU4`#gSHR*rsbxMCbx_gHTnya?3O?_7#ATPLp2(
zsiT$+J6|M`lzI}J6oX#OcP<LHCi+PV#<pThsZeZb%_d_9LQ~qbi(~R4?08(Sw~S?|
zwPhwAn61GQ^VU>Y1KaTKHY?w5m3HgsDj;%I(t8rZ!*EB^j#nvpGBIp)%8G5aCvL0G
zE`s4#UW*_z9gdT}2wrh9RbE*t)atEm^tzG58A_}xb{CFR9pVqHpCtAAoMv8UI)Nu(
zt)sQ0H%Qm&#(H5kViSedl{JldQQ;&CeL_<Zh(#14yujSj9aI4At%;~ZHbk)vK~X8Z
ziE1`0O=6*6uV`BRheO~LxP;3XR#5cX?dW#&N?Rx%-0ImB!lTV>8sM;)nFr~p?j)kY
z*wWrnIL;GuRi}2e>fDgjTTIJ&u_m4R*%|WeSV&0HLW1z4$a9FF81L4E*o0qPE$w=I
z!8jYjI}zHu5R5;h7n5K+tTBmN^ToY-Wi;XCf9VQ*X=g`{A`qRMAH%x2TA-|mKv~KP
zly$5|uBXD+=8od^ds)dqNvcQfu=BO>B$I=fqVLm#H1@+7*UZGXC;-?>pYgJJETqs{
zN~+Ji0Ic7}^h`W+r+Kp*iyc^HIaoakcMltR{Fw?(Fm~_8=D(zD`hndxU4!F$SRltR
zP`IA<$&t5X_co*Vt4G3H(K=C}$k*g)t<8kYcR3uHGOLxeVX$-UJ#JxbRKFLc-D~V;
zh0;<)|HbT^5>sXO+G52>hZlE-b~)Ezoo(pA=+MX>qvg_RCG~n^SVdV6YmLRh0JX_O
lZ1<{@%2(3)Xgjm3tiGCv3Jf%MEwU-5Eg=Z7Yt<^L{|`FDOqT!v

literal 0
HcmV?d00001