diff --git a/dedupe/dtw/DRAFT- Write up_ MP java Code.pdf b/dedupe/dtw/DRAFT- Write up_ MP java Code.pdf
new file mode 100644
index 00000000..cb407a3f
Binary files /dev/null and b/dedupe/dtw/DRAFT- Write up_ MP java Code.pdf differ
diff --git a/dedupe/dtw/DistanceMatrixCutOffAssumption.java b/dedupe/dtw/DistanceMatrixCutOffAssumption.java
new file mode 100644
index 00000000..407c3bc8
--- /dev/null
+++ b/dedupe/dtw/DistanceMatrixCutOffAssumption.java
@@ -0,0 +1,371 @@
+import java.io.FileInputStream;
+import java.io.FileNotFoundException;
+import java.util.Scanner;
+
+public class DistanceMatrixCutOffAssumption
+{
+	static int[] ZeroCounter; //static members of the class which can be accessed anywhere
+	static int[][] DistanceMatrix;
+	static int[] LongestZeroString;
+	static int[][] LZScoordinates;
+	static int[] DataSetX;
+  	static int[] DataSetY;
+
+
+
+	public static void main(String[] args) throws FileNotFoundException 
+	{
+
+//QUICK TEST CASES
+		// int[] ArrayY = new int[]{1,1,2,2,1,1};//set of values that should have different LongestZeroString and ZeroCounter
+		// int[] ArrayX = new int[]{1,2,2,2,0,1,1,1};
+
+	// int[] ArrayX = new int[]{1,1,2,3,2,1,0,1};//set of values that should have different LongestZeroString and ZeroCounter
+	// int[] ArrayY = new int[]{0,1,1,2,3,2,1,1,3,1,2};
+
+		//{0,0,0,1,1};//
+		//{0,0,1,1,0};//
+
+
+		   int[] ArrayY = new int[]{1,2,1,1,2,4,4,3}; 
+		   int[] ArrayX = new int[]{1,1,1,2,4,4,3,2,2,3,4,5};
+
+		// int[] ArrayX = new int[]{2,2,3,3,2,2,2,2,2}; //set of values that should have different LongestZeroString and ZeroCounter
+	 // int[] ArrayY = new int[]{2,2,2,3,2,2};
+
+		 // int[] ArrayX = new int[]{3,2,3,1}; //GOOD example of finding starting coordinates of starting positions
+		 // int[] ArrayY = new int[]{2,3,1,3,1,3,4,1};
+		// int[] ArrayX = new int[]{80,82,85,85,94,90,90,75,77,80,81};
+		// int[] ArrayY = new int[]{75,77,80,82,85,85,85,89,94,90,90};
+		
+
+		 FileInputStream data = new FileInputStream("/Users/samuelrapp/Desktop/DM/datasetTest.txt"); //X
+  	    FileInputStream data2 = new FileInputStream("/Users/samuelrapp/Desktop/DM/dataset2Test.txt"); //Y
+         Scanner scanner = new Scanner(data);
+         Scanner scanner2 = new Scanner(data2);
+
+        DataSetX = new int[11044];//I looked at the number of lines in the file
+        DataSetY = new int[11044];
+         DataSetX = ArrayX;
+        DataSetY = ArrayY;
+
+        // int i = 0;
+        // while(scanner.hasNextLine())
+        //     {
+                      
+        //         DataSetX[i] = scanner.nextInt();
+        //         DataSetY[i] = scanner2.nextInt();
+               
+        //         i++;
+        //     } 
+        // scanner.close();
+        // scanner2.close();
+
+
+
+		int HorizontalTraversals = DataSetX.length+DataSetY.length-1;
+		ZeroCounter = new int[HorizontalTraversals]; //count total zero/matchs in each diagonal traversal 
+		LongestZeroString = new int[HorizontalTraversals]; //tallys the longest continious string of zeros found in any given traversal
+		LZScoordinates = new int[HorizontalTraversals][2];//records coordinates(in 2 column matrix) 0 index is X pos, 1 index is Y pos (seems reversed for some reason)
+
+
+		
+				DistanceMatrix = new int[DataSetY.length][DataSetX.length]; //row then columns (incrementing the X values chances the column)
+				PrintMatrix(DistanceMatrix);
+				DisMatrixFillingDiagonally(DataSetY,DataSetX);
+			//	PrintMatrix(DistanceMatrix); //just a basic print function
+			//	PrintMatrix(LZScoordinates);
+				System.out.println("RESULT SECTION:");
+				System.out.println("1. Array index of most zeros: " + getIndexOfLargest(ZeroCounter)); //index of most exact overlap(ala most matching values/zeros)
+				System.out.println("2. Array index of longest string of zeros: " + getIndexOfLargest(LongestZeroString));
+				System.out.println("3. Starting coordinates of the traversal(on the grid edge) with the longest continuous string of zeros: (x,y)_" + GridEdgeCoordinates(LongestZeroString, DistanceMatrix)); //index of most exact overlap(ala most matching values/zeros)
+				System.out.println("4. Starting coordinates of the traversal(on the grid edge) with the most total zeros: (x,y)_" + GridEdgeCoordinates(ZeroCounter, DistanceMatrix));//converts the index of greatest traversal to the starting index(on the edge of the grid) of said traversal
+				DisMatrixHorizontal(ArrayY,ArrayX);//standard double for loop to create the proper distance matrix- to check agaisnt by horizontal creation
+				PrintMatrix(DistanceMatrix);
+				
+				System.out.println("5. Exact X & Y grid coordinates of longest String of Zeros (x,y)_"+ "(" + LZScoordinates[getIndexOfLargest(LongestZeroString)][0] + "," + LZScoordinates[getIndexOfLargest(LongestZeroString)][1] + ")");
+				System.out.println("6. Percentage Match relative to perfect match_(most total zeros)_" + PercentMatch(ZeroCounter,DistanceMatrix) + "%");
+				System.out.println("7. Percentage Match relative to perfect match_(longest continous string of zeros)_"  + PercentMatch(LongestZeroString,DistanceMatrix) + "%");
+
+	}
+
+//public static void ReadGoogleSlides()
+
+	public static void DisMatrixFillingDiagonally(int[]DY, int[]DX)
+	{//arguemnts are the arrays of data points
+		//Xpos = columns Ypos= rows
+		int TotalTraversals = DY.length+DX.length-1;  //# of diagonal iterations needed to go through every potential unit of the grid. Its the number of edge points we use
+										//13 is the answer for a 7 by 7 grid. 
+										//its equal to the number of edge values or length + width - 1	
+		int TraversalsStartingonYAxis = TotalTraversals-DX.length;
+		int TraversalsStartingonXAxis = TotalTraversals-DY.length;
+
+		int shortersidelength; //determining the longest possible diagonal in the given matrix, ala the length of the shorter data set
+		boolean LongerSideY;
+		int difference;
+
+		if(TraversalsStartingonYAxis>TraversalsStartingonXAxis) //the Y axis is bigger than the X axis
+			{	
+				shortersidelength = TraversalsStartingonXAxis+1;
+				LongerSideY = true;
+			}
+		else ////the X axis is bigger than the Y axis
+			{
+				shortersidelength = TraversalsStartingonYAxis+1;
+				LongerSideY = false;
+			}
+
+		if(LongerSideY==true) //to make sure I get a positive value when taking the difference.
+			{
+				difference = TraversalsStartingonYAxis - TraversalsStartingonXAxis;
+			}
+		else
+			{
+				difference = TraversalsStartingonXAxis - TraversalsStartingonYAxis;
+			}
+
+		//int CutOffPoint = (shortersidelength/2);//setting what value with result in a corner cut off
+		int CutOffPoint = (shortersidelength/100);//lower cut off, less traversals removed.
+
+		int XstartPos = 0;
+		int YstartPos = 0;
+		int traversalsFromMiddle = 0;
+		int ZeroCounter = 0; //index of ZeroCounter array- it is the same as the traversalFromMiddle untill TFM is reset after half the grid is filled
+		//with evenly sized arrays the X value will always be Odd so we have to account for java rounding down by adding 1
+			
+		for(int i=0; i<(TraversalsStartingonXAxis+1); i++)//goes through as many times are you need to traverse the middle traversal to the bottom left corner.
+			{	
+				if(LongerSideY==false) //X is the longer side, so it must be accounted for in the assumption
+					{
+						if(CutOffPoint>=(shortersidelength+difference-i))//this code would cut off the Matrix from filling itself once the traversal length was less than half the maximum diagonal.
+						{
+							//System.out.println("Skipped");
+							ZeroCounter = ZeroCounter +1;
+							continue;
+						}
+					}
+				else
+					{
+						if(CutOffPoint>=(shortersidelength-i))//this code would cut off the Matrix from filling itself once the traversal length was less than half the maximum diagonal.
+						{
+							//System.out.println("Skipped:::");
+							ZeroCounter = ZeroCounter + 1;
+							continue;
+						}
+					}
+
+
+				traversalsFromMiddle = MatrixHelper(DY, DX, XstartPos, YstartPos, traversalsFromMiddle, ZeroCounter)+1; //if the Helper returns the traversal count we can use its value even if the method is creating seperate variables
+				ZeroCounter++;
+				XstartPos = traversalsFromMiddle;
+			}
+
+			traversalsFromMiddle=1;
+			XstartPos = 0;//give new starting edge index values
+			YstartPos = 1;
+			
+//System.out.println(LongerSideY);
+
+		for(int p=0; p<TraversalsStartingonYAxis; p++) //traversals from 1 above the middle to top right corner.
+			{
+				if(LongerSideY==false)//X is the longer side, so it doesn't need to be accounted for.
+					{
+					if(CutOffPoint>=(shortersidelength-p-1))//this code would cut off the Matrix from filling itself once the traversal length was less than half the maximum diagonal.
+						{//+-1 because the values start at (0,1) instead of (0,0) in the for loop above. So there are fewer loops to reach the threshhold
+							//System.out.println("Skipped->");
+							ZeroCounter = ZeroCounter + 1;
+							continue;
+						}
+					}
+				else //Y is the longer side so we have to give it more buffer space
+					{
+						if(CutOffPoint>=(shortersidelength+difference-p-1))//this code would cut off the Matrix from filling itself once the traversal length was less than half the maximum diagonal.
+						{
+							//System.out.println("Skipped----");
+							ZeroCounter = ZeroCounter + 1;
+							continue;
+						}
+					}
+
+
+				traversalsFromMiddle = MatrixHelper(DY, DX, XstartPos, YstartPos, traversalsFromMiddle, ZeroCounter)+1; 
+				ZeroCounter++;
+				YstartPos = traversalsFromMiddle;
+			}
+	}
+
+
+			/*to know when to make the recursive call A know how many grid positions must be filled before hand and count or B know the final position index you will land at
+
+			if the length/width of the DisMX grid are equal(THE GRID IS A SQUARE) the length of the longest horizontal(corner to corner) requires sidelength amount of sqaure traversals.
+			The longest traversal of a grid with sidelength of X is X operations. Starting at position (0,0)
+			starting position (0,y) or (y,0) (where sidelength>y>0) takes Sidelength-Y operations to reach its final grid position
+
+			ex with #s: a  7 by 7 grid's longest traversal is 7 operations long(Starting at position 0,0)
+			(0,1)=6op (0,2) = 5...(0,6) = 1 same with (1,0)=6op, (2,0)=5op....(6,0)=1op
+			longest traversal(starting at 0,0) is maximum the length of the shorter side 
+			
+
+
+			for a sqaure the longest traversal ends at (sidelength, sidelength) (the perfect diagonal)
+			starting position (y,0) ends at position (sidelength-1, sidelength-y-1) //moving towards bottom right corner of grid
+			starting position (0,x) ends at position (sidelength-x-1, sidelength-1) //moving towards top right corner of grid
+			//we do -1 because the side length starts at 1 but the indexing of the grid starts at 0. so we have to adjust
+			*/
+
+
+
+	public static int MatrixHelper(int[]DY, int[]DX, int Xpos, int Ypos, int traversals, int ZerocIndex)
+	{//the matrix helper function does one complete diagonal traversal of the grid
+		//It compares values from DY/DX arrays
+		//int XstartPos, int YstartPos are starting positions for the traversal
+		//traversals is a arguement that keeps the matrix aware of how far it is from the center diagonal
+		//ZeroxIndex is the index of the zero counter static array(for data collection) It matches the traversals counter until traversals is reset before the 2nd for loop in DisMatrixFillingDiagonally
+
+		int SidelengthX = DX.length; //.length is the actually amount of positions allocated in memory so index 0-9 is length 10
+		int SidelengthY = DY.length;
+		boolean test = true;
+		int ActiveZeroCounter = 0;
+
+		while(test==true)
+				{
+				int DistanceValue = (DX[Xpos]-DY[Ypos])*(DX[Xpos]-DY[Ypos]); //the difference between the values squared
+				DistanceMatrix[Ypos][Xpos] = DistanceValue;//put value into Matrix
+
+				if(DistanceValue == 0)//found match (maybe pick a larger range ala 2-6 to allow for puedomatch)
+					{
+				       	ZeroCounter[ZerocIndex] = ZeroCounter[ZerocIndex]+1;//increment index of total zeros in diagonal traversal
+				 		ActiveZeroCounter = ActiveZeroCounter+1;
+					}
+				else //found non zero value
+					{
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//if the String of zeros currently found is greater than what we have previously found for this traversal
+						{
+							LongestZeroString[ZerocIndex] = ActiveZeroCounter;//change the value of longest Active Zero counter to the active zero counter
+							LZScoordinates[ZerocIndex][0] = (Xpos - ActiveZeroCounter); 
+							LZScoordinates[ZerocIndex][1] = (Ypos - ActiveZeroCounter); 
+
+						}
+						ActiveZeroCounter = 0; //reset the active counter to zero 
+					}
+
+				//leave loop if the array indexs being called match the final position the call reaches
+				if(Xpos >= (SidelengthX-1) || Ypos >= (SidelengthY-1))//-1 is because array index starts at zero but side length doesn't.
+					{
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//Need to check in senario when the traversal ends in a match/zero
+							{
+								LongestZeroString[ZerocIndex] = ActiveZeroCounter;
+								System.out.println(ActiveZeroCounter);
+								if(ActiveZeroCounter>0)
+								LZScoordinates[ZerocIndex][0] = ((Xpos+1) - ActiveZeroCounter);
+								LZScoordinates[ZerocIndex][1] = ((Ypos+1) - ActiveZeroCounter); 
+						 //the +1 is needed because the ActiveZeroCounter could potentially give you a negative 'coordinate', 
+						 //If the zero string makes it all the way to the bottom, the (X/Ypos-activeZeroCounter) < 0. Not possible
+						//It isn't needed for the strings that don't end on the final position on the traversal because the +1s are happening within the while loop. 
+							//IE. These coordinates are being calculated during the same loop as the final zero is found, but in the case above the coordinates are being calculated in the loop after the final zero is found.
+							}
+
+						test = false;
+					}
+
+				Xpos = Xpos+1;
+				Ypos = Ypos+1;
+				}
+
+		return traversals;		//so we can keep track of the position of the traversal
+		//we need to know which travesal we have just done. To know where to start the next one
+	}
+
+
+	public static String GridEdgeCoordinates(int[] array, int[][]Matrix) //Gets starting coordinates of traversal based on largest value in array
+	{
+		int LargestValueIndex = getIndexOfLargest(array);
+		String coordinates;
+
+
+		if(LargestValueIndex>=(Matrix[1].length))
+			{
+				coordinates = new String("(" + 0 + "," + ((LargestValueIndex-(Matrix[1].length)+1) +") "+ "value: " + array[LargestValueIndex]));
+				//if the starting value was in the top half of the grid
+				//this is because the grid is made middle to bottom left corner then back to the middle line to top right corner
+			}
+		else
+			{
+				coordinates = new String("(" + LargestValueIndex + "," + 0 + ") " + "value: " + array[LargestValueIndex]);
+			} 
+
+		return coordinates;
+	}
+
+	public static int getIndexOfLargest(int[] array)	//returns index of largest value in an array
+	{
+	 	 if(array == null || array.length == 0) 
+	 	 	{
+		 	 	return -1; // null or empty
+		 	}
+
+         int largest = 0;
+		 	 
+		 for(int i = 1; i<array.length; i++)
+		  	{
+		    	if(array[i]>array[largest])
+				   { 
+				   	    largest = i;
+				   }
+		  	}
+
+	  return largest; 
+	}
+
+	public static double PercentMatch(int[]Array, int[][]Matrix)
+	{ 	//takes in one array, and a matrix. Finds the percent match between largest value in array and shorter sidelength of the matrix.
+		//We are determining how many matchs occured(or consequetively or not), in the best case, vs how many could have
+		int IndexOfLargest = getIndexOfLargest(Array);
+		double ValueTotal;
+
+		//no given traversal is longer than the shorter side of the Matrix-thus the longest traversal is = the shorter sidelength
+		if(Matrix.length > Matrix[1].length)
+			{
+				ValueTotal = Matrix[1].length;
+			}
+		else
+			{
+				ValueTotal = Matrix.length;
+			}
+
+		double ValueMatchs = (double) Array[IndexOfLargest];
+		double PercentMatch = (ValueMatchs/ValueTotal)*100;
+		return PercentMatch;
+	}
+
+	public static void PrintMatrix(int[][]Matrix) //prints the Distance Matrix given a Matrix
+	{//Print out the  matrix in nice
+		for (int i = 0; i < Matrix.length; i++)
+			{ 
+			   	for (int j = 0; j < Matrix[i].length; j++) 
+				   	{
+				    	System.out.print(Matrix[i][j] + " | ");
+			    	}
+		    	System.out.println();
+			}
+			System.out.print("_____________________________________");
+			System.out.println();
+	}
+
+	public static void DisMatrixHorizontal(int[]X,int[]Y) //standard approach to creating the distance matrix via 2 for loop. horizontal traversal not diagonal
+	{
+		int[][] DistanceMX = new int[X.length][Y.length];		
+		for(int i=0; i<(X.length); i++)
+			{
+				for(int t=0; t<Y.length; t++)
+					{
+						System.out.println(i + ", " + t);
+						DistanceMX[i][t]=(Y[t]-X[i])*(Y[t]-X[i]);
+					}
+			}
+		PrintMatrix(DistanceMX); //prints the Matrix it creates at the end
+	}
+	
+}
+
+
diff --git a/dedupe/dtw/DistanceMatrixCutOffJumperAssumption.java b/dedupe/dtw/DistanceMatrixCutOffJumperAssumption.java
new file mode 100644
index 00000000..a7672549
--- /dev/null
+++ b/dedupe/dtw/DistanceMatrixCutOffJumperAssumption.java
@@ -0,0 +1,416 @@
+import java.io.FileInputStream;
+import java.io.FileNotFoundException;
+import java.util.Scanner;
+
+public class DistanceMatrixCutOffJumperAssumption
+{
+	static int[] ZeroCounter; //static members of the class which can be accessed anywhere
+	static int[][] DistanceMatrix;
+	static int[] LongestZeroString;
+	static int[][] LZScoordinates;
+	static int[] DataSetX;
+  	static int[] DataSetY;
+
+
+
+	public static void main(String[] args) throws FileNotFoundException 
+	{
+
+//QUICK TEST CASES
+		// int[] ArrayY = new int[]{1,1,2,2,1,1};//set of values that should have different LongestZeroString and ZeroCounter
+		// int[] ArrayX = new int[]{1,2,2,2,0,1,1,1};
+
+	// int[] ArrayX = new int[]{1,1,2,3,2,1,0,1};//set of values that should have different LongestZeroString and ZeroCounter
+	// int[] ArrayY = new int[]{0,1,1,2,3,2,1,1,3,1,2};
+
+		//{0,0,0,1,1};//
+		//{0,0,1,1,0};//
+
+
+		   int[] ArrayY = new int[]{1,2,1,1,2,4,4,3,7,5}; 
+		   int[] ArrayX = new int[]{1,1,1,2,4,4,3,2,9,9,9,9};
+
+		// int[] ArrayX = new int[]{2,2,3,3,2,2,2,2,2}; //set of values that should have different LongestZeroString and ZeroCounter
+	 // int[] ArrayY = new int[]{2,2,2,3,2,2};
+
+		 // int[] ArrayX = new int[]{3,2,3,1}; //GOOD example of finding starting coordinates of starting positions
+		 // int[] ArrayY = new int[]{2,3,1,3,1,3,4,1};
+		// int[] ArrayX = new int[]{80,82,85,85,94,90,90,75,77,80,81};
+		// int[] ArrayY = new int[]{75,77,80,82,85,85,85,89,94,90,90};
+		
+
+		 FileInputStream data = new FileInputStream("/Users/samuelrapp/Desktop/DM/datasetTest.txt"); //X
+  	    FileInputStream data2 = new FileInputStream("/Users/samuelrapp/Desktop/DM/dataset2Test.txt"); //Y
+         Scanner scanner = new Scanner(data);
+         Scanner scanner2 = new Scanner(data2);
+
+        DataSetX = new int[11044];//I looked at the number of lines in the file
+        DataSetY = new int[11044];
+         DataSetX = ArrayX;
+        DataSetY = ArrayY;
+
+        // int i = 0;
+        // while(scanner.hasNextLine())
+        //     {
+                      
+        //         DataSetX[i] = scanner.nextInt();
+        //         DataSetY[i] = scanner2.nextInt();
+               
+        //         i++;
+        //     } 
+        // scanner.close();
+        // scanner2.close();
+
+
+
+		int HorizontalTraversals = DataSetX.length+DataSetY.length-1;
+		ZeroCounter = new int[HorizontalTraversals]; //count total zero/matchs in each diagonal traversal 
+		LongestZeroString = new int[HorizontalTraversals]; //tallys the longest continious string of zeros found in any given traversal
+		LZScoordinates = new int[HorizontalTraversals][2];//records coordinates(in 2 column matrix) 0 index is X pos, 1 index is Y pos (seems reversed for some reason)
+		int PercentageLongestTraversalCutOff = 20; //percent of the max traversal that is still considered a length possible of producing a match
+
+		
+				DistanceMatrix = new int[DataSetY.length][DataSetX.length]; //row then columns (incrementing the X values chances the column)
+				PrintMatrix(DistanceMatrix);
+				DisMatrixFillingDiagonally(DataSetY,DataSetX, PercentageLongestTraversalCutOff);
+			//	PrintMatrix(DistanceMatrix); //just a basic print function
+			//	PrintMatrix(LZScoordinates);
+				System.out.println("RESULT SECTION:");
+				System.out.println("1. Array index of most zeros: " + getIndexOfLargest(ZeroCounter)); //index of most exact overlap(ala most matching values/zeros)
+				System.out.println("2. Array index of longest string of zeros: " + getIndexOfLargest(LongestZeroString));
+				System.out.println("3. Starting coordinates of the traversal(on the grid edge) with the longest continuous string of zeros: (x,y)_" + GridEdgeCoordinates(LongestZeroString, DistanceMatrix)); //index of most exact overlap(ala most matching values/zeros)
+				System.out.println("4. Starting coordinates of the traversal(on the grid edge) with the most total zeros: (x,y)_" + GridEdgeCoordinates(ZeroCounter, DistanceMatrix));//converts the index of greatest traversal to the starting index(on the edge of the grid) of said traversal
+				DisMatrixHorizontal(ArrayY,ArrayX);//standard double for loop to create the proper distance matrix- to check agaisnt by horizontal creation
+				PrintMatrix(DistanceMatrix);
+				
+				System.out.println("5. Exact X & Y grid coordinates of longest String of Zeros (x,y)_"+ "(" + LZScoordinates[getIndexOfLargest(LongestZeroString)][0] + "," + LZScoordinates[getIndexOfLargest(LongestZeroString)][1] + ")");
+				System.out.println("6. Percentage Match relative to perfect match_(most total zeros)_" + PercentMatch(ZeroCounter,DistanceMatrix) + "%");
+				System.out.println("7. Percentage Match relative to perfect match_(longest continous string of zeros)_"  + PercentMatch(LongestZeroString,DistanceMatrix) + "%");
+				
+
+				//System.out.println("8. Percentage of Longest Traversal," + LengthofShorterArray(DataSetY,DataSetX) + " , that we care about finding...."+ PercentageLongestTraversalCutOff + "=" + (PercentageLongestTraversalCutOff)*PercentageLongestTraversalCutOff);
+	}	
+
+//public static void ReadGoogleSlides()
+
+	public static int LengthofShorterArray(int[]X,int[]Y)
+	{
+		if(X.length>=Y.length)
+			return Y.length;
+		else
+			return X.length;
+	}
+
+	public static void DisMatrixFillingDiagonally(int[]DY, int[]DX, int cutoffPercent) //cutoff% is the minimun % of the longest traversal that we care about finding continious matches in
+	{//arguemnts are the arrays of data points
+		//Xpos = columns Ypos= rows
+		int TotalTraversals = DY.length+DX.length-1;  //# of diagonal iterations needed to go through every potential unit of the grid. Its the number of edge points we use
+										//13 is the answer for a 7 by 7 grid. 
+										//its equal to the number of edge values or length + width - 1	
+		int TraversalsStartingonYAxis = TotalTraversals-DX.length;
+		int TraversalsStartingonXAxis = TotalTraversals-DY.length;
+
+		int shortersidelength; //determining the longest possible diagonal in the given matrix, ala the length of the shorter data set
+		boolean LongerSideY;
+		int difference;
+
+		if(TraversalsStartingonYAxis>TraversalsStartingonXAxis) //the Y axis is bigger than the X axis
+			{	
+				shortersidelength = TraversalsStartingonXAxis+1;
+				LongerSideY = true;
+			}
+		else ////the X axis is bigger than the Y axis
+			{
+				shortersidelength = TraversalsStartingonYAxis+1;
+				LongerSideY = false;
+			}
+
+		if(LongerSideY==true) //to make sure I get a positive value when taking the difference.
+			{
+				difference = TraversalsStartingonYAxis - TraversalsStartingonXAxis;
+			}
+		else
+			{
+				difference = TraversalsStartingonXAxis - TraversalsStartingonYAxis;
+			}
+
+		double shortersidelengthD = shortersidelength; //turn int to double
+		int CutOffPoint = (int)((shortersidelengthD*(cutoffPercent)/100.0f));//compare two doubles then cast back to an int.
+		//lower cut off, less traversals removed, more traversals total
+		//(shortersidelength/1); prevents-all traversals are equal to or below the cutoff threshold  MatrixHelper() from running
+
+		int XstartPos = 0;
+		int YstartPos = 0;
+		int traversalsFromMiddle = 0;
+		int ZeroCounter = 0; //index of ZeroCounter array- it is the same as the traversalFromMiddle untill TFM is reset after half the grid is filled
+		//with evenly sized arrays the X value will always be Odd so we have to account for java rounding down by adding 1
+			
+		for(int i=0; i<(TraversalsStartingonXAxis+1); i++)//goes through as many times are you need to traverse the middle traversal to the bottom left corner.
+			{	
+				if(LongerSideY==false) //X is the longer side, so it must be accounted for in the assumption
+					{
+						if(CutOffPoint>=(shortersidelength+difference-i))//this code would cut off the Matrix from filling itself once the traversal length was less than half the maximum diagonal.
+						{
+							//System.out.println("Skipped");
+							ZeroCounter = ZeroCounter +1;
+							continue;
+						}
+					}
+				else
+					{
+						if(CutOffPoint>=(shortersidelength-i))//this code would cut off the Matrix from filling itself once the traversal length was less than half the maximum diagonal.
+						{
+							//System.out.println("Skipped:::");
+							ZeroCounter = ZeroCounter + 1;
+							continue;
+						}
+					}
+
+				if(JumpingPreChecker(DY, DX, XstartPos, YstartPos, CutOffPoint)==true)
+				{
+					traversalsFromMiddle = MatrixHelper(DY, DX, XstartPos, YstartPos, traversalsFromMiddle, ZeroCounter)+1; //if the Helper returns the traversal count we can use its value even if the method is creating seperate variables
+					ZeroCounter++;
+					XstartPos = traversalsFromMiddle;
+				}
+			}
+
+			traversalsFromMiddle=1;
+			XstartPos = 0;//give new starting edge index values
+			YstartPos = 1;
+			
+//System.out.println(LongerSideY);
+
+		for(int p=0; p<TraversalsStartingonYAxis; p++) //traversals from 1 above the middle to top right corner.
+			{
+				if(LongerSideY==false)//X is the longer side, so it doesn't need to be accounted for.
+					{
+					if(CutOffPoint>=(shortersidelength-p-1))//this code would cut off the Matrix from filling itself once the traversal length was less than half the maximum diagonal.
+						{//+-1 because the values start at (0,1) instead of (0,0) in the for loop above. So there are fewer loops to reach the threshhold
+							//System.out.println("Skipped->");
+							ZeroCounter = ZeroCounter + 1;
+							continue;
+						}
+					}
+				else //Y is the longer side so we have to give it more buffer space
+					{
+						if(CutOffPoint>=(shortersidelength+difference-p-1))//this code would cut off the Matrix from filling itself once the traversal length was less than half the maximum diagonal.
+						{
+							//System.out.println("Skipped----");
+							ZeroCounter = ZeroCounter + 1;
+							continue;
+						}
+					}
+
+				if(JumpingPreChecker(DY, DX, XstartPos, YstartPos, CutOffPoint)==true) //this method checks the traversal in increments of the CutOffPoint Length, which is to say in quantities that we truely care about.
+				{//this jumping prechecker- assumes that we only care about continious strings of zeros rather than total zeros and finding every zero
+					traversalsFromMiddle = MatrixHelper(DY, DX, XstartPos, YstartPos, traversalsFromMiddle, ZeroCounter)+1; 
+					ZeroCounter++;
+					YstartPos = traversalsFromMiddle;
+				}
+			}
+	}
+
+
+			/*to know when to make the recursive call A know how many grid positions must be filled before hand and count or B know the final position index you will land at
+
+			if the length/width of the DisMX grid are equal(THE GRID IS A SQUARE) the length of the longest horizontal(corner to corner) requires sidelength amount of sqaure traversals.
+			The longest traversal of a grid with sidelength of X is X operations. Starting at position (0,0)
+			starting position (0,y) or (y,0) (where sidelength>y>0) takes Sidelength-Y operations to reach its final grid position
+
+			ex with #s: a  7 by 7 grid's longest traversal is 7 operations long(Starting at position 0,0)
+			(0,1)=6op (0,2) = 5...(0,6) = 1 same with (1,0)=6op, (2,0)=5op....(6,0)=1op
+			longest traversal(starting at 0,0) is maximum the length of the shorter side 
+			
+
+
+			for a sqaure the longest traversal ends at (sidelength, sidelength) (the perfect diagonal)
+			starting position (y,0) ends at position (sidelength-1, sidelength-y-1) //moving towards bottom right corner of grid
+			starting position (0,x) ends at position (sidelength-x-1, sidelength-1) //moving towards top right corner of grid
+			//we do -1 because the side length starts at 1 but the indexing of the grid starts at 0. so we have to adjust
+			*/
+
+	public static boolean JumpingPreChecker(int[]DY, int[]DX, int Xpos, int Ypos, int CutOffPoint)
+	{//Cut off point =  minimum length of continuous matching values care about.
+
+
+		Boolean EnterMatrixHelper = false;
+		int shortersidelength;
+
+		if(DX.length>=DY.length)
+			shortersidelength = DY.length; //finding max traversal length to set up interval length, aka minimum length of continious zeros to be relavent.
+		else
+			shortersidelength = DX.length;
+		
+		for(int i =0; i<(shortersidelength/CutOffPoint); i++)
+		{
+			int DistanceValue = (DX[Xpos]-DY[Ypos])*(DX[Xpos]-DY[Ypos]);
+			if(DistanceValue == 0) //if a match is found at any of these intervals
+			{
+				EnterMatrixHelper = true;
+				break;
+			}
+			Xpos = Xpos + (shortersidelength/CutOffPoint); //increment X/Y positions accordingly
+			Ypos = Ypos + (shortersidelength/CutOffPoint);
+
+			if(Xpos >= (DX.length-1) || Ypos >= (DY.length-1)) //prevent exiting the indexing values
+				break;
+		}
+
+		return EnterMatrixHelper;
+
+	}
+
+	public static int MatrixHelper(int[]DY, int[]DX, int Xpos, int Ypos, int traversals, int ZerocIndex)
+	{//the matrix helper function does one complete diagonal traversal of the grid
+		//It compares values from DY/DX arrays
+		//int XstartPos, int YstartPos are starting positions for the traversal
+		//traversals is a arguement that keeps the matrix aware of how far it is from the center diagonal
+		//ZeroxIndex is the index of the zero counter static array(for data collection) It matches the traversals counter until traversals is reset before the 2nd for loop in DisMatrixFillingDiagonally
+
+		int SidelengthX = DX.length; //.length is the actually amount of positions allocated in memory so index 0-9 is length 10
+		int SidelengthY = DY.length;
+		boolean test = true;
+		int ActiveZeroCounter = 0;
+
+		while(test==true)
+				{
+				int DistanceValue = (DX[Xpos]-DY[Ypos])*(DX[Xpos]-DY[Ypos]); //the difference between the values squared
+				DistanceMatrix[Ypos][Xpos] = DistanceValue;//put value into Matrix
+
+				if(DistanceValue == 0)//found match (maybe pick a larger range ala 2-6 to allow for puedomatch)
+					{
+				       	ZeroCounter[ZerocIndex] = ZeroCounter[ZerocIndex]+1;//increment index of total zeros in diagonal traversal
+				 		ActiveZeroCounter = ActiveZeroCounter+1;
+					}
+				else //found non zero value
+					{
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//if the String of zeros currently found is greater than what we have previously found for this traversal
+						{
+							LongestZeroString[ZerocIndex] = ActiveZeroCounter;//change the value of longest Active Zero counter to the active zero counter
+							LZScoordinates[ZerocIndex][0] = (Xpos - ActiveZeroCounter); 
+							LZScoordinates[ZerocIndex][1] = (Ypos - ActiveZeroCounter); 
+
+						}
+						ActiveZeroCounter = 0; //reset the active counter to zero 
+					}
+
+				//leave loop if the array indexs being called match the final position the call reaches
+				if(Xpos >= (SidelengthX-1) || Ypos >= (SidelengthY-1))//-1 is because array index starts at zero but side length doesn't.
+					{
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//Need to check in senario when the traversal ends in a match/zero
+							{
+								LongestZeroString[ZerocIndex] = ActiveZeroCounter;
+								System.out.println(ActiveZeroCounter);
+								if(ActiveZeroCounter>0)
+								LZScoordinates[ZerocIndex][0] = ((Xpos+1) - ActiveZeroCounter);
+								LZScoordinates[ZerocIndex][1] = ((Ypos+1) - ActiveZeroCounter); 
+						 //the +1 is needed because the ActiveZeroCounter could potentially give you a negative 'coordinate', 
+						 //If the zero string makes it all the way to the bottom, the (X/Ypos-activeZeroCounter) < 0. Not possible
+						//It isn't needed for the strings that don't end on the final position on the traversal because the +1s are happening within the while loop. 
+							//IE. These coordinates are being calculated during the same loop as the final zero is found, but in the case above the coordinates are being calculated in the loop after the final zero is found.
+							}
+
+						test = false;
+					}
+
+				Xpos = Xpos+1;
+				Ypos = Ypos+1;
+				}
+
+		return traversals;		//so we can keep track of the position of the traversal
+		//we need to know which travesal we have just done. To know where to start the next one
+	}
+
+
+	public static String GridEdgeCoordinates(int[] array, int[][]Matrix) //Gets starting coordinates of traversal based on largest value in array
+	{
+		int LargestValueIndex = getIndexOfLargest(array);
+		String coordinates;
+
+
+		if(LargestValueIndex>=(Matrix[1].length))
+			{
+				coordinates = new String("(" + 0 + "," + ((LargestValueIndex-(Matrix[1].length)+1) +") "+ "value: " + array[LargestValueIndex]));
+				//if the starting value was in the top half of the grid
+				//this is because the grid is made middle to bottom left corner then back to the middle line to top right corner
+			}
+		else
+			{
+				coordinates = new String("(" + LargestValueIndex + "," + 0 + ") " + "value: " + array[LargestValueIndex]);
+			} 
+
+		return coordinates;
+	}
+
+	public static int getIndexOfLargest(int[] array)	//returns index of largest value in an array
+	{
+	 	 if(array == null || array.length == 0) 
+	 	 	{
+		 	 	return -1; // null or empty
+		 	}
+
+         int largest = 0;
+		 	 
+		 for(int i = 1; i<array.length; i++)
+		  	{
+		    	if(array[i]>array[largest])
+				   { 
+				   	    largest = i;
+				   }
+		  	}
+
+	  return largest; 
+	}
+
+	public static double PercentMatch(int[]Array, int[][]Matrix)
+	{ 	//takes in one array, and a matrix. Finds the percent match between largest value in array and shorter sidelength of the matrix.
+		//We are determining how many matchs occured(or consequetively or not), in the best case, vs how many could have
+		int IndexOfLargest = getIndexOfLargest(Array);
+		double ValueTotal;
+
+		//no given traversal is longer than the shorter side of the Matrix-thus the longest traversal is = the shorter sidelength
+		if(Matrix.length > Matrix[1].length)
+			{
+				ValueTotal = Matrix[1].length;
+			}
+		else
+			{
+				ValueTotal = Matrix.length;
+			}
+
+		double ValueMatchs = (double) Array[IndexOfLargest];
+		double PercentMatch = (ValueMatchs/ValueTotal)*100;
+		return PercentMatch;
+	}
+
+	public static void PrintMatrix(int[][]Matrix) //prints the Distance Matrix given a Matrix
+	{//Print out the  matrix in nice
+		for (int i = 0; i < Matrix.length; i++)
+			{ 
+			   	for (int j = 0; j < Matrix[i].length; j++) 
+				   	{
+				    	System.out.print(Matrix[i][j] + " | ");
+			    	}
+		    	System.out.println();
+			}
+			System.out.print("_____________________________________");
+			System.out.println();
+	}
+
+	public static void DisMatrixHorizontal(int[]X,int[]Y) //standard approach to creating the distance matrix via 2 for loop. horizontal traversal not diagonal
+	{
+		int[][] DistanceMX = new int[X.length][Y.length];		
+		for(int i=0; i<(X.length); i++)
+			{
+				for(int t=0; t<Y.length; t++)
+					{
+						//System.out.println(i + ", " + t);
+						DistanceMX[i][t]=(Y[t]-X[i])*(Y[t]-X[i]);
+					}
+			}
+		PrintMatrix(DistanceMX); //prints the Matrix it creates at the end
+	}
+	
+}
+
+
diff --git a/dedupe/dtw/FileToArrayScanner.java b/dedupe/dtw/FileToArrayScanner.java
new file mode 100644
index 00000000..9851ae4d
--- /dev/null
+++ b/dedupe/dtw/FileToArrayScanner.java
@@ -0,0 +1,38 @@
+import java.io.FileInputStream;
+import java.io.FileNotFoundException;
+import java.util.Scanner;
+
+
+
+public class FileToArrayScanner {
+
+  static int[]DataSet;
+  static int[]DataSet2;
+
+
+    public static void main(String args[]) throws FileNotFoundException
+    {
+        FileInputStream data = new FileInputStream("/Users/srapp/Desktop/dataset.txt");
+        FileInputStream data2 = new FileInputStream("/Users/srapp/Desktop/dataset2.txt");
+        Scanner scanner = new Scanner(data);
+        Scanner scanner2 = new Scanner(data2);
+
+        DataSet = new int[11044];//I looked at the number of lines in the file
+        DataSet2 = new int[11044];
+
+        int i = 0;
+        while(scanner.hasNextLine())
+            {
+               // System.out.println(scanner.nextLine());  
+                //System.out.println(scanner.nextInt());          
+                DataSet[i] = scanner.nextInt();
+                DataSet2[i] = scanner2.nextInt();
+                System.out.println(DataSet[i]+"!1");
+                System.out.println(DataSet2[i]+"!2");
+                i++;
+            } 
+        scanner.close();
+        scanner2.close();
+    }   
+      
+}
diff --git a/dedupe/dtw/Old versions MP/DistanceMatrix.java b/dedupe/dtw/Old versions MP/DistanceMatrix.java
new file mode 100644
index 00000000..9e3833e4
--- /dev/null
+++ b/dedupe/dtw/Old versions MP/DistanceMatrix.java	
@@ -0,0 +1,240 @@
+public class DistanceMatrix extends SqaureGrid
+{
+	static int[] ZeroCounter; //static members of the class which can be accessed anywhere
+	static int[][] DistanceMatrix;
+	static int[] LongestZeroString;
+
+	public static void main(String[] args) 
+	{
+
+//QUICK TEST CASES
+		// {1,1,2,2,1,1};//set of values that should have different LongestZeroString and ZeroCounter
+		// {1,2,2,2,0,1};
+
+	//	{1,1,2,3,2,1,0};//set of values that should have different LongestZeroString and ZeroCounter
+	//	{0,1,1,2,3,2,1};
+
+		//{0,0,0,1,1};//
+		//{0,0,1,1,0};//
+
+		//{1,1,1,1,2,4,3,2}; //set of values that should have different LongestZeroString and ZeroCounter
+		//{1,1,1,2,4,4,3,2};
+
+		//{2,2,2,3,3,2,2}; //set of values that should have different LongestZeroString and ZeroCounter
+		//{2,2,2,2,3,2,2};
+
+		//{3,2,3,1,3,1,2,1};
+		//{2,3,1,2,1,2,1,1};
+
+		//{80,82,85,85,94,90,90,75,77,80,81};
+		//{75,77,80,82,85,85,85,89,94,90,90};
+
+		int[] ArrayX = new int[]{2,2,2,3,3,2,2};//set of values that should have different LongestZeroString and ZeroCounter
+		int[] ArrayY = new int[]{2,2,2,2,3,2,2};
+
+
+
+
+// 		int[] Temp = new int[ArrayX.length];
+// if(ArrayX.length!=ArrayY.length) 
+// {
+	
+// 		if(ArrayX.length>ArrayY.length)
+// 		{
+// 			//int[] Temp = new int[ArrayX.length];
+// 			for(int i = 0; i<ArrayY.length; i++)
+// 			{
+// 				Temp[i]=ArrayY[i];
+// 			}
+// 		}
+// }
+
+
+
+	// 	if(ArrayX.length!=ArrayY.length)
+	// 	{
+	// 		if(ArrayX.length>ArrayY.length)
+	// 	{
+	// 		int[] Temp = new int[ArrayX.length];
+	// 		for(int i = 0; i<ArrayY.length; i++)
+	// 		{
+	// 			Temp[i]=ArrayY[i];
+	// 		}
+	// //	Array1 = Temp;	
+	// 	System.arraycopy(Temp, 0, ArrayY.length, 0, Temp.length);
+	// 	}
+	// 		//MatchArrays(ArrayX, ArrayX);//if the two arrays of data aren't equal in length
+	// 	}		
+	// 	if(ArrayX.length==ArrayY.length)
+	// 	{System.out.println("they're equal length");
+	// 	}
+
+
+
+		int x = ArrayX.length+ArrayY.length-1;
+		ZeroCounter = new int[x]; //count zeros in each horizontal traversal each index is a travesal
+		LongestZeroString = new int[x]; //tallys the longest continious string of zeros found in any given traversal
+
+		if(ArrayX.length==ArrayY.length)
+		{
+		DistanceMatrix = new int[ArrayY.length][ArrayX.length]; //row then columns (incrementing the X values chances the column)
+		//Columns of DisMatrixFillingHorizontally = DisMatrixCreater
+
+		DisMatrixFillingHorizontally(ArrayY,ArrayX);//horizontally filling the Matrix, while counting zeros per traversal
+		PrintMatrix(DistanceMatrix); //just a basic print function
+		System.out.println("index of most zeros: " + getIndexOfLargest(ZeroCounter)); //index of most exact overlap(ala most matching values/zeros)
+		System.out.println("index of longest string of zeros: " + getIndexOfLargest(LongestZeroString));
+	
+		System.out.println("Coordinates of longest string of zeros: (y,x)_" + GridStartingCoordinates(LongestZeroString)); //index of most exact overlap(ala most matching values/zeros)
+		System.out.println("Coordinates of most zeros: (y,x)_" + GridStartingCoordinates(ZeroCounter));//converts the index of greatest traversal to the starting index(on the edge of the grid) of said traversal
+		//DisMatrixCreater(ArrayY,ArrayX);//standard double for loop to create the proper distance matrix- to check agaisnt by horizontal creation
+		}
+		else
+		{
+			System.out.println("The arrays being compared aren't the same length-");
+		}
+		
+	}
+
+	public static int DisMatrixFillingHorizontally(int[]D1, int[]D2)//int XstartPos, int YstartPos or maybe like a counter of # of traversals
+	{//arguemnts are the vectors/arrays of data points, the X and Y starting position within the Matrix
+		//Xpos = columns Ypos= rows
+
+		int x = D1.length+D2.length-1;  //# of horizontal iterations needed to go through every potential unit of the grid. Its the number of edge points we use
+										//13 is the answer for a 7 by 7 grid. 
+										//its equal to the number of edge values or length + width - 1	
+		int XstartPos = 0;
+		int YstartPos = 0;
+		int traversalsFromMiddle = 0;
+		int ZeroCounter = 0; //index of ZeroCounter array- it is the same as the traversalFromMiddle untill TFM is reset after half the grid is filled
+		//with evenly sized arrays the X value will always be Odd so we have to account for java rounding down by adding 1
+			for(int i=0; i<((x/2)+1); i++)//goes through as many times are you need to traverse the middle traversal to the bottom left corner.
+			{
+				traversalsFromMiddle = MatrixHelper(D1, D2, XstartPos, YstartPos, traversalsFromMiddle, ZeroCounter)+1; //if the Helper returns the traversal count we can use its value even if the method is creating seperate variables
+				ZeroCounter++;
+				XstartPos = traversalsFromMiddle;
+			}
+
+			traversalsFromMiddle=1;
+			XstartPos = 0;//give new starting edge index values
+			YstartPos = 1;
+			
+			for(int p=0; p<(x/2); p++) //traversals from 1 above the middle to top right corner.
+			{
+				traversalsFromMiddle = MatrixHelper(D1, D2, XstartPos, YstartPos, traversalsFromMiddle, ZeroCounter)+1; 
+				ZeroCounter++;
+				YstartPos = traversalsFromMiddle;
+			}
+			return 1;
+	}
+
+
+			/*to know when to make the recursive call A know how many grid positions must be filled before hand and count or B know the final position index you will land at
+
+			if the length/width of the DisMX grid are equal(THE GRID IS A SQUARE) the length of the longest horizontal(corner to corner) requires sidelength amount of sqaure traversals.
+			The longest traversal of a grid with sidelength of X is X operations. Starting at position (0,0)
+			starting position (0,y) or (y,0) (where sidelength>y>0) takes Sidelength-Y operations to reach its final grid position
+
+			ex with #s: a  7 by 7 grid's longest traversal is 7 operations long(Starting at position 0,0)
+			(0,1)=6op (0,2) = 5...(0,6) = 1 same with (1,0)=6op, (2,0)=5op....(6,0)=1op
+			longest traversal(starting at 0,0) is maximum the length of the shorter side 
+			
+
+
+			for a sqaure the longest traversal ends at (sidelength, sidelength) (the perfect diagonal)
+			starting position (y,0) ends at position (sidelength-1, sidelength-y-1) //moving towards bottom right corner of grid
+			starting position (0,x) ends at position (sidelength-x-1, sidelength-1) //moving towards top right corner of grid
+			//we do -1 because the side length starts at 1 but the indexing of the grid starts at 0. so we have to adjust
+			*/
+
+
+
+	public static int MatrixHelper(int[]D1, int[]D2, int Xpos, int Ypos, int traversals, int ZerocIndex)
+	{//the matrix helper function does one complete horizontal traversal of the grid
+
+		int SidelengthX = D1.length; //.length is the actually amount of positions allocated in memory so index 0-9 is length 10
+		boolean test = true;
+		int ActiveZeroCounter = 0;
+
+		while(test==true)
+				{
+				//System.out.println("(Y,X)" + Ypos + "," + Xpos);
+				//System.out.println("traversals = " + traversals); //doesn't work in secound half of the listing unless the traversal values are reset to 1
+
+				int DistanceValue = (D2[Ypos]-D1[Xpos])*(D2[Ypos]-D1[Xpos]); //the difference between the values squared
+				DistanceMatrix[Xpos][Ypos] = DistanceValue;//put value into Matrix
+
+				if(DistanceValue == 0)//found match (maybe pick a larger range ala 2-6 to allow for puedomatch)
+					{
+				       	ZeroCounter[ZerocIndex] = ZeroCounter[ZerocIndex]+1;//increment index of total zeros in diagonal traversal
+				 
+				       	ActiveZeroCounter = ActiveZeroCounter+1;
+					System.out.println("Active Zero Counter: " + ActiveZeroCounter);
+					}
+				else //found non zero value
+					{
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//if the String of zeros currently found is greater than what we have previously found for this traversal
+						{
+							LongestZeroString[ZerocIndex] = ActiveZeroCounter;//change the value of longest Active Zero counter to the active zero counter
+						}
+						//System.out.println(ActiveZeroCounter);
+						ActiveZeroCounter = 0; //reset the active counter to zero 
+					}
+
+				//leave loop if the array indexs being called match the final position the call reaches
+				if(Xpos == SidelengthX-1-traversals && Ypos == SidelengthX-1)//-1 is because array index starts at zero side length doesn't.
+					{
+					//System.out.println("time to break-TR");
+					//System.out.println("number of zeros:" + ZeroCounter[ZerocIndex]);
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//Need to check in senario when the traversal ends in a match/zero
+						{
+							LongestZeroString[ZerocIndex] = ActiveZeroCounter;
+						}
+
+						test = false;
+						break;
+					}
+
+				if(Xpos== SidelengthX-1 && Ypos== SidelengthX-1-traversals)//the ending coordinates for values below the middle traversal towards to bottom left
+					{
+					//System.out.println("time to break2-BL");
+					//System.out.println("number of zeros:" + ZeroCounter[ZerocIndex]);
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//Need to check in senario when the traversal ends in a match/zero
+						{
+							LongestZeroString[ZerocIndex] = ActiveZeroCounter;//change the value of longest Active Zero counter to the active zero counter
+						}
+
+						test = false;
+						break;
+					}
+
+				Xpos = Xpos+1;
+				Ypos = Ypos+1;
+				}
+
+		return traversals;		//so we can keep track of the position of the traversal
+		//we need to know which travesal we have just done. To know where to start the next one
+	}
+
+
+	public static String GridStartingCoordinates(int[] array) //Gets starting coordinates of traversal based on largest value in array
+	{
+		int LargestValueIndex = getIndexOfLargest(array);
+		String coordinates;
+
+		if(LargestValueIndex>((array.length/2)))
+		{
+			coordinates = new String(("(" + 0 + "," + (LargestValueIndex-((array.length/2))) +") "+ "value: " + array[LargestValueIndex]));
+			//if the starting value was in the top half of the grid
+			//this is because the grid is made middle to bottom left corner then back to the middle line to top right corner
+		}
+		else
+		{
+			coordinates = new String("(" + LargestValueIndex + "," + 0 + ") " + "value: " + array[LargestValueIndex]);
+		} 
+		return coordinates;
+	}
+	
+}
+
+
diff --git a/dedupe/dtw/Old versions MP/DistanceMatrixUpdate1.java b/dedupe/dtw/Old versions MP/DistanceMatrixUpdate1.java
new file mode 100644
index 00000000..3e21a193
--- /dev/null
+++ b/dedupe/dtw/Old versions MP/DistanceMatrixUpdate1.java	
@@ -0,0 +1,381 @@
+public class DistanceMatrixUpdate1 extends SqaureGridUpdate1
+{
+	static int[] ZeroCounter; //static members of the class which can be accessed anywhere
+	static int[][] DistanceMatrix;
+	static int[] LongestZeroString;
+	static int[][] LZScoordinates;
+
+	public static void main(String[] args) 
+	{
+
+//QUICK TEST CASES
+		// {1,1,2,2,1,1};//set of values that should have different LongestZeroString and ZeroCounter
+		// {1,2,2,2,0,1};
+
+	// int[] ArrayX = new int[]{1,1,2,3,2,1,0};//set of values that should have different LongestZeroString and ZeroCounter
+	// int[] ArrayY = new int[]{0,1,1,2,3,2,1};
+
+		//{0,0,0,1,1};//
+		//{0,0,1,1,0};//
+
+
+		//int[] ArrayX = new int[]{1,1,1,1,2,4,3,2}; //set of values that should have different LongestZeroString and ZeroCounter
+		//int[] ArrayY = new int[]{1,1,1,2,4,4,3,2};
+
+		//{2,2,2,3,3,2,2}; //set of values that should have different LongestZeroString and ZeroCounter
+		//{2,2,2,2,3,2,2};
+
+		  int[] ArrayX = new int[]{3,2,3,1,3,1,2,1}; //GOOD example of finding starting coordinates of starting positions
+		  int[] ArrayY = new int[]{2,3,1,2,1,2,1,1};
+
+		// int[] ArrayX = new int[]{80,82,85,85,94,90,90,75,77,80,81};
+		// int[] ArrayY = new int[]{75,77,80,82,85,85,85,89,94,90,90};
+
+// 		int[] ArrayX = new int[]{137566,137566
+// ,137566
+// ,137566
+// ,137566
+// ,137566
+// ,137566
+// ,137566
+// ,137566
+// ,137566
+// ,137566
+// ,137566
+// ,137566
+// ,137566
+// ,137566
+// ,137566
+// ,137566
+// ,137566
+// ,191
+// ,1000
+// ,191
+// ,992
+// ,191
+// ,191
+// ,191
+// ,191
+// ,1000
+// ,191
+// ,1000
+// ,191
+// ,1000
+// ,1000
+// ,1000
+// ,191
+// ,191
+// ,1000
+// ,127
+// ,992
+// ,127
+// ,127
+// ,127
+// ,127
+// ,1000
+// ,127
+// ,1000
+// ,127
+// ,1000
+// ,1000
+// ,1000
+// ,127
+// ,127
+// ,1000
+// ,992
+// ,1000
+// ,1000
+// ,1000
+// ,1000
+// ,1000
+// ,1000
+// ,1000
+// ,1000
+// ,1000
+// ,1000
+// ,1000};
+// 		int[] ArrayY = new int[]{191,
+// 127,
+// 1000,
+// 137,
+// 992,
+// 100,
+// 98,
+// 101,
+// 97,
+// 1000,
+// 114,
+// 1000,
+// 121,
+// 1000,
+// 1000,
+// 1000,
+// 99,
+// 115,
+// 127,
+// 191,
+// 137,
+// 191,
+// 100,
+// 98,
+// 101,
+// 97,
+// 191,
+// 114,
+// 191,
+// 121,
+// 191,
+// 191,
+// 191,
+// 99,
+// 115,
+// 127,
+// 137,
+// 127,
+// 100,
+// 98,
+// 101,
+// 97,
+// 127,
+// 114,
+// 127,
+// 121,
+// 127,
+// 127,
+// 127,
+// 99,
+// 115,
+// 137,
+// 1000,
+// 100,
+// 98,
+// 101,
+// 97,
+// 1000,
+// 114,
+// 1000,
+// 121,
+// 1000,
+// 1000,
+// 1000};
+
+
+		int HorizontalTraversals = ArrayX.length+ArrayY.length-1;
+		ZeroCounter = new int[HorizontalTraversals]; //count zeros in each horizontal traversal each index is a travesal
+		LongestZeroString = new int[HorizontalTraversals]; //tallys the longest continious string of zeros found in any given traversal
+		LZScoordinates = new int[HorizontalTraversals][2];//records coordinates(in 2 column matrix) 0 index is X pos, 1 index is Y pos (seems reversed for some reason)
+
+
+		if(ArrayX.length==ArrayY.length)
+			{
+				DistanceMatrix = new int[ArrayY.length][ArrayX.length]; //row then columns (incrementing the X values chances the column)
+				//Columns of DisMatrixFillingHorizontally = DisMatrixCreater
+
+				DisMatrixFillingHorizontally(ArrayY,ArrayX);//horizontally filling the Matrix, while counting zeros per traversal
+				PrintMatrix(DistanceMatrix); //just a basic print function
+				//PrintMatrix(LZScoordinates);
+				System.out.println("1. Array index of most zeros: " + getIndexOfLargest(ZeroCounter)); //index of most exact overlap(ala most matching values/zeros)
+				System.out.println("2. Array index of longest string of zeros: " + getIndexOfLargest(LongestZeroString));
+				System.out.println("3. Starting coordinates of the traversal(on the grid edge) with the longest continuous string of zeros: (x,y)_" + GridStartingCoordinates(LongestZeroString)); //index of most exact overlap(ala most matching values/zeros)
+				System.out.println("4. Starting coordinates of the traversal(on the grid edge) with the most total zeros: (x,y)_" + GridStartingCoordinates(ZeroCounter));//converts the index of greatest traversal to the starting index(on the edge of the grid) of said traversal
+				//DisMatrixCreater(ArrayY,ArrayX);//standard double for loop to create the proper distance matrix- to check agaisnt by horizontal creation
+				
+				System.out.println("5. Exact X & Y grid coordinates of longest String of Zeros (x,y)_"+ "(" + LZScoordinates[getIndexOfLargest(LongestZeroString)][1] + "," + LZScoordinates[getIndexOfLargest(LongestZeroString)][0] + ")");
+				System.out.println("6. Percentage Match relative to perfect match_(most total zeros)_" + PercentMatch(ZeroCounter,ArrayX) + "%");
+				System.out.println("7. Percentage Match relative to perfect match_(longest continous string of zeros)_"  + PercentMatch(LongestZeroString,ArrayX) + "%");
+
+				PrintDataStructures();
+
+			}
+		else
+			{
+				System.out.println("The arrays being compared aren't the same length-");
+			}
+		
+	}
+
+	public static void PrintDataStructures()
+	{//maybe make them visualize, next to each other. (maybe not practical)
+		// System.out.print("Index: DataStrucktures");
+				// for(int x=0; x<ArrayX.length; x++)
+				// 	{
+				// 		System.out.print(x + " ");
+				// 		System.out.print(LZScoordinates[x][x]+ " ");
+				// 		System.out.print(LongestZeroString[x]+ " ");
+				// 		System.out.println(ZeroCounter[x]+ " ");
+				// 	}
+		System.out.println("Index: DataStrucktures");
+		System.out.println("LZScoordinates Points");
+		System.out.println("| x | | y |");
+		PrintMatrix(LZScoordinates);
+		System.out.println("LongestZeroString Array");
+		PrintArray(LongestZeroString);
+		System.out.println("ZeroCounter Array");
+		PrintArray(ZeroCounter);
+
+	}
+
+//public static void ReadGoogleSlides()
+
+	public static void DisMatrixFillingHorizontally(int[]D1, int[]D2)//int XstartPos, int YstartPos or maybe like a counter of # of traversals
+	{//arguemnts are the vectors/arrays of data points, the X and Y starting position within the Matrix
+		//Xpos = columns Ypos= rows
+
+		int x = D1.length+D2.length-1;  //# of horizontal iterations needed to go through every potential unit of the grid. Its the number of edge points we use
+										//13 is the answer for a 7 by 7 grid. 
+										//its equal to the number of edge values or length + width - 1	
+		int XstartPos = 0;
+		int YstartPos = 0;
+		int traversalsFromMiddle = 0;
+		int ZeroCounter = 0; //index of ZeroCounter array- it is the same as the traversalFromMiddle untill TFM is reset after half the grid is filled
+		//with evenly sized arrays the X value will always be Odd so we have to account for java rounding down by adding 1
+			
+		for(int i=0; i<((x/2)+1); i++)//goes through as many times are you need to traverse the middle traversal to the bottom left corner.
+			{
+				traversalsFromMiddle = MatrixHelper(D1, D2, XstartPos, YstartPos, traversalsFromMiddle, ZeroCounter)+1; //if the Helper returns the traversal count we can use its value even if the method is creating seperate variables
+				ZeroCounter++;
+				XstartPos = traversalsFromMiddle;
+			}
+
+			traversalsFromMiddle=1;
+			XstartPos = 0;//give new starting edge index values
+			YstartPos = 1;
+			
+			for(int p=0; p<(x/2); p++) //traversals from 1 above the middle to top right corner.
+				{
+					traversalsFromMiddle = MatrixHelper(D1, D2, XstartPos, YstartPos, traversalsFromMiddle, ZeroCounter)+1; 
+					ZeroCounter++;
+					YstartPos = traversalsFromMiddle;
+				}
+	}
+
+
+			/*to know when to make the recursive call A know how many grid positions must be filled before hand and count or B know the final position index you will land at
+
+			if the length/width of the DisMX grid are equal(THE GRID IS A SQUARE) the length of the longest horizontal(corner to corner) requires sidelength amount of sqaure traversals.
+			The longest traversal of a grid with sidelength of X is X operations. Starting at position (0,0)
+			starting position (0,y) or (y,0) (where sidelength>y>0) takes Sidelength-Y operations to reach its final grid position
+
+			ex with #s: a  7 by 7 grid's longest traversal is 7 operations long(Starting at position 0,0)
+			(0,1)=6op (0,2) = 5...(0,6) = 1 same with (1,0)=6op, (2,0)=5op....(6,0)=1op
+			longest traversal(starting at 0,0) is maximum the length of the shorter side 
+			
+
+
+			for a sqaure the longest traversal ends at (sidelength, sidelength) (the perfect diagonal)
+			starting position (y,0) ends at position (sidelength-1, sidelength-y-1) //moving towards bottom right corner of grid
+			starting position (0,x) ends at position (sidelength-x-1, sidelength-1) //moving towards top right corner of grid
+			//we do -1 because the side length starts at 1 but the indexing of the grid starts at 0. so we have to adjust
+			*/
+
+
+
+	public static int MatrixHelper(int[]D1, int[]D2, int Xpos, int Ypos, int traversals, int ZerocIndex)
+	{//the matrix helper function does one complete horizontal traversal of the grid
+
+		int SidelengthX = D1.length; //.length is the actually amount of positions allocated in memory so index 0-9 is length 10
+		boolean test = true;
+		int ActiveZeroCounter = 0;
+
+		while(test==true)
+				{
+				//System.out.println("(Y,X)" + Ypos + "," + Xpos);
+				//System.out.println("traversals = " + traversals); //doesn't work in secound half of the listing unless the traversal values are reset to 1
+
+				int DistanceValue = (D2[Ypos]-D1[Xpos])*(D2[Ypos]-D1[Xpos]); //the difference between the values squared
+				DistanceMatrix[Xpos][Ypos] = DistanceValue;//put value into Matrix
+
+				if(DistanceValue == 0)//found match (maybe pick a larger range ala 2-6 to allow for puedomatch)
+					{
+				       	ZeroCounter[ZerocIndex] = ZeroCounter[ZerocIndex]+1;//increment index of total zeros in diagonal traversal
+				 		ActiveZeroCounter = ActiveZeroCounter+1;
+					//	System.out.println("Active Zero Counter: " + ActiveZeroCounter);
+					}
+				else //found non zero value
+					{
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//if the String of zeros currently found is greater than what we have previously found for this traversal
+						{
+							LongestZeroString[ZerocIndex] = ActiveZeroCounter;//change the value of longest Active Zero counter to the active zero counter
+							//System.out.println("#: " + (Xpos - ActiveZeroCounter) + "," + (Ypos - ActiveZeroCounter));
+							LZScoordinates[ZerocIndex][0] = (Xpos - ActiveZeroCounter); 
+							LZScoordinates[ZerocIndex][1] = (Ypos - ActiveZeroCounter); 
+
+						}
+						System.out.println(ActiveZeroCounter);
+						ActiveZeroCounter = 0; //reset the active counter to zero 
+					}
+
+				//leave loop if the array indexs being called match the final position the call reaches
+				if(Xpos == SidelengthX-1-traversals && Ypos == SidelengthX-1)//-1 is because array index starts at zero side length doesn't.
+					{
+					//System.out.println("time to break-TR");
+					//System.out.println("number of zeros:" + ZeroCounter[ZerocIndex]);
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//Need to check in senario when the traversal ends in a match/zero
+							{
+								LongestZeroString[ZerocIndex] = ActiveZeroCounter;
+								System.out.println("#: " + (Xpos - ActiveZeroCounter + 1) + "," + (Ypos - ActiveZeroCounter + 1));
+								LZScoordinates[ZerocIndex][0] = (Xpos - ActiveZeroCounter + 1); 
+								LZScoordinates[ZerocIndex][1] = (Ypos - ActiveZeroCounter + 1); 
+						
+							}
+
+						test = false;
+						break;
+					}
+
+				if(Xpos== SidelengthX-1 && Ypos== SidelengthX-1-traversals)//the ending coordinates for values below the middle traversal towards to bottom left
+					{
+					//System.out.println("time to break2-BL");
+					//System.out.println("number of zeros:" + ZeroCounter[ZerocIndex]);
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//Need to check in senario when the traversal ends in a match/zero
+							{
+								LongestZeroString[ZerocIndex] = ActiveZeroCounter;//change the value of longest Active Zero counter to the active zero counter
+							System.out.println("#: " + (Xpos - ActiveZeroCounter + 1) + "," + (Ypos - ActiveZeroCounter + 1));
+								LZScoordinates[ZerocIndex][0] = (Xpos - ActiveZeroCounter + 1); 
+								LZScoordinates[ZerocIndex][1] = (Ypos - ActiveZeroCounter + 1); 
+							}
+
+						test = false;
+						break;
+					}
+
+				Xpos = Xpos+1;
+				Ypos = Ypos+1;
+				}
+
+		return traversals;		//so we can keep track of the position of the traversal
+		//we need to know which travesal we have just done. To know where to start the next one
+	}
+
+
+	public static String GridStartingCoordinates(int[] array) //Gets starting coordinates of traversal based on largest value in array
+	{
+		int LargestValueIndex = getIndexOfLargest(array);
+		String coordinates;
+
+		if(LargestValueIndex>((array.length/2)))
+			{
+				coordinates = new String(("(" + (LargestValueIndex-((array.length/2))) + "," + 0 +") "+ "value: " + array[LargestValueIndex]));
+				//if the starting value was in the top half of the grid
+				//this is because the grid is made middle to bottom left corner then back to the middle line to top right corner
+			}
+		else
+			{
+				coordinates = new String("(" + 0 + "," + LargestValueIndex + ") " + "value: " + array[LargestValueIndex]);
+			} 
+
+		return coordinates;
+	}
+
+	public static double PercentMatch(int[]Array, int[]GridSideLength)
+	{ 	//takes in two arrays. Finds the percent match between largest value in first array and max length in second array
+		int IndexOfLargest = getIndexOfLargest(Array);
+		double ValueTotal = GridSideLength.length;
+		double ValueMatchs = (double) Array[IndexOfLargest];
+		double PercentMatch = (ValueMatchs/ValueTotal)*100;
+		return PercentMatch;
+	}
+	
+}
+
+
diff --git a/dedupe/dtw/Old versions MP/DistanceMatrixUpdate2.java b/dedupe/dtw/Old versions MP/DistanceMatrixUpdate2.java
new file mode 100644
index 00000000..696bf2ef
--- /dev/null
+++ b/dedupe/dtw/Old versions MP/DistanceMatrixUpdate2.java	
@@ -0,0 +1,262 @@
+import java.io.FileInputStream;
+import java.io.FileNotFoundException;
+import java.util.Scanner;
+
+public class DistanceMatrixUpdate2 extends SqaureGridUpdate2
+{
+	static int[] ZeroCounter; //static members of the class which can be accessed anywhere
+	static int[][] DistanceMatrix;
+	static int[] LongestZeroString;
+	static int[][] LZScoordinates;
+	static int[] DataSetX;
+  	static int[] DataSetY;
+
+
+
+	public static void main(String[] args) throws FileNotFoundException 
+	{
+
+//QUICK TEST CASES
+		// {1,1,2,2,1,1};//set of values that should have different LongestZeroString and ZeroCounter
+		// {1,2,2,2,0,1};
+
+	// int[] ArrayX = new int[]{1,1,2,3,2,1,0};//set of values that should have different LongestZeroString and ZeroCounter
+	// int[] ArrayY = new int[]{0,1,1,2,3,2,1};
+
+		//{0,0,0,1,1};//
+		//{0,0,1,1,0};//
+
+
+		// int[] ArrayX = new int[]{1,1,1,1,2,4,3,2}; //set of values that should have different LongestZeroString and ZeroCounter
+		// int[] ArrayY = new int[]{1,1,1,2,4,4,3,2};
+
+		//{2,2,2,3,3,2,2}; //set of values that should have different LongestZeroString and ZeroCounter
+		//{2,2,2,2,3,2,2};
+
+		 // int[] ArrayX = new int[]{3,2,3,1,3,1,2,1}; //GOOD example of finding starting coordinates of starting positions
+		 // int[] ArrayY = new int[]{2,3,1,2,1,2,1,1};
+
+		// int[] ArrayX = new int[]{80,82,85,85,94,90,90,75,77,80,81};
+		// int[] ArrayY = new int[]{75,77,80,82,85,85,85,89,94,90,90};
+		
+
+		FileInputStream data = new FileInputStream("/Users/srapp/Desktop/data-analytics/dedupe/dtw/dataset.txt"); //X
+        FileInputStream data2 = new FileInputStream("/Users/srapp/Desktop/data-analytics/dedupe/dtw/dataset2.txt"); //Y
+        Scanner scanner = new Scanner(data);
+        Scanner scanner2 = new Scanner(data2);
+
+        DataSetX = new int[11044];//I looked at the number of lines in the file
+        DataSetY = new int[11044];
+
+        int i = 0;
+        while(scanner.hasNextLine())
+            {
+                      
+                DataSetX[i] = scanner.nextInt();
+                DataSetY[i] = scanner2.nextInt();
+               
+                i++;
+            } 
+        scanner.close();
+        scanner2.close();
+
+
+
+		int HorizontalTraversals = DataSetX.length+DataSetY.length-1;
+		ZeroCounter = new int[HorizontalTraversals]; //count zeros in each horizontal traversal each index is a travesal
+		LongestZeroString = new int[HorizontalTraversals]; //tallys the longest continious string of zeros found in any given traversal
+		LZScoordinates = new int[HorizontalTraversals][2];//records coordinates(in 2 column matrix) 0 index is X pos, 1 index is Y pos (seems reversed for some reason)
+
+
+		if(DataSetX.length==DataSetY.length)
+			{
+				DistanceMatrix = new int[DataSetY.length][DataSetX.length]; //row then columns (incrementing the X values chances the column)
+				//Columns of DisMatrixFillingHorizontally = DisMatrixCreater
+
+				DisMatrixFillingHorizontally(DataSetY,DataSetX);
+				//DisMatrixFillingHorizontally(ArrayY,ArrayX);//horizontally filling the Matrix, while counting zeros per traversal
+			//	PrintMatrix(DistanceMatrix); //just a basic print function
+			//	PrintMatrix(LZScoordinates);
+				System.out.println("RESULT SECTION:");
+				System.out.println("1. Array index of most zeros: " + getIndexOfLargest(ZeroCounter)); //index of most exact overlap(ala most matching values/zeros)
+				System.out.println("2. Array index of longest string of zeros: " + getIndexOfLargest(LongestZeroString));
+				System.out.println("3. Starting coordinates of the traversal(on the grid edge) with the longest continuous string of zeros: (x,y)_" + GridStartingCoordinates(LongestZeroString)); //index of most exact overlap(ala most matching values/zeros)
+				System.out.println("4. Starting coordinates of the traversal(on the grid edge) with the most total zeros: (x,y)_" + GridStartingCoordinates(ZeroCounter));//converts the index of greatest traversal to the starting index(on the edge of the grid) of said traversal
+				//DisMatrixCreater(ArrayY,ArrayX);//standard double for loop to create the proper distance matrix- to check agaisnt by horizontal creation
+				
+				System.out.println("5. Exact X & Y grid coordinates of longest String of Zeros (x,y)_"+ "(" + LZScoordinates[getIndexOfLargest(LongestZeroString)][1] + "," + LZScoordinates[getIndexOfLargest(LongestZeroString)][0] + ")");
+				System.out.println("6. Percentage Match relative to perfect match_(most total zeros)_" + PercentMatch(ZeroCounter,DataSetX) + "%");
+				System.out.println("7. Percentage Match relative to perfect match_(longest continous string of zeros)_"  + PercentMatch(LongestZeroString,DataSetX) + "%");
+
+			}
+		else
+			{
+				System.out.println("The Datasets being compared aren't the same length-");
+			}
+		
+	}
+
+//public static void ReadGoogleSlides()
+
+	public static void DisMatrixFillingHorizontally(int[]D1, int[]D2)//int XstartPos, int YstartPos or maybe like a counter of # of traversals
+	{//arguemnts are the vectors/arrays of data points, the X and Y starting position within the Matrix
+		//Xpos = columns Ypos= rows
+
+		int x = D1.length+D2.length-1;  //# of horizontal iterations needed to go through every potential unit of the grid. Its the number of edge points we use
+										//13 is the answer for a 7 by 7 grid. 
+										//its equal to the number of edge values or length + width - 1	
+		int XstartPos = 0;
+		int YstartPos = 0;
+		int traversalsFromMiddle = 0;
+		int ZeroCounter = 0; //index of ZeroCounter array- it is the same as the traversalFromMiddle untill TFM is reset after half the grid is filled
+		//with evenly sized arrays the X value will always be Odd so we have to account for java rounding down by adding 1
+			
+		for(int i=0; i<((x/2)+1); i++)//goes through as many times are you need to traverse the middle traversal to the bottom left corner.
+			{
+				traversalsFromMiddle = MatrixHelper(D1, D2, XstartPos, YstartPos, traversalsFromMiddle, ZeroCounter)+1; //if the Helper returns the traversal count we can use its value even if the method is creating seperate variables
+				ZeroCounter++;
+				XstartPos = traversalsFromMiddle;
+			}
+
+			traversalsFromMiddle=1;
+			XstartPos = 0;//give new starting edge index values
+			YstartPos = 1;
+			
+			for(int p=0; p<(x/2); p++) //traversals from 1 above the middle to top right corner.
+				{
+					traversalsFromMiddle = MatrixHelper(D1, D2, XstartPos, YstartPos, traversalsFromMiddle, ZeroCounter)+1; 
+					ZeroCounter++;
+					YstartPos = traversalsFromMiddle;
+				}
+	}
+
+
+			/*to know when to make the recursive call A know how many grid positions must be filled before hand and count or B know the final position index you will land at
+
+			if the length/width of the DisMX grid are equal(THE GRID IS A SQUARE) the length of the longest horizontal(corner to corner) requires sidelength amount of sqaure traversals.
+			The longest traversal of a grid with sidelength of X is X operations. Starting at position (0,0)
+			starting position (0,y) or (y,0) (where sidelength>y>0) takes Sidelength-Y operations to reach its final grid position
+
+			ex with #s: a  7 by 7 grid's longest traversal is 7 operations long(Starting at position 0,0)
+			(0,1)=6op (0,2) = 5...(0,6) = 1 same with (1,0)=6op, (2,0)=5op....(6,0)=1op
+			longest traversal(starting at 0,0) is maximum the length of the shorter side 
+			
+
+
+			for a sqaure the longest traversal ends at (sidelength, sidelength) (the perfect diagonal)
+			starting position (y,0) ends at position (sidelength-1, sidelength-y-1) //moving towards bottom right corner of grid
+			starting position (0,x) ends at position (sidelength-x-1, sidelength-1) //moving towards top right corner of grid
+			//we do -1 because the side length starts at 1 but the indexing of the grid starts at 0. so we have to adjust
+			*/
+
+
+
+	public static int MatrixHelper(int[]D1, int[]D2, int Xpos, int Ypos, int traversals, int ZerocIndex)
+	{//the matrix helper function does one complete horizontal traversal of the grid
+
+		int SidelengthX = D1.length; //.length is the actually amount of positions allocated in memory so index 0-9 is length 10
+		boolean test = true;
+		int ActiveZeroCounter = 0;
+
+		while(test==true)
+				{
+				//System.out.println("(Y,X)" + Ypos + "," + Xpos);
+				//System.out.println("traversals = " + traversals); //doesn't work in secound half of the listing unless the traversal values are reset to 1
+
+				int DistanceValue = (D2[Ypos]-D1[Xpos])*(D2[Ypos]-D1[Xpos]); //the difference between the values squared
+				DistanceMatrix[Xpos][Ypos] = DistanceValue;//put value into Matrix
+
+				if(DistanceValue == 0)//found match (maybe pick a larger range ala 2-6 to allow for puedomatch)
+					{
+				       	ZeroCounter[ZerocIndex] = ZeroCounter[ZerocIndex]+1;//increment index of total zeros in diagonal traversal
+				 		ActiveZeroCounter = ActiveZeroCounter+1;
+						//System.out.println("Active Zero Counter: " + ActiveZeroCounter);
+					}
+				else //found non zero value
+					{
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//if the String of zeros currently found is greater than what we have previously found for this traversal
+						{
+							LongestZeroString[ZerocIndex] = ActiveZeroCounter;//change the value of longest Active Zero counter to the active zero counter
+							//System.out.println("#: " + (Xpos - ActiveZeroCounter) + "," + (Ypos - ActiveZeroCounter));
+							LZScoordinates[ZerocIndex][0] = (Xpos - ActiveZeroCounter +1); 
+							LZScoordinates[ZerocIndex][1] = (Ypos - ActiveZeroCounter +1); 
+
+						}
+						//System.out.println(ActiveZeroCounter);
+						ActiveZeroCounter = 0; //reset the active counter to zero 
+					}
+
+				//leave loop if the array indexs being called match the final position the call reaches
+				if(Xpos == SidelengthX-1-traversals && Ypos == SidelengthX-1)//-1 is because array index starts at zero side length doesn't.
+					{
+					//System.out.println("time to break-TR");
+					//System.out.println("number of zeros:" + ZeroCounter[ZerocIndex]);
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//Need to check in senario when the traversal ends in a match/zero
+							{
+								LongestZeroString[ZerocIndex] = ActiveZeroCounter;
+						//		System.out.println("#: " + (Xpos - ActiveZeroCounter + 1) + "," + (Ypos - ActiveZeroCounter + 1));
+								LZScoordinates[ZerocIndex][0] = (Xpos - ActiveZeroCounter + 1); 
+								LZScoordinates[ZerocIndex][1] = (Ypos - ActiveZeroCounter + 1); 
+						
+							}
+
+						test = false;
+						break;
+					}
+
+				if(Xpos== SidelengthX-1 && Ypos== SidelengthX-1-traversals)//the ending coordinates for values below the middle traversal towards to bottom left
+					{
+					//System.out.println("time to break2-BL");
+					//System.out.println("number of zeros:" + ZeroCounter[ZerocIndex]);
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//Need to check in senario when the traversal ends in a match/zero
+							{
+								LongestZeroString[ZerocIndex] = ActiveZeroCounter;//change the value of longest Active Zero counter to the active zero counter
+							//System.out.println("#: " + (Xpos - ActiveZeroCounter + 1) + "," + (Ypos - ActiveZeroCounter + 1));
+								LZScoordinates[ZerocIndex][0] = (Xpos - ActiveZeroCounter + 1); 
+								LZScoordinates[ZerocIndex][1] = (Ypos - ActiveZeroCounter + 1); 
+							}
+
+						test = false;
+						break;
+					}
+
+				Xpos = Xpos+1;
+				Ypos = Ypos+1;
+				}
+
+		return traversals;		//so we can keep track of the position of the traversal
+		//we need to know which travesal we have just done. To know where to start the next one
+	}
+
+
+	public static String GridStartingCoordinates(int[] array) //Gets starting coordinates of traversal based on largest value in array
+	{
+		int LargestValueIndex = getIndexOfLargest(array);
+		String coordinates;
+
+		if(LargestValueIndex>((array.length/2)))
+			{
+				coordinates = new String(("(" + (LargestValueIndex-((array.length/2))) + "," + 0 +") "+ "value: " + array[LargestValueIndex]));
+				//if the starting value was in the top half of the grid
+				//this is because the grid is made middle to bottom left corner then back to the middle line to top right corner
+			}
+		else
+			{
+				coordinates = new String("(" + 0 + "," + LargestValueIndex + ") " + "value: " + array[LargestValueIndex]);
+			} 
+
+		return coordinates;
+	}
+
+	public static double PercentMatch(int[]Array, int[]GridSideLength)
+	{ 	//takes in two arrays. Finds the percent match between largest value in first array and max length in second array
+		int IndexOfLargest = getIndexOfLargest(Array);
+		double ValueTotal = GridSideLength.length;
+		double ValueMatchs = (double) Array[IndexOfLargest];
+		double PercentMatch = (ValueMatchs/ValueTotal)*100;
+		return PercentMatch;
+	}
+	
+}
+
+
diff --git a/dedupe/dtw/Old versions MP/Info b/dedupe/dtw/Old versions MP/Info
new file mode 100644
index 00000000..4148a4bb
--- /dev/null
+++ b/dedupe/dtw/Old versions MP/Info	
@@ -0,0 +1 @@
+This folder contains old versions of the Distance Matrix Code.
diff --git a/dedupe/dtw/Old versions MP/SqaureGrid.java b/dedupe/dtw/Old versions MP/SqaureGrid.java
new file mode 100644
index 00000000..3982c345
--- /dev/null
+++ b/dedupe/dtw/Old versions MP/SqaureGrid.java	
@@ -0,0 +1,75 @@
+public class SqaureGrid 
+{
+
+	public static int getIndexOfLargest(int[] array)	//returns index of largest value in an array
+	{
+		 	 if(array == null || array.length == 0) 
+		 	 	{
+		 	 		return -1; // null or empty
+				 }
+			 int largest = 0;
+		 	 
+		 	 for(int i = 1; i<array.length; i++)
+		  		{
+		    	   if(array[i]>array[largest])
+		    	   { 
+		    	 	 largest = i;
+		  		   }
+		  		}
+
+	  return largest; 
+	}
+
+	public static void MatchArrays(int[]Array1, int[]Array2)
+	{
+		if(Array1.length>Array2.length)
+		{
+			int[] Temp = new int[Array1.length];
+			for(int i = 0; i<Array2.length; i++)
+			{
+				Temp[i]=Array2[i];
+			}
+	//	Array1 = Temp;	
+		System.arraycopy(Temp, 0, Array2, 0, Temp.length);
+		}
+		else if(Array1.length<Array2.length)
+		{
+			int[] Temp = new int[Array2.length];
+			for(int i = 0; i<Array1.length; i++)
+			{
+				Temp[i]=Array1[i];
+			}
+		//Array2 = Temp;
+		System.arraycopy(Temp, 0, Array1, 0, Temp.length); 
+		}
+		System.out.println(Array1.length + "," + Array2.length);//a check to see if the arrays are equal length now
+	}
+
+
+	public static void DisMatrixCreater(int[]X,int[]Y) //standard approach to creating the distance matrix via 2 for loop. horizontal traversal not diagonal
+	{
+		int[][] DistanceMX = new int[Y.length][X.length];		
+		for(int i=0; i<X.length; i++)
+		{
+		for(int t=0; t<Y.length; t++)
+			{
+				DistanceMX[i][t]=(Y[t]-X[i])*(Y[t]-X[i]);
+			}
+		}
+		PrintMatrix(DistanceMX); //prints the Matrix it creates at the end
+	}
+
+
+	public static void PrintMatrix(int[][]Matrix) //prints the Distance Matrix given a Matrix
+	{//Print out the  matrix in nice
+		for (int i = 0; i < Matrix.length; i++)
+		{ 
+		   	 for (int j = 0; j < Matrix[i].length; j++) 
+		   	 {
+		        System.out.print(Matrix[i][j] + " | ");
+	    	 }
+	    System.out.println();
+		}
+	}
+
+}
diff --git a/dedupe/dtw/Old versions MP/SqaureGridUpdate1.java b/dedupe/dtw/Old versions MP/SqaureGridUpdate1.java
new file mode 100644
index 00000000..e4df1602
--- /dev/null
+++ b/dedupe/dtw/Old versions MP/SqaureGridUpdate1.java	
@@ -0,0 +1,98 @@
+public class SqaureGridUpdate1
+{
+
+	public static int getIndexOfLargest(int[] array)	//returns index of largest value in an array
+	{
+	 	 if(array == null || array.length == 0) 
+	 	 	{
+		 	 	return -1; // null or empty
+		 	}
+
+         int largest = 0;
+		 	 
+		 for(int i = 1; i<array.length; i++)
+		  	{
+		    	if(array[i]>array[largest])
+				   { 
+				   	    largest = i;
+				   }
+		  	}
+
+	  return largest; 
+	}
+
+
+
+
+	public static void MatchArrays(int[]Array1, int[]Array2)
+	{
+		if(Array1.length>Array2.length)
+			{
+				int[] Temp = new int[Array1.length];
+				for(int i = 0; i<Array2.length; i++)
+					{
+						Temp[i]=Array2[i];
+					}
+			
+			    System.arraycopy(Temp, 0, Array2, 0, Temp.length);
+			}
+		else if(Array1.length<Array2.length)
+			{
+				int[] Temp = new int[Array2.length];
+				for(int i = 0; i<Array1.length; i++)
+					{
+						Temp[i]=Array1[i];
+					}
+			
+				System.arraycopy(Temp, 0, Array1, 0, Temp.length); 
+			}
+
+		System.out.println(Array1.length + "," + Array2.length);//a check to see if the arrays are equal length now
+	}
+
+
+
+
+
+	public static void DisMatrixCreater(int[]X,int[]Y) //standard approach to creating the distance matrix via 2 for loop. horizontal traversal not diagonal
+	{
+		int[][] DistanceMX = new int[Y.length][X.length];		
+		for(int i=0; i<X.length; i++)
+			{
+				for(int t=0; t<Y.length; t++)
+					{
+						DistanceMX[i][t]=(Y[t]-X[i])*(Y[t]-X[i]);
+					}
+			}
+		PrintMatrix(DistanceMX); //prints the Matrix it creates at the end
+	}
+
+	public static void PrintArray(int[]Array)
+	{
+		for (int i = 0; i < Array.length; i++)
+			{
+				System.out.print(" | " + Array[i] + " | ");
+				System.out.println();
+			}
+		System.out.println();
+	}
+
+
+	public static void PrintMatrix(int[][]Matrix) //prints the Distance Matrix given a Matrix
+	{//Print out the  matrix in nice
+		for (int i = 0; i < Matrix.length; i++)
+			{ 
+			   	for (int j = 0; j < Matrix[i].length; j++) 
+				   	{
+				   		System.out.print("| ");
+				    	System.out.print(Matrix[i][j] + " | ");
+			    	}
+		    	System.out.println();
+			}
+		System.out.println();
+	}
+
+
+
+
+}
diff --git a/dedupe/dtw/Old versions MP/SqaureGridUpdate2.java b/dedupe/dtw/Old versions MP/SqaureGridUpdate2.java
new file mode 100644
index 00000000..e6039589
--- /dev/null
+++ b/dedupe/dtw/Old versions MP/SqaureGridUpdate2.java	
@@ -0,0 +1,87 @@
+public class SqaureGridUpdate2
+{
+
+	public static int getIndexOfLargest(int[] array)	//returns index of largest value in an array
+	{
+	 	 if(array == null || array.length == 0) 
+	 	 	{
+		 	 	return -1; // null or empty
+		 	}
+
+         int largest = 0;
+		 	 
+		 for(int i = 1; i<array.length; i++)
+		  	{
+		    	if(array[i]>array[largest])
+				   { 
+				   	    largest = i;
+				   }
+		  	}
+
+	  return largest; 
+	}
+
+
+
+
+	public static void MatchArrays(int[]Array1, int[]Array2)
+	{
+		if(Array1.length>Array2.length)
+			{
+				int[] Temp = new int[Array1.length];
+				for(int i = 0; i<Array2.length; i++)
+					{
+						Temp[i]=Array2[i];
+					}
+			
+			    System.arraycopy(Temp, 0, Array2, 0, Temp.length);
+			}
+		else if(Array1.length<Array2.length)
+			{
+				int[] Temp = new int[Array2.length];
+				for(int i = 0; i<Array1.length; i++)
+					{
+						Temp[i]=Array1[i];
+					}
+			
+				System.arraycopy(Temp, 0, Array1, 0, Temp.length); 
+			}
+
+		System.out.println(Array1.length + "," + Array2.length);//a check to see if the arrays are equal length now
+	}
+
+
+
+
+
+	public static void DisMatrixCreater(int[]X,int[]Y) //standard approach to creating the distance matrix via 2 for loop. horizontal traversal not diagonal
+	{
+		int[][] DistanceMX = new int[Y.length][X.length];		
+		for(int i=0; i<X.length; i++)
+			{
+				for(int t=0; t<Y.length; t++)
+					{
+						DistanceMX[i][t]=(Y[t]-X[i])*(Y[t]-X[i]);
+					}
+			}
+		PrintMatrix(DistanceMX); //prints the Matrix it creates at the end
+	}
+
+
+
+	public static void PrintMatrix(int[][]Matrix) //prints the Distance Matrix given a Matrix
+	{//Print out the  matrix in nice
+		for (int i = 0; i < Matrix.length; i++)
+			{ 
+			   	for (int j = 0; j < Matrix[i].length; j++) 
+				   	{
+				    	System.out.print(Matrix[i][j] + " | ");
+			    	}
+		    	System.out.println();
+			}
+	}
+
+
+
+
+}
diff --git a/dedupe/dtw/Old versions MP/SqaureGridUpdateRec.java b/dedupe/dtw/Old versions MP/SqaureGridUpdateRec.java
new file mode 100644
index 00000000..c4028548
--- /dev/null
+++ b/dedupe/dtw/Old versions MP/SqaureGridUpdateRec.java	
@@ -0,0 +1,89 @@
+public class SqaureGridUpdateRec
+{
+
+	public static int getIndexOfLargest(int[] array)	//returns index of largest value in an array
+	{
+	 	 if(array == null || array.length == 0) 
+	 	 	{
+		 	 	return -1; // null or empty
+		 	}
+
+         int largest = 0;
+		 	 
+		 for(int i = 1; i<array.length; i++)
+		  	{
+		    	if(array[i]>array[largest])
+				   { 
+				   	    largest = i;
+				   }
+		  	}
+
+	  return largest; 
+	}
+
+
+
+
+	public static void MatchArrays(int[]Array1, int[]Array2)
+	{
+		if(Array1.length>Array2.length)
+			{
+				int[] Temp = new int[Array1.length];
+				for(int i = 0; i<Array2.length; i++)
+					{
+						Temp[i]=Array2[i];
+					}
+			
+			    System.arraycopy(Temp, 0, Array2, 0, Temp.length);
+			}
+		else if(Array1.length<Array2.length)
+			{
+				int[] Temp = new int[Array2.length];
+				for(int i = 0; i<Array1.length; i++)
+					{
+						Temp[i]=Array1[i];
+					}
+			
+				System.arraycopy(Temp, 0, Array1, 0, Temp.length); 
+			}
+
+		System.out.println(Array1.length + "," + Array2.length);//a check to see if the arrays are equal length now
+	}
+
+
+
+
+
+	public static void DisMatrixCreater(int[]X,int[]Y) //standard approach to creating the distance matrix via 2 for loop. horizontal traversal not diagonal
+	{
+		int[][] DistanceMX = new int[Y.length][X.length];		
+		for(int i=0; i<(X.length-1); i++)
+			{
+				for(int t=0; t<Y.length; t++)
+					{
+						System.out.println(i + ", " + t);
+						DistanceMX[i][t]=(Y[t]-X[i])*(Y[t]-X[i]);
+					}
+			}
+		PrintMatrix(DistanceMX); //prints the Matrix it creates at the end
+	}
+
+
+	public static void PrintMatrix(int[][]Matrix) //prints the Distance Matrix given a Matrix
+	{//Print out the  matrix in nice
+		for (int i = 0; i < Matrix.length; i++)
+			{ 
+			   	for (int j = 0; j < Matrix[i].length; j++) 
+				   	{
+				    	System.out.print(Matrix[i][j] + " | ");
+			    	}
+		    	System.out.println();
+			}
+			System.out.print("_____________________________________");
+			System.out.println();
+	}
+
+
+
+
+}
diff --git a/dedupe/dtw/Old versions MP/rectangleMatrix50PercentAssumption.java b/dedupe/dtw/Old versions MP/rectangleMatrix50PercentAssumption.java
new file mode 100644
index 00000000..dfa3dc31
--- /dev/null
+++ b/dedupe/dtw/Old versions MP/rectangleMatrix50PercentAssumption.java	
@@ -0,0 +1,325 @@
+import java.io.FileInputStream;
+import java.io.FileNotFoundException;
+import java.util.Scanner;
+
+public class rectangleMatrix50PercentAssumption extends SqaureGridUpdateRec
+{
+	static int[] ZeroCounter; //static members of the class which can be accessed anywhere
+	static int[][] DistanceMatrix;
+	static int[] LongestZeroString;
+	static int[][] LZScoordinates;
+	static int[] DataSetX;
+  	static int[] DataSetY;
+
+
+
+	public static void main(String[] args) throws FileNotFoundException 
+	{
+
+//QUICK TEST CASES
+		// {1,1,2,2,1,1};//set of values that should have different LongestZeroString and ZeroCounter
+		// {1,2,2,2,0,1};
+
+	// int[] ArrayX = new int[]{1,1,2,3,2,1,0,1};//set of values that should have different LongestZeroString and ZeroCounter
+	// int[] ArrayY = new int[]{0,1,1,2,3,2,1,1,3,1,2};
+
+		//{0,0,0,1,1};//
+		//{0,0,1,1,0};//
+
+
+		   int[] ArrayY = new int[]{1,2,1,1,2,4,4,3}; 
+		   int[] ArrayX = new int[]{1,1,1,2,4,4,3,2};
+
+		// int[] ArrayX = new int[]{2,2,3,3,2,2,2,2,2}; //set of values that should have different LongestZeroString and ZeroCounter
+	 // int[] ArrayY = new int[]{2,2,2,3,2,2};
+
+		 // int[] ArrayX = new int[]{3,2,3,1}; //GOOD example of finding starting coordinates of starting positions
+		 // int[] ArrayY = new int[]{2,3,1,3,1,3,4,1};
+		// int[] ArrayX = new int[]{80,82,85,85,94,90,90,75,77,80,81};
+		// int[] ArrayY = new int[]{75,77,80,82,85,85,85,89,94,90,90};
+		
+
+		 FileInputStream data = new FileInputStream("/Users/samuelrapp/Desktop/DM/datasetTest.txt"); //X
+  	    FileInputStream data2 = new FileInputStream("/Users/samuelrapp/Desktop/DM/dataset2Test.txt"); //Y
+         Scanner scanner = new Scanner(data);
+         Scanner scanner2 = new Scanner(data2);
+
+        DataSetX = new int[11044];//I looked at the number of lines in the file
+        DataSetY = new int[11044];
+         DataSetX = ArrayX;
+        DataSetY = ArrayY;
+
+        // int i = 0;
+        // while(scanner.hasNextLine())
+        //     {
+                      
+        //         DataSetX[i] = scanner.nextInt();
+        //         DataSetY[i] = scanner2.nextInt();
+               
+        //         i++;
+        //     } 
+        // scanner.close();
+        // scanner2.close();
+
+
+
+		int HorizontalTraversals = DataSetX.length+DataSetY.length-1;
+		ZeroCounter = new int[HorizontalTraversals]; //count total zero/matchs in each diagonal traversal 
+		LongestZeroString = new int[HorizontalTraversals]; //tallys the longest continious string of zeros found in any given traversal
+		LZScoordinates = new int[HorizontalTraversals][2];//records coordinates(in 2 column matrix) 0 index is X pos, 1 index is Y pos (seems reversed for some reason)
+
+
+		
+				DistanceMatrix = new int[DataSetY.length][DataSetX.length]; //row then columns (incrementing the X values chances the column)
+				//Columns of DisMatrixFillingDiagonally = DisMatrixCreater
+				//PrintMatrix(DistanceMatrix);
+				DisMatrixFillingDiagonally(DataSetY,DataSetX);
+				//DisMatrixFillingDiagonally(ArrayY,ArrayX);//horizontally filling the Matrix, while counting zeros per traversal
+			//	PrintMatrix(DistanceMatrix); //just a basic print function
+			//	PrintMatrix(LZScoordinates);
+				System.out.println("RESULT SECTION:");
+				System.out.println("1. Array index of most zeros: " + getIndexOfLargest(ZeroCounter)); //index of most exact overlap(ala most matching values/zeros)
+				System.out.println("2. Array index of longest string of zeros: " + getIndexOfLargest(LongestZeroString));
+				System.out.println("3. Starting coordinates of the traversal(on the grid edge) with the longest continuous string of zeros: (x,y)_" + GridEdgeCoordinates(LongestZeroString, DistanceMatrix)); //index of most exact overlap(ala most matching values/zeros)
+				System.out.println("4. Starting coordinates of the traversal(on the grid edge) with the most total zeros: (x,y)_" + GridEdgeCoordinates(ZeroCounter, DistanceMatrix));//converts the index of greatest traversal to the starting index(on the edge of the grid) of said traversal
+				DisMatrixCreater(ArrayY,ArrayX);//standard double for loop to create the proper distance matrix- to check agaisnt by horizontal creation
+				PrintMatrix(DistanceMatrix);
+				
+				System.out.println("5. Exact X & Y grid coordinates of longest String of Zeros (x,y)_"+ "(" + LZScoordinates[getIndexOfLargest(LongestZeroString)][0] + "," + LZScoordinates[getIndexOfLargest(LongestZeroString)][1] + ")");
+				System.out.println("6. Percentage Match relative to perfect match_(most total zeros)_" + PercentMatch(ZeroCounter,DistanceMatrix) + "%");
+				System.out.println("7. Percentage Match relative to perfect match_(longest continous string of zeros)_"  + PercentMatch(LongestZeroString,DistanceMatrix) + "%");
+
+	}
+
+//public static void ReadGoogleSlides()
+
+	public static void DisMatrixFillingDiagonally(int[]DY, int[]DX)
+	{//arguemnts are the arrays of data points
+		//Xpos = columns Ypos= rows
+		int TotalTraversals = DY.length+DX.length-1;  //# of diagonal iterations needed to go through every potential unit of the grid. Its the number of edge points we use
+										//13 is the answer for a 7 by 7 grid. 
+										//its equal to the number of edge values or length + width - 1	
+		int TraversalsStartingonYAxis = TotalTraversals-DX.length;
+		int TraversalsStartingonXAxis = TotalTraversals-DY.length;
+
+		int shortersidelength; //determining the longest possible diagonal in the given matrix, ala the length of the shorter data set
+		boolean LongerSideY;
+		int difference;
+
+		if(TraversalsStartingonYAxis>TraversalsStartingonXAxis) //the Y axis is bigger than the X axis
+			{	
+				shortersidelength = TraversalsStartingonXAxis+1;
+				LongerSideY = true;
+			}
+		else ////the X axis is bigger than the Y axis
+			{
+				shortersidelength = TraversalsStartingonYAxis+1;
+				LongerSideY = false;
+			}
+
+		if(LongerSideY==true) //to make sure I get a positive value when taking the difference.
+			{
+				difference = TraversalsStartingonYAxis - TraversalsStartingonXAxis;
+			}
+		else
+			{
+				difference = TraversalsStartingonXAxis - TraversalsStartingonYAxis;
+			}
+
+		//int CutOffPoint = (shortersidelength/2);//setting what value with result in a corner cut off
+		int CutOffPoint = (shortersidelength/4);//lower cut off, less traversals removed.
+
+		int XstartPos = 0;
+		int YstartPos = 0;
+		int traversalsFromMiddle = 0;
+		int ZeroCounter = 0; //index of ZeroCounter array- it is the same as the traversalFromMiddle untill TFM is reset after half the grid is filled
+		//with evenly sized arrays the X value will always be Odd so we have to account for java rounding down by adding 1
+			
+		for(int i=0; i<(TraversalsStartingonXAxis+1); i++)//goes through as many times are you need to traverse the middle traversal to the bottom left corner.
+			{	
+				if(LongerSideY==false) //X is the longer side, so it must be accounted for in the assumption
+					{
+						if(CutOffPoint>=(shortersidelength+difference-i))//this code would cut off the Matrix from filling itself once the traversal length was less than half the maximum diagonal.
+						{
+							//System.out.println("Skipped");
+							ZeroCounter = ZeroCounter +1;
+							continue;
+						}
+					}
+				else
+					{
+						if(CutOffPoint>=(shortersidelength-i))//this code would cut off the Matrix from filling itself once the traversal length was less than half the maximum diagonal.
+						{
+							//System.out.println("Skipped:::");
+							ZeroCounter = ZeroCounter + 1;
+							continue;
+						}
+					}
+
+
+				traversalsFromMiddle = MatrixHelper(DY, DX, XstartPos, YstartPos, traversalsFromMiddle, ZeroCounter)+1; //if the Helper returns the traversal count we can use its value even if the method is creating seperate variables
+				ZeroCounter++;
+				XstartPos = traversalsFromMiddle;
+			}
+
+			traversalsFromMiddle=1;
+			XstartPos = 0;//give new starting edge index values
+			YstartPos = 1;
+			
+//System.out.println(LongerSideY);
+
+		for(int p=0; p<TraversalsStartingonYAxis; p++) //traversals from 1 above the middle to top right corner.
+			{
+				if(LongerSideY==false)//X is the longer side, so it doesn't need to be accounted for.
+					{
+					if(CutOffPoint>=(shortersidelength-p-1))//this code would cut off the Matrix from filling itself once the traversal length was less than half the maximum diagonal.
+						{//+-1 because the values start at (0,1) instead of (0,0) in the for loop above. So there are fewer loops to reach the threshhold
+							//System.out.println("Skipped->");
+							ZeroCounter = ZeroCounter + 1;
+							continue;
+						}
+					}
+				else //Y is the longer side so we have to give it more buffer space
+					{
+						if(CutOffPoint>=(shortersidelength+difference-p-1))//this code would cut off the Matrix from filling itself once the traversal length was less than half the maximum diagonal.
+						{
+							//System.out.println("Skipped----");
+							ZeroCounter = ZeroCounter + 1;
+							continue;
+						}
+					}
+
+
+				traversalsFromMiddle = MatrixHelper(DY, DX, XstartPos, YstartPos, traversalsFromMiddle, ZeroCounter)+1; 
+				ZeroCounter++;
+				YstartPos = traversalsFromMiddle;
+			}
+	}
+
+
+			/*to know when to make the recursive call A know how many grid positions must be filled before hand and count or B know the final position index you will land at
+
+			if the length/width of the DisMX grid are equal(THE GRID IS A SQUARE) the length of the longest horizontal(corner to corner) requires sidelength amount of sqaure traversals.
+			The longest traversal of a grid with sidelength of X is X operations. Starting at position (0,0)
+			starting position (0,y) or (y,0) (where sidelength>y>0) takes Sidelength-Y operations to reach its final grid position
+
+			ex with #s: a  7 by 7 grid's longest traversal is 7 operations long(Starting at position 0,0)
+			(0,1)=6op (0,2) = 5...(0,6) = 1 same with (1,0)=6op, (2,0)=5op....(6,0)=1op
+			longest traversal(starting at 0,0) is maximum the length of the shorter side 
+			
+
+
+			for a sqaure the longest traversal ends at (sidelength, sidelength) (the perfect diagonal)
+			starting position (y,0) ends at position (sidelength-1, sidelength-y-1) //moving towards bottom right corner of grid
+			starting position (0,x) ends at position (sidelength-x-1, sidelength-1) //moving towards top right corner of grid
+			//we do -1 because the side length starts at 1 but the indexing of the grid starts at 0. so we have to adjust
+			*/
+
+
+
+	public static int MatrixHelper(int[]DY, int[]DX, int Xpos, int Ypos, int traversals, int ZerocIndex)
+	{//the matrix helper function does one complete diagonal traversal of the grid
+		//It compares values from DY/DX arrays
+		//int XstartPos, int YstartPos are starting positions for the traversal
+		//traversals is a arguement that keeps the matrix aware of how far it is from the center diagonal
+		//ZeroxIndex is the index of the zero counter static array(for data collection) It matches the traversals counter until traversals is reset before the 2nd for loop in DisMatrixFillingDiagonally
+
+		int SidelengthX = DX.length; //.length is the actually amount of positions allocated in memory so index 0-9 is length 10
+		int SidelengthY = DY.length;
+		boolean test = true;
+		int ActiveZeroCounter = 0;
+
+		while(test==true)
+				{
+				int DistanceValue = (DX[Xpos]-DY[Ypos])*(DX[Xpos]-DY[Ypos]); //the difference between the values squared
+				DistanceMatrix[Ypos][Xpos] = DistanceValue;//put value into Matrix
+
+				if(DistanceValue == 0)//found match (maybe pick a larger range ala 2-6 to allow for puedomatch)
+					{
+				       	ZeroCounter[ZerocIndex] = ZeroCounter[ZerocIndex]+1;//increment index of total zeros in diagonal traversal
+				 		ActiveZeroCounter = ActiveZeroCounter+1;
+					}
+				else //found non zero value
+					{
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//if the String of zeros currently found is greater than what we have previously found for this traversal
+						{
+							LongestZeroString[ZerocIndex] = ActiveZeroCounter;//change the value of longest Active Zero counter to the active zero counter
+							LZScoordinates[ZerocIndex][0] = (Xpos - ActiveZeroCounter); 
+							LZScoordinates[ZerocIndex][1] = (Ypos - ActiveZeroCounter); 
+
+						}
+						ActiveZeroCounter = 0; //reset the active counter to zero 
+					}
+
+				//leave loop if the array indexs being called match the final position the call reaches
+				if(Xpos >= (SidelengthX-1) || Ypos >= (SidelengthY-1))//-1 is because array index starts at zero but side length doesn't.
+					{
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//Need to check in senario when the traversal ends in a match/zero
+							{
+								LongestZeroString[ZerocIndex] = ActiveZeroCounter;
+								System.out.println(ActiveZeroCounter);
+								if(ActiveZeroCounter>0)
+								LZScoordinates[ZerocIndex][0] = ((Xpos+1) - ActiveZeroCounter);
+								LZScoordinates[ZerocIndex][1] = ((Ypos+1) - ActiveZeroCounter); 
+						 //the +1 is needed because the ActiveZeroCounter could potentially give you a negative 'coordinate', 
+						 //If the zero string makes it all the way to the bottom, the (X/Ypos-activeZeroCounter) < 0. Not possible
+						//It isn't needed for the strings that don't end on the final position on the traversal because the +1s are happening within the while loop. 
+							//IE. These coordinates are being calculated during the same loop as the final zero is found, but in the case above the coordinates are being calculated in the loop after the final zero is found.
+							}
+
+						test = false;
+					}
+
+				Xpos = Xpos+1;
+				Ypos = Ypos+1;
+				}
+
+		return traversals;		//so we can keep track of the position of the traversal
+		//we need to know which travesal we have just done. To know where to start the next one
+	}
+
+
+	public static String GridEdgeCoordinates(int[] array, int[][]Matrix) //Gets starting coordinates of traversal based on largest value in array
+	{
+		int LargestValueIndex = getIndexOfLargest(array);
+		String coordinates;
+
+
+		if(LargestValueIndex>=(Matrix[1].length))
+			{
+				coordinates = new String("(" + 0 + "," + ((LargestValueIndex-(Matrix[1].length)+1) +") "+ "value: " + array[LargestValueIndex]));
+				//if the starting value was in the top half of the grid
+				//this is because the grid is made middle to bottom left corner then back to the middle line to top right corner
+			}
+		else
+			{
+				coordinates = new String("(" + LargestValueIndex + "," + 0 + ") " + "value: " + array[LargestValueIndex]);
+			} 
+
+		return coordinates;
+	}
+
+	public static double PercentMatch(int[]Array, int[][]Matrix)
+	{ 	//takes in one array, and a matrix. Finds the percent match between largest value in array and shorter sidelength of the matrix.
+		//We are determining how many matchs occured(or consequetively or not), in the best case, vs how many could have
+		int IndexOfLargest = getIndexOfLargest(Array);
+		double ValueTotal;
+
+		//no given traversal is longer than the shorter side of the Matrix-thus the longest traversal is = the shorter sidelength
+		if(Matrix.length > Matrix[1].length)
+			{
+				ValueTotal = Matrix[1].length;
+			}
+		else
+			{
+				ValueTotal = Matrix.length;
+			}
+
+		double ValueMatchs = (double) Array[IndexOfLargest];
+		double PercentMatch = (ValueMatchs/ValueTotal)*100;
+		return PercentMatch;
+	}
+	
+}
+
+
diff --git a/dedupe/dtw/Old versions MP/rectangleMatrixCutOff.class b/dedupe/dtw/Old versions MP/rectangleMatrixCutOff.class
new file mode 100644
index 00000000..4d3561fd
Binary files /dev/null and b/dedupe/dtw/Old versions MP/rectangleMatrixCutOff.class differ
diff --git a/dedupe/dtw/Old versions MP/rectangleMatrixCutOff.java b/dedupe/dtw/Old versions MP/rectangleMatrixCutOff.java
new file mode 100644
index 00000000..407c3bc8
--- /dev/null
+++ b/dedupe/dtw/Old versions MP/rectangleMatrixCutOff.java	
@@ -0,0 +1,371 @@
+import java.io.FileInputStream;
+import java.io.FileNotFoundException;
+import java.util.Scanner;
+
+public class DistanceMatrixCutOffAssumption
+{
+	static int[] ZeroCounter; //static members of the class which can be accessed anywhere
+	static int[][] DistanceMatrix;
+	static int[] LongestZeroString;
+	static int[][] LZScoordinates;
+	static int[] DataSetX;
+  	static int[] DataSetY;
+
+
+
+	public static void main(String[] args) throws FileNotFoundException 
+	{
+
+//QUICK TEST CASES
+		// int[] ArrayY = new int[]{1,1,2,2,1,1};//set of values that should have different LongestZeroString and ZeroCounter
+		// int[] ArrayX = new int[]{1,2,2,2,0,1,1,1};
+
+	// int[] ArrayX = new int[]{1,1,2,3,2,1,0,1};//set of values that should have different LongestZeroString and ZeroCounter
+	// int[] ArrayY = new int[]{0,1,1,2,3,2,1,1,3,1,2};
+
+		//{0,0,0,1,1};//
+		//{0,0,1,1,0};//
+
+
+		   int[] ArrayY = new int[]{1,2,1,1,2,4,4,3}; 
+		   int[] ArrayX = new int[]{1,1,1,2,4,4,3,2,2,3,4,5};
+
+		// int[] ArrayX = new int[]{2,2,3,3,2,2,2,2,2}; //set of values that should have different LongestZeroString and ZeroCounter
+	 // int[] ArrayY = new int[]{2,2,2,3,2,2};
+
+		 // int[] ArrayX = new int[]{3,2,3,1}; //GOOD example of finding starting coordinates of starting positions
+		 // int[] ArrayY = new int[]{2,3,1,3,1,3,4,1};
+		// int[] ArrayX = new int[]{80,82,85,85,94,90,90,75,77,80,81};
+		// int[] ArrayY = new int[]{75,77,80,82,85,85,85,89,94,90,90};
+		
+
+		 FileInputStream data = new FileInputStream("/Users/samuelrapp/Desktop/DM/datasetTest.txt"); //X
+  	    FileInputStream data2 = new FileInputStream("/Users/samuelrapp/Desktop/DM/dataset2Test.txt"); //Y
+         Scanner scanner = new Scanner(data);
+         Scanner scanner2 = new Scanner(data2);
+
+        DataSetX = new int[11044];//I looked at the number of lines in the file
+        DataSetY = new int[11044];
+         DataSetX = ArrayX;
+        DataSetY = ArrayY;
+
+        // int i = 0;
+        // while(scanner.hasNextLine())
+        //     {
+                      
+        //         DataSetX[i] = scanner.nextInt();
+        //         DataSetY[i] = scanner2.nextInt();
+               
+        //         i++;
+        //     } 
+        // scanner.close();
+        // scanner2.close();
+
+
+
+		int HorizontalTraversals = DataSetX.length+DataSetY.length-1;
+		ZeroCounter = new int[HorizontalTraversals]; //count total zero/matchs in each diagonal traversal 
+		LongestZeroString = new int[HorizontalTraversals]; //tallys the longest continious string of zeros found in any given traversal
+		LZScoordinates = new int[HorizontalTraversals][2];//records coordinates(in 2 column matrix) 0 index is X pos, 1 index is Y pos (seems reversed for some reason)
+
+
+		
+				DistanceMatrix = new int[DataSetY.length][DataSetX.length]; //row then columns (incrementing the X values chances the column)
+				PrintMatrix(DistanceMatrix);
+				DisMatrixFillingDiagonally(DataSetY,DataSetX);
+			//	PrintMatrix(DistanceMatrix); //just a basic print function
+			//	PrintMatrix(LZScoordinates);
+				System.out.println("RESULT SECTION:");
+				System.out.println("1. Array index of most zeros: " + getIndexOfLargest(ZeroCounter)); //index of most exact overlap(ala most matching values/zeros)
+				System.out.println("2. Array index of longest string of zeros: " + getIndexOfLargest(LongestZeroString));
+				System.out.println("3. Starting coordinates of the traversal(on the grid edge) with the longest continuous string of zeros: (x,y)_" + GridEdgeCoordinates(LongestZeroString, DistanceMatrix)); //index of most exact overlap(ala most matching values/zeros)
+				System.out.println("4. Starting coordinates of the traversal(on the grid edge) with the most total zeros: (x,y)_" + GridEdgeCoordinates(ZeroCounter, DistanceMatrix));//converts the index of greatest traversal to the starting index(on the edge of the grid) of said traversal
+				DisMatrixHorizontal(ArrayY,ArrayX);//standard double for loop to create the proper distance matrix- to check agaisnt by horizontal creation
+				PrintMatrix(DistanceMatrix);
+				
+				System.out.println("5. Exact X & Y grid coordinates of longest String of Zeros (x,y)_"+ "(" + LZScoordinates[getIndexOfLargest(LongestZeroString)][0] + "," + LZScoordinates[getIndexOfLargest(LongestZeroString)][1] + ")");
+				System.out.println("6. Percentage Match relative to perfect match_(most total zeros)_" + PercentMatch(ZeroCounter,DistanceMatrix) + "%");
+				System.out.println("7. Percentage Match relative to perfect match_(longest continous string of zeros)_"  + PercentMatch(LongestZeroString,DistanceMatrix) + "%");
+
+	}
+
+//public static void ReadGoogleSlides()
+
+	public static void DisMatrixFillingDiagonally(int[]DY, int[]DX)
+	{//arguemnts are the arrays of data points
+		//Xpos = columns Ypos= rows
+		int TotalTraversals = DY.length+DX.length-1;  //# of diagonal iterations needed to go through every potential unit of the grid. Its the number of edge points we use
+										//13 is the answer for a 7 by 7 grid. 
+										//its equal to the number of edge values or length + width - 1	
+		int TraversalsStartingonYAxis = TotalTraversals-DX.length;
+		int TraversalsStartingonXAxis = TotalTraversals-DY.length;
+
+		int shortersidelength; //determining the longest possible diagonal in the given matrix, ala the length of the shorter data set
+		boolean LongerSideY;
+		int difference;
+
+		if(TraversalsStartingonYAxis>TraversalsStartingonXAxis) //the Y axis is bigger than the X axis
+			{	
+				shortersidelength = TraversalsStartingonXAxis+1;
+				LongerSideY = true;
+			}
+		else ////the X axis is bigger than the Y axis
+			{
+				shortersidelength = TraversalsStartingonYAxis+1;
+				LongerSideY = false;
+			}
+
+		if(LongerSideY==true) //to make sure I get a positive value when taking the difference.
+			{
+				difference = TraversalsStartingonYAxis - TraversalsStartingonXAxis;
+			}
+		else
+			{
+				difference = TraversalsStartingonXAxis - TraversalsStartingonYAxis;
+			}
+
+		//int CutOffPoint = (shortersidelength/2);//setting what value with result in a corner cut off
+		int CutOffPoint = (shortersidelength/100);//lower cut off, less traversals removed.
+
+		int XstartPos = 0;
+		int YstartPos = 0;
+		int traversalsFromMiddle = 0;
+		int ZeroCounter = 0; //index of ZeroCounter array- it is the same as the traversalFromMiddle untill TFM is reset after half the grid is filled
+		//with evenly sized arrays the X value will always be Odd so we have to account for java rounding down by adding 1
+			
+		for(int i=0; i<(TraversalsStartingonXAxis+1); i++)//goes through as many times are you need to traverse the middle traversal to the bottom left corner.
+			{	
+				if(LongerSideY==false) //X is the longer side, so it must be accounted for in the assumption
+					{
+						if(CutOffPoint>=(shortersidelength+difference-i))//this code would cut off the Matrix from filling itself once the traversal length was less than half the maximum diagonal.
+						{
+							//System.out.println("Skipped");
+							ZeroCounter = ZeroCounter +1;
+							continue;
+						}
+					}
+				else
+					{
+						if(CutOffPoint>=(shortersidelength-i))//this code would cut off the Matrix from filling itself once the traversal length was less than half the maximum diagonal.
+						{
+							//System.out.println("Skipped:::");
+							ZeroCounter = ZeroCounter + 1;
+							continue;
+						}
+					}
+
+
+				traversalsFromMiddle = MatrixHelper(DY, DX, XstartPos, YstartPos, traversalsFromMiddle, ZeroCounter)+1; //if the Helper returns the traversal count we can use its value even if the method is creating seperate variables
+				ZeroCounter++;
+				XstartPos = traversalsFromMiddle;
+			}
+
+			traversalsFromMiddle=1;
+			XstartPos = 0;//give new starting edge index values
+			YstartPos = 1;
+			
+//System.out.println(LongerSideY);
+
+		for(int p=0; p<TraversalsStartingonYAxis; p++) //traversals from 1 above the middle to top right corner.
+			{
+				if(LongerSideY==false)//X is the longer side, so it doesn't need to be accounted for.
+					{
+					if(CutOffPoint>=(shortersidelength-p-1))//this code would cut off the Matrix from filling itself once the traversal length was less than half the maximum diagonal.
+						{//+-1 because the values start at (0,1) instead of (0,0) in the for loop above. So there are fewer loops to reach the threshhold
+							//System.out.println("Skipped->");
+							ZeroCounter = ZeroCounter + 1;
+							continue;
+						}
+					}
+				else //Y is the longer side so we have to give it more buffer space
+					{
+						if(CutOffPoint>=(shortersidelength+difference-p-1))//this code would cut off the Matrix from filling itself once the traversal length was less than half the maximum diagonal.
+						{
+							//System.out.println("Skipped----");
+							ZeroCounter = ZeroCounter + 1;
+							continue;
+						}
+					}
+
+
+				traversalsFromMiddle = MatrixHelper(DY, DX, XstartPos, YstartPos, traversalsFromMiddle, ZeroCounter)+1; 
+				ZeroCounter++;
+				YstartPos = traversalsFromMiddle;
+			}
+	}
+
+
+			/*to know when to make the recursive call A know how many grid positions must be filled before hand and count or B know the final position index you will land at
+
+			if the length/width of the DisMX grid are equal(THE GRID IS A SQUARE) the length of the longest horizontal(corner to corner) requires sidelength amount of sqaure traversals.
+			The longest traversal of a grid with sidelength of X is X operations. Starting at position (0,0)
+			starting position (0,y) or (y,0) (where sidelength>y>0) takes Sidelength-Y operations to reach its final grid position
+
+			ex with #s: a  7 by 7 grid's longest traversal is 7 operations long(Starting at position 0,0)
+			(0,1)=6op (0,2) = 5...(0,6) = 1 same with (1,0)=6op, (2,0)=5op....(6,0)=1op
+			longest traversal(starting at 0,0) is maximum the length of the shorter side 
+			
+
+
+			for a sqaure the longest traversal ends at (sidelength, sidelength) (the perfect diagonal)
+			starting position (y,0) ends at position (sidelength-1, sidelength-y-1) //moving towards bottom right corner of grid
+			starting position (0,x) ends at position (sidelength-x-1, sidelength-1) //moving towards top right corner of grid
+			//we do -1 because the side length starts at 1 but the indexing of the grid starts at 0. so we have to adjust
+			*/
+
+
+
+	public static int MatrixHelper(int[]DY, int[]DX, int Xpos, int Ypos, int traversals, int ZerocIndex)
+	{//the matrix helper function does one complete diagonal traversal of the grid
+		//It compares values from DY/DX arrays
+		//int XstartPos, int YstartPos are starting positions for the traversal
+		//traversals is a arguement that keeps the matrix aware of how far it is from the center diagonal
+		//ZeroxIndex is the index of the zero counter static array(for data collection) It matches the traversals counter until traversals is reset before the 2nd for loop in DisMatrixFillingDiagonally
+
+		int SidelengthX = DX.length; //.length is the actually amount of positions allocated in memory so index 0-9 is length 10
+		int SidelengthY = DY.length;
+		boolean test = true;
+		int ActiveZeroCounter = 0;
+
+		while(test==true)
+				{
+				int DistanceValue = (DX[Xpos]-DY[Ypos])*(DX[Xpos]-DY[Ypos]); //the difference between the values squared
+				DistanceMatrix[Ypos][Xpos] = DistanceValue;//put value into Matrix
+
+				if(DistanceValue == 0)//found match (maybe pick a larger range ala 2-6 to allow for puedomatch)
+					{
+				       	ZeroCounter[ZerocIndex] = ZeroCounter[ZerocIndex]+1;//increment index of total zeros in diagonal traversal
+				 		ActiveZeroCounter = ActiveZeroCounter+1;
+					}
+				else //found non zero value
+					{
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//if the String of zeros currently found is greater than what we have previously found for this traversal
+						{
+							LongestZeroString[ZerocIndex] = ActiveZeroCounter;//change the value of longest Active Zero counter to the active zero counter
+							LZScoordinates[ZerocIndex][0] = (Xpos - ActiveZeroCounter); 
+							LZScoordinates[ZerocIndex][1] = (Ypos - ActiveZeroCounter); 
+
+						}
+						ActiveZeroCounter = 0; //reset the active counter to zero 
+					}
+
+				//leave loop if the array indexs being called match the final position the call reaches
+				if(Xpos >= (SidelengthX-1) || Ypos >= (SidelengthY-1))//-1 is because array index starts at zero but side length doesn't.
+					{
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//Need to check in senario when the traversal ends in a match/zero
+							{
+								LongestZeroString[ZerocIndex] = ActiveZeroCounter;
+								System.out.println(ActiveZeroCounter);
+								if(ActiveZeroCounter>0)
+								LZScoordinates[ZerocIndex][0] = ((Xpos+1) - ActiveZeroCounter);
+								LZScoordinates[ZerocIndex][1] = ((Ypos+1) - ActiveZeroCounter); 
+						 //the +1 is needed because the ActiveZeroCounter could potentially give you a negative 'coordinate', 
+						 //If the zero string makes it all the way to the bottom, the (X/Ypos-activeZeroCounter) < 0. Not possible
+						//It isn't needed for the strings that don't end on the final position on the traversal because the +1s are happening within the while loop. 
+							//IE. These coordinates are being calculated during the same loop as the final zero is found, but in the case above the coordinates are being calculated in the loop after the final zero is found.
+							}
+
+						test = false;
+					}
+
+				Xpos = Xpos+1;
+				Ypos = Ypos+1;
+				}
+
+		return traversals;		//so we can keep track of the position of the traversal
+		//we need to know which travesal we have just done. To know where to start the next one
+	}
+
+
+	public static String GridEdgeCoordinates(int[] array, int[][]Matrix) //Gets starting coordinates of traversal based on largest value in array
+	{
+		int LargestValueIndex = getIndexOfLargest(array);
+		String coordinates;
+
+
+		if(LargestValueIndex>=(Matrix[1].length))
+			{
+				coordinates = new String("(" + 0 + "," + ((LargestValueIndex-(Matrix[1].length)+1) +") "+ "value: " + array[LargestValueIndex]));
+				//if the starting value was in the top half of the grid
+				//this is because the grid is made middle to bottom left corner then back to the middle line to top right corner
+			}
+		else
+			{
+				coordinates = new String("(" + LargestValueIndex + "," + 0 + ") " + "value: " + array[LargestValueIndex]);
+			} 
+
+		return coordinates;
+	}
+
+	public static int getIndexOfLargest(int[] array)	//returns index of largest value in an array
+	{
+	 	 if(array == null || array.length == 0) 
+	 	 	{
+		 	 	return -1; // null or empty
+		 	}
+
+         int largest = 0;
+		 	 
+		 for(int i = 1; i<array.length; i++)
+		  	{
+		    	if(array[i]>array[largest])
+				   { 
+				   	    largest = i;
+				   }
+		  	}
+
+	  return largest; 
+	}
+
+	public static double PercentMatch(int[]Array, int[][]Matrix)
+	{ 	//takes in one array, and a matrix. Finds the percent match between largest value in array and shorter sidelength of the matrix.
+		//We are determining how many matchs occured(or consequetively or not), in the best case, vs how many could have
+		int IndexOfLargest = getIndexOfLargest(Array);
+		double ValueTotal;
+
+		//no given traversal is longer than the shorter side of the Matrix-thus the longest traversal is = the shorter sidelength
+		if(Matrix.length > Matrix[1].length)
+			{
+				ValueTotal = Matrix[1].length;
+			}
+		else
+			{
+				ValueTotal = Matrix.length;
+			}
+
+		double ValueMatchs = (double) Array[IndexOfLargest];
+		double PercentMatch = (ValueMatchs/ValueTotal)*100;
+		return PercentMatch;
+	}
+
+	public static void PrintMatrix(int[][]Matrix) //prints the Distance Matrix given a Matrix
+	{//Print out the  matrix in nice
+		for (int i = 0; i < Matrix.length; i++)
+			{ 
+			   	for (int j = 0; j < Matrix[i].length; j++) 
+				   	{
+				    	System.out.print(Matrix[i][j] + " | ");
+			    	}
+		    	System.out.println();
+			}
+			System.out.print("_____________________________________");
+			System.out.println();
+	}
+
+	public static void DisMatrixHorizontal(int[]X,int[]Y) //standard approach to creating the distance matrix via 2 for loop. horizontal traversal not diagonal
+	{
+		int[][] DistanceMX = new int[X.length][Y.length];		
+		for(int i=0; i<(X.length); i++)
+			{
+				for(int t=0; t<Y.length; t++)
+					{
+						System.out.println(i + ", " + t);
+						DistanceMX[i][t]=(Y[t]-X[i])*(Y[t]-X[i]);
+					}
+			}
+		PrintMatrix(DistanceMX); //prints the Matrix it creates at the end
+	}
+	
+}
+
+
diff --git a/dedupe/dtw/README.md b/dedupe/dtw/README.md
new file mode 100644
index 00000000..feeace6e
--- /dev/null
+++ b/dedupe/dtw/README.md
@@ -0,0 +1 @@
+Sam Rapp's approach to the deduplication data problem. Primarily focused on using distance matrices to compare sets of time serids data.
diff --git a/dedupe/dtw/dataset.txt b/dedupe/dtw/dataset.txt
new file mode 100644
index 00000000..c510ee60
--- /dev/null
+++ b/dedupe/dtw/dataset.txt
@@ -0,0 +1,11044 @@
+247
+288
+1000
+287
+288
+288
+994
+247
+288
+1000
+247
+247
+1000
+288
+247
+787
+1000
+1000
+247
+247
+247
+247
+211
+288
+247
+247
+287
+288
+247
+288
+247
+247
+1000
+247
+286
+1000
+247
+247
+247
+247
+247
+1000
+987
+288
+247
+247
+247
+287
+247
+247
+247
+236
+247
+288
+247
+1000
+288
+288
+1000
+247
+288
+247
+287
+1000
+247
+1000
+1000
+1000
+288
+288
+999
+1000
+247
+247
+247
+1000
+286
+1000
+247
+247
+1000
+288
+288
+247
+285
+247
+247
+247
+996
+247
+247
+995
+247
+247
+1000
+288
+6086
+995
+1000
+1000
+231
+288
+247
+247
+240
+247
+247
+247
+998
+247
+995
+247
+1000
+247
+247
+247
+247
+1000
+247
+247
+284
+288
+247
+288
+997
+288
+247
+288
+247
+281
+247
+247
+247
+1000
+287
+247
+247
+1000
+286
+247
+288
+996
+247
+247
+5454
+996
+247
+288
+247
+247
+288
+213
+999
+288
+286
+247
+247
+287
+287
+987
+1000
+247
+247
+1000
+1000
+247
+247
+285
+287
+247
+998
+609
+247
+1000
+1000
+1000
+247
+992
+288
+247
+288
+288
+1000
+247
+247
+247
+1000
+998
+247
+247
+288
+247
+998
+247
+247
+288
+247
+247
+247
+247
+247
+288
+288
+247
+287
+247
+247
+287
+1000
+996
+247
+247
+247
+1000
+247
+288
+247
+247
+247
+1000
+247
+247
+998
+288
+994
+247
+990
+247
+247
+285
+247
+247
+247
+288
+247
+247
+1000
+247
+1000
+247
+1000
+247
+288
+247
+288
+230
+247
+247
+247
+288
+247
+247
+209
+288
+247
+247
+288
+288
+288
+247
+247
+247
+287
+288
+1000
+247
+287
+247
+287
+247
+288
+247
+247
+1000
+247
+288
+1000
+284
+1000
+983
+288
+609
+247
+287
+997
+288
+247
+247
+247
+247
+247
+247
+247
+288
+288
+247
+288
+247
+247
+247
+247
+247
+247
+247
+1000
+287
+237
+247
+994
+1000
+288
+247
+994
+1000
+287
+247
+288
+247
+247
+288
+247
+247
+247
+247
+247
+247
+287
+287
+982
+247
+247
+247
+247
+247
+288
+247
+285
+280
+247
+284
+247
+285
+1000
+1000
+247
+247
+247
+994
+247
+1000
+247
+995
+288
+247
+1000
+7937
+247
+1000
+1000
+288
+247
+247
+1000
+247
+247
+1000
+247
+1000
+1000
+998
+247
+247
+247
+285
+1000
+247
+247
+247
+247
+247
+247
+1000
+1000
+247
+288
+247
+286
+247
+247
+247
+1000
+247
+288
+719
+156
+247
+1000
+247
+247
+247
+247
+247
+247
+247
+288
+247
+997
+1000
+1000
+247
+247
+288
+1000
+247
+247
+247
+1000
+288
+247
+288
+247
+288
+288
+247
+288
+288
+288
+247
+247
+247
+247
+288
+288
+283
+247
+1000
+1000
+280
+288
+247
+287
+288
+288
+1000
+996
+247
+998
+998
+285
+247
+247
+1000
+1000
+996
+1000
+247
+997
+997
+288
+247
+288
+247
+247
+247
+286
+247
+999
+247
+247
+993
+288
+247
+247
+247
+247
+247
+247
+247
+1000
+247
+999
+1000
+282
+247
+247
+247
+247
+1000
+283
+247
+1000
+247
+1000
+999
+992
+277
+1000
+288
+247
+247
+286
+1000
+283
+1000
+286
+247
+1000
+1000
+1000
+247
+247
+288
+247
+1000
+1000
+247
+288
+247
+1000
+993
+247
+247
+288
+247
+288
+287
+287
+288
+247
+247
+996
+1000
+286
+247
+1000
+247
+288
+247
+247
+247
+247
+1000
+288
+1000
+247
+288
+247
+1000
+1000
+247
+998
+98
+283
+247
+247
+247
+288
+996
+247
+1000
+1000
+288
+1000
+247
+287
+247
+247
+1000
+288
+288
+288
+288
+247
+998
+288
+996
+247
+1000
+247
+247
+247
+247
+990
+247
+247
+1000
+247
+997
+288
+247
+247
+288
+288
+247
+247
+993
+288
+288
+1000
+247
+998
+288
+286
+994
+288
+996
+999
+247
+247
+247
+247
+994
+994
+288
+1000
+286
+247
+1000
+288
+1000
+288
+247
+1000
+247
+247
+1000
+288
+288
+288
+280
+288
+247
+288
+247
+995
+247
+288
+998
+286
+247
+247
+247
+288
+247
+247
+288
+247
+999
+288
+247
+288
+247
+247
+247
+247
+288
+288
+288
+247
+247
+247
+998
+247
+247
+997
+247
+247
+247
+287
+288
+996
+997
+247
+288
+247
+1000
+288
+247
+247
+247
+247
+247
+1000
+1000
+288
+247
+247
+247
+719
+247
+999
+288
+1000
+247
+1000
+1000
+1000
+1000
+1000
+288
+247
+247
+288
+247
+247
+247
+288
+247
+288
+1000
+247
+247
+247
+288
+230
+247
+247
+247
+1000
+247
+288
+247
+247
+1000
+247
+247
+247
+999
+286
+288
+247
+286
+247
+247
+247
+1000
+287
+247
+1000
+247
+288
+1000
+247
+1000
+247
+247
+247
+247
+1000
+247
+247
+247
+247
+247
+247
+247
+247
+288
+1000
+247
+288
+247
+1000
+288
+247
+247
+1000
+247
+1000
+1000
+1000
+247
+1000
+288
+288
+247
+997
+247
+288
+288
+247
+247
+247
+247
+247
+1000
+247
+247
+247
+1000
+288
+288
+247
+247
+1000
+286
+247
+288
+247
+288
+999
+1000
+247
+288
+288
+287
+1000
+994
+1000
+247
+992
+1000
+247
+247
+1000
+998
+247
+247
+247
+247
+247
+247
+999
+288
+247
+247
+288
+247
+1000
+787
+247
+247
+247
+992
+997
+247
+288
+247
+247
+288
+999
+247
+247
+1000
+247
+286
+999
+995
+247
+286
+247
+247
+288
+288
+213
+999
+287
+247
+288
+1000
+1000
+1000
+282
+247
+1000
+247
+247
+247
+288
+288
+1000
+247
+998
+247
+287
+247
+288
+288
+288
+288
+247
+1000
+247
+288
+247
+247
+247
+288
+1000
+247
+288
+247
+247
+247
+288
+1000
+247
+288
+288
+247
+247
+247
+288
+247
+288
+247
+1000
+247
+247
+288
+247
+247
+247
+247
+247
+1000
+247
+247
+137
+247
+287
+247
+999
+247
+247
+996
+247
+1000
+247
+994
+288
+992
+1000
+1000
+998
+247
+1000
+247
+997
+283
+1000
+247
+288
+247
+1000
+247
+247
+288
+288
+247
+1000
+247
+247
+1000
+247
+247
+999
+97
+247
+990
+288
+247
+247
+247
+286
+247
+288
+247
+288
+247
+1000
+288
+247
+247
+247
+283
+996
+247
+1000
+1000
+288
+247
+247
+247
+247
+1000
+247
+1000
+1000
+288
+274
+247
+994
+247
+1000
+247
+286
+288
+247
+1000
+1000
+288
+1000
+288
+288
+247
+247
+1000
+996
+247
+288
+288
+288
+1000
+287
+288
+288
+994
+287
+288
+1000
+284
+288
+1000
+288
+288
+787
+1000
+1000
+157
+288
+142
+288
+211
+288
+287
+288
+287
+288
+106
+288
+288
+288
+1000
+200
+286
+1000
+288
+288
+149
+141
+142
+1000
+987
+288
+152
+288
+288
+287
+287
+288
+288
+236
+142
+288
+121
+1000
+288
+288
+1000
+287
+288
+222
+287
+1000
+288
+1000
+1000
+1000
+288
+288
+999
+1000
+288
+206
+150
+1000
+286
+1000
+288
+288
+1000
+288
+288
+288
+285
+142
+288
+288
+996
+251
+288
+995
+189
+288
+1000
+288
+6086
+995
+1000
+1000
+231
+288
+142
+276
+240
+288
+288
+288
+998
+288
+995
+286
+1000
+164
+288
+288
+288
+1000
+204
+280
+284
+288
+288
+288
+997
+288
+288
+288
+158
+281
+190
+288
+288
+1000
+287
+198
+288
+1000
+286
+288
+288
+996
+288
+288
+5454
+996
+142
+288
+288
+226
+288
+213
+999
+288
+286
+142
+142
+287
+287
+987
+1000
+288
+142
+1000
+1000
+194
+288
+285
+287
+288
+998
+609
+287
+1000
+1000
+1000
+288
+992
+288
+288
+288
+288
+1000
+142
+173
+288
+1000
+998
+288
+142
+288
+252
+998
+288
+159
+288
+142
+288
+142
+159
+287
+288
+288
+124
+287
+215
+176
+287
+1000
+996
+142
+159
+127
+1000
+269
+288
+288
+142
+288
+1000
+288
+156
+998
+288
+994
+142
+990
+288
+142
+285
+143
+179
+159
+288
+288
+265
+1000
+288
+1000
+288
+1000
+288
+288
+195
+288
+230
+279
+142
+288
+288
+288
+182
+209
+288
+288
+171
+288
+288
+288
+155
+288
+142
+287
+288
+1000
+142
+287
+210
+287
+160
+288
+288
+287
+1000
+161
+288
+1000
+284
+1000
+983
+288
+609
+288
+287
+997
+288
+168
+288
+161
+288
+288
+181
+288
+288
+288
+288
+288
+288
+288
+288
+143
+288
+288
+288
+1000
+287
+237
+288
+994
+1000
+288
+152
+994
+1000
+287
+288
+288
+288
+288
+288
+288
+132
+142
+285
+197
+142
+287
+287
+982
+180
+100
+288
+288
+288
+288
+288
+285
+280
+288
+284
+288
+285
+1000
+1000
+288
+142
+288
+994
+284
+1000
+288
+995
+288
+288
+1000
+7937
+288
+1000
+1000
+288
+288
+288
+1000
+288
+182
+1000
+142
+1000
+1000
+998
+288
+288
+287
+285
+1000
+288
+142
+142
+288
+142
+119
+1000
+1000
+288
+288
+288
+286
+288
+156
+150
+1000
+173
+288
+719
+156
+129
+1000
+143
+288
+185
+145
+142
+288
+288
+288
+288
+997
+1000
+1000
+97
+122
+288
+1000
+142
+288
+142
+1000
+288
+144
+288
+288
+288
+288
+288
+288
+288
+288
+142
+264
+288
+142
+288
+288
+283
+288
+1000
+1000
+280
+288
+142
+287
+288
+288
+1000
+996
+216
+998
+998
+285
+164
+207
+1000
+1000
+996
+1000
+285
+997
+997
+288
+144
+288
+288
+287
+288
+286
+288
+999
+288
+142
+993
+288
+288
+170
+142
+142
+288
+288
+151
+1000
+288
+999
+1000
+282
+214
+288
+128
+142
+1000
+283
+288
+1000
+288
+1000
+999
+992
+277
+1000
+288
+179
+288
+286
+1000
+283
+1000
+286
+288
+1000
+1000
+1000
+140
+161
+288
+288
+1000
+1000
+288
+288
+288
+1000
+993
+288
+288
+288
+288
+288
+287
+287
+288
+288
+286
+996
+1000
+286
+288
+1000
+288
+288
+288
+288
+156
+265
+1000
+288
+1000
+161
+288
+288
+1000
+1000
+287
+998
+98
+283
+176
+288
+288
+288
+996
+139
+1000
+1000
+288
+1000
+142
+287
+189
+142
+1000
+288
+288
+288
+288
+288
+998
+288
+996
+157
+1000
+139
+288
+288
+288
+990
+288
+288
+1000
+288
+997
+288
+288
+288
+288
+288
+288
+174
+993
+288
+288
+1000
+288
+998
+288
+286
+994
+288
+996
+999
+287
+142
+219
+288
+994
+994
+288
+1000
+286
+288
+1000
+288
+1000
+288
+288
+1000
+288
+264
+1000
+288
+288
+288
+280
+288
+288
+288
+142
+995
+288
+288
+998
+286
+286
+142
+288
+288
+288
+288
+288
+288
+999
+288
+123
+288
+288
+288
+288
+287
+288
+288
+288
+288
+109
+234
+998
+142
+288
+997
+288
+288
+142
+287
+288
+996
+997
+142
+288
+193
+1000
+288
+288
+288
+287
+288
+288
+1000
+1000
+288
+176
+177
+288
+719
+186
+999
+288
+1000
+287
+1000
+1000
+1000
+1000
+1000
+288
+287
+150
+288
+144
+288
+142
+288
+288
+288
+1000
+235
+288
+288
+288
+230
+288
+288
+288
+1000
+286
+288
+288
+288
+1000
+288
+288
+142
+999
+286
+288
+287
+286
+193
+288
+136
+1000
+287
+287
+1000
+142
+288
+1000
+288
+1000
+288
+288
+142
+142
+1000
+287
+288
+142
+183
+142
+288
+287
+288
+288
+1000
+288
+288
+288
+1000
+288
+288
+202
+1000
+288
+1000
+1000
+1000
+288
+1000
+288
+288
+139
+997
+142
+288
+288
+247
+288
+288
+142
+142
+1000
+288
+142
+288
+1000
+288
+288
+288
+142
+1000
+286
+280
+288
+288
+288
+999
+1000
+288
+288
+288
+287
+1000
+994
+1000
+141
+992
+1000
+144
+225
+1000
+998
+155
+260
+217
+142
+288
+142
+999
+288
+167
+288
+288
+230
+1000
+787
+286
+288
+288
+992
+997
+237
+288
+142
+288
+288
+999
+142
+288
+1000
+288
+286
+999
+995
+288
+286
+288
+273
+288
+288
+213
+999
+287
+288
+288
+1000
+1000
+1000
+282
+142
+1000
+142
+288
+288
+288
+288
+1000
+182
+998
+197
+287
+151
+288
+288
+288
+288
+142
+1000
+169
+288
+288
+142
+250
+288
+1000
+288
+288
+288
+287
+284
+288
+1000
+288
+288
+288
+158
+288
+288
+288
+288
+288
+288
+1000
+203
+260
+288
+288
+142
+287
+142
+178
+1000
+288
+288
+137
+142
+287
+142
+999
+129
+169
+996
+287
+1000
+152
+994
+288
+992
+1000
+1000
+998
+283
+1000
+288
+997
+283
+1000
+274
+288
+288
+1000
+287
+260
+288
+288
+288
+1000
+142
+288
+1000
+288
+142
+999
+97
+288
+990
+288
+288
+288
+288
+286
+142
+288
+166
+288
+288
+1000
+288
+288
+288
+288
+283
+996
+288
+1000
+1000
+288
+182
+288
+288
+288
+1000
+288
+1000
+1000
+288
+274
+288
+994
+288
+1000
+159
+286
+288
+142
+1000
+1000
+288
+1000
+288
+288
+288
+285
+1000
+996
+199
+288
+288
+1000
+288
+288
+288
+994
+288
+288
+1000
+288
+288
+1000
+288
+288
+787
+1000
+1000
+288
+288
+288
+288
+211
+288
+288
+288
+287
+288
+288
+288
+288
+288
+1000
+288
+288
+1000
+288
+288
+288
+288
+288
+1000
+987
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+1000
+288
+288
+288
+288
+1000
+288
+1000
+1000
+1000
+288
+288
+999
+1000
+288
+288
+288
+1000
+288
+1000
+288
+288
+1000
+288
+288
+288
+285
+288
+288
+288
+996
+288
+288
+995
+288
+288
+1000
+288
+6086
+995
+1000
+1000
+231
+288
+288
+288
+288
+288
+288
+288
+998
+288
+995
+288
+1000
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+997
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+1000
+286
+288
+288
+996
+288
+288
+5454
+996
+288
+288
+288
+288
+288
+288
+999
+288
+286
+288
+288
+287
+288
+987
+1000
+288
+288
+1000
+1000
+288
+288
+285
+287
+288
+998
+609
+288
+1000
+1000
+1000
+288
+992
+288
+288
+288
+288
+1000
+288
+288
+288
+1000
+998
+288
+288
+288
+288
+998
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+287
+1000
+996
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+1000
+288
+288
+998
+288
+994
+288
+990
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+1000
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+209
+288
+288
+288
+288
+288
+288
+288
+288
+288
+287
+288
+1000
+288
+287
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+1000
+288
+1000
+983
+288
+609
+288
+288
+997
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+994
+1000
+288
+288
+994
+1000
+287
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+287
+982
+288
+288
+288
+288
+288
+288
+288
+288
+280
+288
+288
+288
+288
+1000
+1000
+288
+288
+288
+994
+288
+1000
+288
+995
+288
+288
+1000
+7937
+288
+1000
+1000
+288
+288
+288
+1000
+288
+288
+1000
+288
+1000
+1000
+998
+288
+288
+288
+285
+1000
+288
+288
+288
+288
+288
+288
+1000
+1000
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+719
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+997
+1000
+1000
+288
+288
+288
+1000
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+283
+288
+1000
+1000
+280
+288
+288
+287
+288
+288
+1000
+996
+288
+998
+998
+285
+288
+288
+1000
+1000
+996
+1000
+288
+997
+997
+288
+288
+288
+288
+288
+288
+288
+288
+999
+288
+288
+993
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+999
+1000
+288
+288
+288
+288
+288
+1000
+283
+288
+1000
+288
+1000
+999
+992
+288
+1000
+288
+288
+288
+286
+1000
+288
+1000
+286
+288
+1000
+1000
+1000
+288
+288
+288
+288
+1000
+1000
+288
+288
+288
+1000
+993
+288
+288
+288
+288
+288
+287
+287
+288
+288
+288
+996
+1000
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+1000
+288
+1000
+288
+288
+288
+1000
+1000
+288
+998
+98
+283
+288
+288
+288
+288
+996
+288
+1000
+1000
+288
+1000
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+998
+288
+996
+288
+1000
+288
+288
+288
+288
+990
+288
+288
+1000
+288
+997
+288
+288
+288
+288
+288
+288
+288
+993
+288
+288
+1000
+288
+998
+288
+286
+994
+288
+996
+999
+288
+288
+288
+288
+994
+994
+288
+1000
+288
+288
+1000
+288
+1000
+288
+288
+1000
+288
+288
+1000
+288
+288
+288
+280
+288
+288
+288
+288
+995
+288
+288
+998
+286
+288
+288
+288
+288
+288
+288
+288
+288
+999
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+998
+288
+288
+997
+288
+288
+288
+288
+288
+996
+997
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+1000
+1000
+288
+288
+288
+288
+719
+288
+999
+288
+1000
+288
+1000
+1000
+1000
+1000
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+1000
+288
+288
+288
+999
+288
+288
+288
+286
+288
+288
+288
+1000
+288
+288
+1000
+288
+288
+1000
+288
+1000
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+1000
+288
+288
+288
+1000
+288
+1000
+1000
+1000
+288
+1000
+288
+288
+288
+997
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+1000
+288
+288
+288
+288
+1000
+286
+288
+288
+288
+288
+999
+1000
+288
+288
+288
+288
+1000
+994
+1000
+288
+992
+1000
+288
+288
+1000
+998
+288
+288
+288
+288
+288
+288
+999
+288
+288
+288
+288
+288
+1000
+787
+288
+288
+288
+992
+997
+288
+288
+288
+288
+288
+999
+288
+288
+1000
+288
+288
+999
+995
+288
+286
+288
+288
+288
+288
+288
+999
+288
+288
+288
+1000
+1000
+1000
+288
+288
+1000
+288
+288
+288
+288
+288
+1000
+288
+998
+288
+287
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+999
+288
+288
+996
+288
+1000
+288
+994
+288
+992
+1000
+1000
+998
+288
+1000
+288
+997
+288
+1000
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+1000
+288
+288
+1000
+288
+288
+999
+288
+288
+990
+288
+288
+288
+288
+286
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+283
+996
+288
+1000
+1000
+288
+288
+288
+288
+288
+1000
+288
+1000
+1000
+288
+288
+288
+994
+288
+1000
+288
+286
+288
+288
+1000
+1000
+288
+1000
+288
+288
+288
+288
+1000
+996
+288
+288
+288
+1000
+1000
+1000
+994
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+987
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+999
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+995
+1000
+1000
+1000
+1000
+6086
+995
+1000
+1000
+231
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+998
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+5454
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+987
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+992
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+998
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+996
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+998
+1000
+1000
+1000
+990
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+287
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+997
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+994
+1000
+287
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+995
+1000
+1000
+1000
+7937
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+998
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+996
+1000
+1000
+1000
+997
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+999
+992
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+993
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+990
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+993
+1000
+1000
+1000
+1000
+998
+1000
+1000
+994
+1000
+996
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+998
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+999
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+998
+1000
+1000
+997
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+999
+1000
+1000
+1000
+286
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+999
+1000
+1000
+1000
+1000
+1000
+1000
+994
+1000
+1000
+992
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+992
+997
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+999
+995
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+998
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+996
+1000
+1000
+1000
+994
+1000
+992
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+999
+1000
+1000
+990
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+994
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+996
+1000
+1000
+1000
+287
+287
+994
+287
+288
+1000
+287
+287
+1000
+287
+287
+787
+1000
+1000
+287
+287
+287
+287
+211
+287
+287
+287
+287
+288
+287
+288
+287
+287
+1000
+287
+287
+1000
+287
+287
+287
+287
+287
+1000
+987
+287
+287
+287
+287
+287
+287
+287
+287
+236
+287
+287
+287
+1000
+288
+288
+1000
+287
+287
+287
+287
+1000
+287
+1000
+1000
+1000
+288
+287
+999
+1000
+287
+287
+287
+1000
+287
+1000
+287
+287
+1000
+287
+288
+287
+285
+287
+287
+287
+996
+287
+287
+995
+287
+287
+1000
+288
+6086
+995
+1000
+1000
+231
+287
+287
+287
+287
+287
+287
+287
+998
+287
+995
+287
+1000
+287
+287
+287
+287
+1000
+287
+287
+287
+287
+287
+287
+997
+288
+287
+287
+287
+287
+287
+287
+287
+1000
+287
+287
+287
+1000
+286
+287
+287
+996
+287
+287
+5454
+996
+287
+288
+287
+287
+287
+213
+999
+287
+286
+287
+287
+287
+287
+987
+1000
+287
+287
+1000
+1000
+287
+287
+285
+287
+287
+998
+609
+287
+1000
+1000
+1000
+287
+992
+288
+287
+287
+288
+1000
+287
+287
+287
+1000
+998
+287
+287
+287
+287
+998
+287
+287
+288
+287
+287
+287
+287
+287
+287
+288
+287
+287
+287
+287
+287
+1000
+996
+287
+287
+287
+1000
+287
+287
+287
+287
+287
+1000
+287
+287
+998
+288
+994
+287
+990
+287
+287
+287
+287
+287
+287
+288
+287
+287
+1000
+287
+1000
+287
+1000
+287
+288
+287
+287
+230
+287
+287
+287
+288
+287
+287
+209
+287
+287
+287
+288
+288
+287
+287
+287
+287
+287
+288
+1000
+287
+287
+287
+287
+287
+287
+287
+287
+1000
+287
+287
+1000
+287
+1000
+983
+287
+609
+287
+287
+997
+288
+287
+287
+287
+287
+287
+287
+287
+287
+287
+287
+287
+287
+287
+287
+287
+287
+287
+287
+1000
+287
+287
+287
+994
+1000
+287
+287
+994
+1000
+287
+287
+288
+287
+287
+287
+287
+287
+287
+287
+287
+287
+287
+287
+982
+287
+287
+287
+287
+287
+288
+287
+285
+280
+287
+287
+287
+285
+1000
+1000
+287
+287
+287
+994
+287
+1000
+287
+995
+287
+287
+1000
+7937
+287
+1000
+1000
+287
+287
+287
+1000
+287
+287
+1000
+287
+1000
+1000
+998
+287
+287
+287
+285
+1000
+287
+287
+287
+287
+287
+287
+1000
+1000
+287
+287
+287
+286
+287
+287
+287
+1000
+287
+287
+719
+287
+287
+1000
+287
+287
+287
+287
+287
+287
+287
+288
+287
+997
+1000
+1000
+287
+287
+288
+1000
+287
+287
+287
+1000
+287
+287
+287
+287
+288
+288
+287
+287
+288
+287
+287
+287
+287
+287
+287
+288
+283
+287
+1000
+1000
+280
+287
+287
+287
+288
+287
+1000
+996
+287
+998
+998
+285
+287
+287
+1000
+1000
+996
+1000
+287
+997
+997
+288
+287
+287
+287
+287
+287
+287
+287
+999
+287
+287
+993
+287
+287
+287
+287
+287
+287
+287
+287
+1000
+287
+999
+1000
+287
+287
+287
+287
+287
+1000
+283
+287
+1000
+287
+1000
+999
+992
+277
+1000
+288
+287
+287
+286
+1000
+287
+1000
+286
+287
+1000
+1000
+1000
+287
+287
+287
+287
+1000
+1000
+287
+287
+287
+1000
+993
+287
+287
+288
+287
+287
+287
+287
+287
+287
+287
+996
+1000
+287
+287
+1000
+287
+287
+287
+287
+287
+287
+1000
+287
+1000
+287
+287
+287
+1000
+1000
+287
+998
+98
+283
+287
+287
+287
+288
+996
+287
+1000
+1000
+288
+1000
+287
+287
+287
+287
+1000
+287
+287
+287
+287
+287
+998
+287
+996
+287
+1000
+287
+287
+287
+287
+990
+287
+287
+1000
+287
+997
+287
+287
+287
+288
+287
+287
+287
+993
+287
+287
+1000
+287
+998
+288
+286
+994
+287
+996
+999
+287
+287
+287
+287
+994
+994
+287
+1000
+286
+287
+1000
+288
+1000
+287
+287
+1000
+287
+287
+1000
+287
+287
+287
+280
+288
+287
+287
+287
+995
+287
+287
+998
+286
+287
+287
+287
+287
+287
+287
+287
+287
+999
+287
+287
+288
+287
+287
+287
+287
+288
+287
+287
+287
+287
+287
+998
+287
+287
+997
+287
+287
+287
+287
+288
+996
+997
+287
+288
+287
+1000
+287
+287
+287
+287
+287
+287
+1000
+1000
+287
+287
+287
+287
+719
+287
+999
+287
+1000
+287
+1000
+1000
+1000
+1000
+1000
+288
+287
+287
+287
+287
+287
+287
+288
+287
+288
+1000
+287
+287
+287
+288
+230
+287
+287
+287
+1000
+287
+287
+287
+287
+1000
+287
+287
+287
+999
+286
+287
+287
+286
+287
+287
+287
+1000
+287
+287
+1000
+287
+287
+1000
+287
+1000
+287
+287
+287
+287
+1000
+287
+287
+287
+287
+287
+287
+287
+287
+287
+1000
+287
+288
+287
+1000
+287
+287
+287
+1000
+287
+1000
+1000
+1000
+287
+1000
+287
+287
+287
+997
+287
+287
+287
+287
+287
+287
+287
+287
+1000
+287
+287
+287
+1000
+288
+288
+287
+287
+1000
+286
+287
+287
+287
+287
+999
+1000
+287
+287
+287
+287
+1000
+994
+1000
+287
+992
+1000
+287
+287
+1000
+998
+287
+287
+287
+287
+287
+287
+999
+287
+287
+287
+287
+287
+1000
+787
+287
+287
+287
+992
+997
+287
+287
+287
+287
+287
+999
+287
+287
+1000
+287
+286
+999
+995
+287
+286
+287
+287
+288
+287
+213
+999
+287
+287
+287
+1000
+1000
+1000
+287
+287
+1000
+287
+287
+287
+287
+287
+1000
+287
+998
+287
+287
+287
+288
+287
+287
+288
+287
+1000
+287
+288
+287
+287
+287
+287
+1000
+287
+287
+287
+287
+287
+288
+1000
+287
+287
+287
+287
+287
+287
+287
+287
+288
+287
+1000
+287
+287
+287
+287
+287
+287
+287
+287
+1000
+287
+287
+287
+287
+287
+287
+999
+287
+287
+996
+287
+1000
+287
+994
+287
+992
+1000
+1000
+998
+287
+1000
+287
+997
+287
+1000
+287
+288
+287
+1000
+287
+287
+287
+288
+287
+1000
+287
+287
+1000
+287
+287
+999
+97
+287
+990
+287
+287
+287
+287
+286
+287
+287
+287
+288
+287
+1000
+287
+287
+287
+287
+283
+996
+287
+1000
+1000
+287
+287
+287
+287
+287
+1000
+287
+1000
+1000
+287
+274
+287
+994
+287
+1000
+287
+286
+287
+287
+1000
+1000
+288
+1000
+287
+288
+287
+287
+1000
+996
+287
+287
+287
+288
+994
+288
+288
+1000
+288
+288
+1000
+288
+288
+787
+1000
+1000
+288
+288
+288
+288
+211
+288
+288
+288
+287
+288
+288
+288
+288
+288
+1000
+288
+286
+1000
+288
+288
+288
+288
+288
+1000
+987
+288
+288
+288
+288
+288
+288
+288
+288
+236
+288
+288
+288
+1000
+288
+288
+1000
+288
+288
+288
+288
+1000
+288
+1000
+1000
+1000
+288
+288
+999
+1000
+288
+288
+288
+1000
+288
+1000
+288
+288
+1000
+288
+288
+288
+285
+288
+288
+288
+996
+288
+288
+995
+288
+288
+1000
+288
+6086
+995
+1000
+1000
+231
+288
+288
+288
+288
+288
+288
+288
+998
+288
+995
+288
+1000
+288
+288
+288
+288
+1000
+288
+288
+284
+288
+288
+288
+997
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+1000
+286
+288
+288
+996
+288
+288
+5454
+996
+288
+288
+288
+288
+288
+213
+999
+288
+286
+288
+288
+287
+287
+987
+1000
+288
+288
+1000
+1000
+288
+288
+285
+287
+288
+998
+609
+288
+1000
+1000
+1000
+288
+992
+288
+288
+288
+288
+1000
+288
+288
+288
+1000
+998
+288
+288
+288
+288
+998
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+287
+1000
+996
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+1000
+288
+288
+998
+288
+994
+288
+990
+288
+288
+285
+288
+288
+288
+288
+288
+288
+1000
+288
+1000
+288
+1000
+288
+288
+288
+288
+230
+288
+288
+288
+288
+288
+288
+209
+288
+288
+288
+288
+288
+288
+288
+288
+288
+287
+288
+1000
+288
+287
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+1000
+288
+1000
+983
+288
+609
+288
+287
+997
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+287
+288
+288
+994
+1000
+288
+288
+994
+1000
+287
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+287
+982
+288
+288
+288
+288
+288
+288
+288
+285
+280
+288
+288
+288
+285
+1000
+1000
+288
+288
+288
+994
+288
+1000
+288
+995
+288
+288
+1000
+7937
+288
+1000
+1000
+288
+288
+288
+1000
+288
+288
+1000
+288
+1000
+1000
+998
+288
+288
+288
+285
+1000
+288
+288
+288
+288
+288
+288
+1000
+1000
+288
+288
+288
+286
+288
+288
+288
+1000
+288
+288
+719
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+997
+1000
+1000
+288
+288
+288
+1000
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+283
+288
+1000
+1000
+280
+288
+288
+287
+288
+288
+1000
+996
+288
+998
+998
+285
+288
+288
+1000
+1000
+996
+1000
+288
+997
+997
+288
+288
+288
+288
+288
+288
+286
+288
+999
+288
+288
+993
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+999
+1000
+282
+288
+288
+288
+288
+1000
+283
+288
+1000
+288
+1000
+999
+992
+277
+1000
+288
+288
+288
+286
+1000
+283
+1000
+286
+288
+1000
+1000
+1000
+288
+288
+288
+288
+1000
+1000
+288
+288
+288
+1000
+993
+288
+288
+288
+288
+288
+287
+287
+288
+288
+288
+996
+1000
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+1000
+288
+1000
+288
+288
+288
+1000
+1000
+288
+998
+98
+283
+288
+288
+288
+288
+996
+288
+1000
+1000
+288
+1000
+288
+287
+288
+288
+1000
+288
+288
+288
+288
+288
+998
+288
+996
+288
+1000
+288
+288
+288
+288
+990
+288
+288
+1000
+288
+997
+288
+288
+288
+288
+288
+288
+288
+993
+288
+288
+1000
+288
+998
+288
+286
+994
+288
+996
+999
+288
+288
+288
+288
+994
+994
+288
+1000
+286
+288
+1000
+288
+1000
+288
+288
+1000
+288
+288
+1000
+288
+288
+288
+280
+288
+288
+288
+288
+995
+288
+288
+998
+286
+288
+288
+288
+288
+288
+288
+288
+288
+999
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+998
+288
+288
+997
+288
+288
+288
+287
+288
+996
+997
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+1000
+1000
+288
+288
+288
+288
+719
+288
+999
+288
+1000
+288
+1000
+1000
+1000
+1000
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+230
+288
+288
+288
+1000
+288
+288
+288
+288
+1000
+288
+288
+288
+999
+286
+288
+288
+286
+288
+288
+288
+1000
+288
+288
+1000
+288
+288
+1000
+288
+1000
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+1000
+288
+288
+288
+1000
+288
+1000
+1000
+1000
+288
+1000
+288
+288
+288
+997
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+1000
+288
+288
+288
+288
+1000
+286
+288
+288
+288
+288
+999
+1000
+288
+288
+288
+287
+1000
+994
+1000
+288
+992
+1000
+288
+288
+1000
+998
+288
+288
+288
+288
+288
+288
+999
+288
+288
+288
+288
+288
+1000
+787
+288
+288
+288
+992
+997
+288
+288
+288
+288
+288
+999
+288
+288
+1000
+288
+286
+999
+995
+288
+286
+288
+288
+288
+288
+213
+999
+288
+288
+288
+1000
+1000
+1000
+282
+288
+1000
+288
+288
+288
+288
+288
+1000
+288
+998
+288
+287
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+287
+288
+999
+288
+288
+996
+288
+1000
+288
+994
+288
+992
+1000
+1000
+998
+288
+1000
+288
+997
+283
+1000
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+1000
+288
+288
+1000
+288
+288
+999
+97
+288
+990
+288
+288
+288
+288
+286
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+283
+996
+288
+1000
+1000
+288
+288
+288
+288
+288
+1000
+288
+1000
+1000
+288
+274
+288
+994
+288
+1000
+288
+286
+288
+288
+1000
+1000
+288
+1000
+288
+288
+288
+288
+1000
+996
+288
+288
+288
+994
+288
+288
+1000
+288
+288
+1000
+288
+288
+787
+1000
+1000
+288
+288
+288
+288
+211
+288
+288
+288
+287
+288
+288
+288
+288
+288
+1000
+288
+286
+1000
+288
+288
+288
+288
+288
+1000
+987
+288
+288
+288
+288
+288
+288
+288
+288
+236
+288
+288
+288
+1000
+288
+288
+1000
+288
+288
+288
+288
+1000
+288
+1000
+1000
+1000
+288
+288
+999
+1000
+288
+288
+288
+1000
+288
+1000
+288
+288
+1000
+288
+288
+288
+285
+288
+288
+288
+996
+288
+288
+995
+288
+288
+1000
+288
+6086
+995
+1000
+1000
+231
+288
+288
+288
+240
+288
+288
+288
+998
+288
+995
+288
+1000
+288
+288
+288
+288
+1000
+288
+288
+284
+288
+288
+288
+997
+288
+288
+288
+288
+281
+288
+288
+288
+1000
+288
+288
+288
+1000
+286
+288
+288
+996
+288
+288
+5454
+996
+288
+288
+288
+288
+288
+213
+999
+288
+286
+288
+288
+287
+287
+987
+1000
+288
+288
+1000
+1000
+288
+288
+285
+287
+288
+998
+609
+288
+1000
+1000
+1000
+288
+992
+288
+288
+288
+288
+1000
+288
+288
+288
+1000
+998
+288
+288
+288
+288
+998
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+287
+288
+288
+287
+1000
+996
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+1000
+288
+288
+998
+288
+994
+288
+990
+288
+288
+285
+288
+288
+288
+288
+288
+288
+1000
+288
+1000
+288
+1000
+288
+288
+288
+288
+230
+288
+288
+288
+288
+288
+288
+209
+288
+288
+288
+288
+288
+288
+288
+288
+288
+287
+288
+1000
+288
+287
+288
+287
+288
+288
+288
+288
+1000
+288
+288
+1000
+288
+1000
+983
+288
+609
+288
+287
+997
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+287
+288
+288
+994
+1000
+288
+288
+994
+1000
+287
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+287
+982
+288
+288
+288
+288
+288
+288
+288
+285
+280
+288
+288
+288
+285
+1000
+1000
+288
+288
+288
+994
+288
+1000
+288
+995
+288
+288
+1000
+7937
+288
+1000
+1000
+288
+288
+288
+1000
+288
+288
+1000
+288
+1000
+1000
+998
+288
+288
+288
+285
+1000
+288
+288
+288
+288
+288
+288
+1000
+1000
+288
+288
+288
+286
+288
+288
+288
+1000
+288
+288
+719
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+997
+1000
+1000
+288
+288
+288
+1000
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+283
+288
+1000
+1000
+280
+288
+288
+287
+288
+288
+1000
+996
+288
+998
+998
+285
+288
+288
+1000
+1000
+996
+1000
+288
+997
+997
+288
+288
+288
+288
+288
+288
+286
+288
+999
+288
+288
+993
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+999
+1000
+282
+288
+288
+288
+288
+1000
+283
+288
+1000
+288
+1000
+999
+992
+277
+1000
+288
+288
+288
+286
+1000
+283
+1000
+286
+288
+1000
+1000
+1000
+288
+288
+288
+288
+1000
+1000
+288
+288
+288
+1000
+993
+288
+288
+288
+288
+288
+287
+287
+288
+288
+288
+996
+1000
+286
+288
+1000
+288
+288
+288
+288
+288
+288
+1000
+288
+1000
+288
+288
+288
+1000
+1000
+288
+998
+98
+283
+288
+288
+288
+288
+996
+288
+1000
+1000
+288
+1000
+288
+287
+288
+288
+1000
+288
+288
+288
+288
+288
+998
+288
+996
+288
+1000
+288
+288
+288
+288
+990
+288
+288
+1000
+288
+997
+288
+288
+288
+288
+288
+288
+288
+993
+288
+288
+1000
+288
+998
+288
+286
+994
+288
+996
+999
+288
+288
+288
+288
+994
+994
+288
+1000
+286
+288
+1000
+288
+1000
+288
+288
+1000
+288
+288
+1000
+288
+288
+288
+280
+288
+288
+288
+288
+995
+288
+288
+998
+286
+288
+288
+288
+288
+288
+288
+288
+288
+999
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+998
+288
+288
+997
+288
+288
+288
+287
+288
+996
+997
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+1000
+1000
+288
+288
+288
+288
+719
+288
+999
+288
+1000
+288
+1000
+1000
+1000
+1000
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+230
+288
+288
+288
+1000
+288
+288
+288
+288
+1000
+288
+288
+288
+999
+286
+288
+288
+286
+288
+288
+288
+1000
+287
+288
+1000
+288
+288
+1000
+288
+1000
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+1000
+288
+288
+288
+1000
+288
+1000
+1000
+1000
+288
+1000
+288
+288
+288
+997
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+1000
+288
+288
+288
+288
+1000
+286
+288
+288
+288
+288
+999
+1000
+288
+288
+288
+287
+1000
+994
+1000
+288
+992
+1000
+288
+288
+1000
+998
+288
+288
+288
+288
+288
+288
+999
+288
+288
+288
+288
+288
+1000
+787
+288
+288
+288
+992
+997
+288
+288
+288
+288
+288
+999
+288
+288
+1000
+288
+286
+999
+995
+288
+286
+288
+288
+288
+288
+213
+999
+288
+288
+288
+1000
+1000
+1000
+282
+288
+1000
+288
+288
+288
+288
+288
+1000
+288
+998
+288
+287
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+287
+288
+999
+288
+288
+996
+288
+1000
+288
+994
+288
+992
+1000
+1000
+998
+288
+1000
+288
+997
+283
+1000
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+1000
+288
+288
+1000
+288
+288
+999
+97
+288
+990
+288
+288
+288
+288
+286
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+283
+996
+288
+1000
+1000
+288
+288
+288
+288
+288
+1000
+288
+1000
+1000
+288
+274
+288
+994
+288
+1000
+288
+286
+288
+288
+1000
+1000
+288
+1000
+288
+288
+288
+288
+1000
+996
+288
+288
+288
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+1000
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+1000
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+6086
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+998
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+5454
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+1000
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+1000
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+1000
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+7937
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+1000
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+1000
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+1000
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+993
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+999
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+1000
+994
+1000
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+1000
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+1000
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+992
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+1000
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+994
+288
+1000
+287
+287
+1000
+288
+287
+787
+1000
+1000
+287
+288
+287
+288
+211
+288
+287
+287
+287
+288
+287
+288
+288
+287
+1000
+200
+286
+1000
+287
+287
+287
+287
+287
+1000
+987
+288
+287
+288
+288
+287
+287
+288
+287
+236
+287
+288
+287
+1000
+288
+288
+1000
+287
+288
+287
+287
+1000
+287
+1000
+1000
+1000
+288
+288
+999
+1000
+287
+287
+287
+1000
+286
+1000
+287
+287
+1000
+288
+288
+287
+285
+287
+287
+288
+996
+251
+288
+995
+287
+287
+1000
+288
+6086
+995
+1000
+1000
+231
+288
+287
+287
+240
+288
+288
+287
+998
+287
+995
+287
+1000
+287
+287
+287
+287
+1000
+287
+287
+284
+288
+287
+288
+997
+288
+287
+288
+287
+281
+287
+287
+287
+1000
+287
+287
+287
+1000
+286
+288
+288
+996
+287
+287
+5454
+996
+287
+288
+287
+287
+288
+213
+999
+288
+286
+287
+287
+287
+287
+987
+1000
+287
+287
+1000
+1000
+287
+287
+285
+287
+287
+998
+609
+287
+1000
+1000
+1000
+287
+992
+288
+287
+288
+288
+1000
+287
+287
+287
+1000
+998
+287
+287
+288
+287
+998
+287
+287
+288
+287
+288
+287
+287
+287
+288
+288
+287
+287
+287
+287
+287
+1000
+996
+287
+287
+287
+1000
+287
+288
+287
+287
+287
+1000
+287
+287
+998
+288
+994
+287
+990
+287
+287
+285
+287
+287
+287
+288
+287
+287
+1000
+288
+1000
+287
+1000
+287
+288
+287
+288
+230
+287
+287
+287
+288
+287
+287
+209
+288
+288
+287
+288
+288
+288
+287
+287
+287
+287
+288
+1000
+287
+287
+287
+287
+287
+288
+287
+287
+1000
+287
+288
+1000
+284
+1000
+983
+288
+609
+288
+287
+997
+288
+287
+288
+287
+287
+287
+287
+287
+288
+288
+287
+288
+287
+287
+287
+287
+288
+287
+287
+1000
+287
+237
+287
+994
+1000
+288
+287
+994
+1000
+287
+288
+288
+287
+287
+288
+287
+287
+287
+287
+287
+287
+287
+287
+982
+287
+287
+287
+287
+288
+288
+287
+285
+280
+287
+284
+287
+285
+1000
+1000
+287
+287
+287
+994
+287
+1000
+287
+995
+288
+287
+1000
+7937
+287
+1000
+1000
+288
+287
+288
+1000
+287
+287
+1000
+287
+1000
+1000
+998
+287
+287
+287
+285
+1000
+287
+287
+287
+287
+287
+287
+1000
+1000
+288
+288
+287
+286
+287
+287
+287
+1000
+287
+288
+719
+156
+287
+1000
+287
+288
+287
+287
+287
+287
+287
+288
+287
+997
+1000
+1000
+287
+287
+288
+1000
+287
+287
+287
+1000
+288
+287
+288
+287
+288
+288
+287
+288
+288
+288
+287
+287
+287
+287
+288
+288
+283
+287
+1000
+1000
+280
+288
+287
+287
+288
+288
+1000
+996
+287
+998
+998
+285
+287
+287
+1000
+1000
+996
+1000
+287
+997
+997
+288
+287
+288
+287
+287
+288
+286
+287
+999
+287
+287
+993
+288
+287
+287
+287
+287
+288
+288
+287
+1000
+287
+999
+1000
+282
+287
+287
+287
+287
+1000
+283
+287
+1000
+287
+1000
+999
+992
+277
+1000
+288
+287
+287
+286
+1000
+283
+1000
+286
+287
+1000
+1000
+1000
+287
+287
+288
+287
+1000
+1000
+287
+288
+287
+1000
+993
+287
+287
+288
+287
+288
+287
+287
+288
+287
+287
+996
+1000
+286
+287
+1000
+287
+288
+287
+288
+287
+287
+1000
+288
+1000
+287
+288
+287
+1000
+1000
+287
+998
+98
+283
+287
+287
+288
+288
+996
+287
+1000
+1000
+288
+1000
+287
+287
+287
+287
+1000
+288
+288
+288
+288
+288
+998
+288
+996
+287
+1000
+287
+287
+287
+287
+990
+287
+288
+1000
+287
+997
+288
+287
+287
+288
+288
+288
+287
+993
+288
+288
+1000
+287
+998
+288
+286
+994
+288
+996
+999
+287
+287
+287
+288
+994
+994
+288
+1000
+286
+287
+1000
+288
+1000
+288
+287
+1000
+287
+287
+1000
+288
+288
+288
+280
+288
+287
+288
+287
+995
+287
+288
+998
+286
+287
+287
+287
+288
+288
+288
+288
+287
+999
+288
+123
+288
+287
+287
+287
+287
+288
+288
+288
+287
+287
+287
+998
+287
+287
+997
+287
+287
+287
+287
+288
+996
+997
+287
+288
+287
+1000
+288
+288
+287
+287
+287
+288
+1000
+1000
+288
+287
+287
+287
+719
+287
+999
+288
+1000
+287
+1000
+1000
+1000
+1000
+1000
+288
+287
+287
+288
+287
+287
+287
+288
+287
+288
+1000
+287
+287
+287
+288
+230
+288
+287
+287
+1000
+287
+288
+287
+287
+1000
+287
+287
+287
+999
+286
+288
+287
+286
+287
+287
+287
+1000
+287
+287
+1000
+287
+288
+1000
+287
+1000
+288
+287
+287
+287
+1000
+287
+287
+287
+287
+287
+287
+287
+287
+288
+1000
+287
+288
+287
+1000
+288
+287
+287
+1000
+287
+1000
+1000
+1000
+287
+1000
+288
+288
+287
+997
+287
+288
+288
+287
+287
+287
+287
+287
+1000
+287
+287
+288
+1000
+288
+288
+287
+287
+1000
+286
+287
+288
+287
+288
+999
+1000
+287
+288
+288
+287
+1000
+994
+1000
+287
+992
+1000
+287
+287
+1000
+998
+287
+287
+287
+287
+287
+287
+999
+288
+287
+287
+288
+287
+1000
+787
+287
+287
+287
+992
+997
+287
+288
+287
+288
+288
+999
+287
+287
+1000
+287
+286
+999
+995
+287
+286
+288
+287
+288
+288
+213
+999
+287
+287
+288
+1000
+1000
+1000
+282
+287
+1000
+287
+287
+287
+288
+288
+1000
+287
+998
+287
+287
+287
+288
+288
+288
+288
+287
+1000
+287
+288
+287
+287
+287
+288
+1000
+287
+288
+287
+287
+287
+288
+1000
+287
+288
+288
+287
+287
+287
+288
+287
+288
+287
+1000
+287
+287
+288
+288
+287
+287
+287
+287
+1000
+287
+287
+137
+287
+287
+287
+999
+287
+287
+996
+287
+1000
+287
+994
+288
+992
+1000
+1000
+998
+287
+1000
+288
+997
+283
+1000
+287
+288
+287
+1000
+287
+287
+288
+288
+287
+1000
+287
+287
+1000
+287
+287
+999
+97
+287
+990
+288
+287
+287
+287
+286
+287
+288
+287
+288
+287
+1000
+288
+287
+287
+287
+283
+996
+287
+1000
+1000
+288
+287
+288
+287
+287
+1000
+288
+1000
+1000
+288
+274
+287
+994
+287
+1000
+287
+286
+288
+287
+1000
+1000
+288
+1000
+288
+288
+287
+287
+1000
+996
+287
+288
+288
+1000
+288
+288
+1000
+288
+288
+787
+1000
+1000
+288
+288
+288
+288
+211
+288
+288
+288
+287
+288
+288
+288
+288
+288
+1000
+288
+288
+1000
+288
+288
+288
+288
+288
+1000
+987
+288
+288
+288
+288
+288
+288
+288
+288
+236
+288
+288
+288
+1000
+288
+288
+1000
+288
+288
+288
+288
+1000
+288
+1000
+1000
+1000
+288
+288
+999
+1000
+288
+288
+288
+1000
+288
+1000
+288
+288
+1000
+288
+288
+288
+285
+288
+288
+288
+996
+288
+288
+995
+288
+288
+1000
+288
+6086
+995
+1000
+1000
+231
+288
+288
+288
+288
+288
+288
+288
+998
+288
+995
+288
+1000
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+997
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+1000
+286
+288
+288
+996
+288
+288
+5454
+996
+288
+288
+288
+288
+288
+213
+999
+288
+286
+288
+288
+287
+287
+987
+1000
+288
+288
+1000
+1000
+288
+288
+285
+287
+288
+998
+609
+288
+1000
+1000
+1000
+288
+992
+288
+288
+288
+288
+1000
+288
+288
+288
+1000
+998
+288
+288
+288
+288
+998
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+287
+1000
+996
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+1000
+288
+288
+998
+288
+994
+288
+990
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+1000
+288
+1000
+288
+288
+288
+288
+230
+288
+288
+288
+288
+288
+288
+209
+288
+288
+288
+288
+288
+288
+288
+288
+288
+287
+288
+1000
+288
+287
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+1000
+288
+1000
+983
+288
+609
+288
+288
+997
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+287
+288
+288
+994
+1000
+288
+288
+994
+1000
+287
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+287
+982
+288
+288
+288
+288
+288
+288
+288
+285
+280
+288
+288
+288
+285
+1000
+1000
+288
+288
+288
+994
+288
+1000
+288
+995
+288
+288
+1000
+7937
+288
+1000
+1000
+288
+288
+288
+1000
+288
+288
+1000
+288
+1000
+1000
+998
+288
+288
+288
+285
+1000
+288
+288
+288
+288
+288
+288
+1000
+1000
+288
+288
+288
+286
+288
+288
+288
+1000
+288
+288
+719
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+997
+1000
+1000
+288
+288
+288
+1000
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+283
+288
+1000
+1000
+280
+288
+288
+287
+288
+288
+1000
+996
+288
+998
+998
+285
+288
+288
+1000
+1000
+996
+1000
+288
+997
+997
+288
+288
+288
+288
+288
+288
+288
+288
+999
+288
+288
+993
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+999
+1000
+288
+288
+288
+288
+288
+1000
+283
+288
+1000
+288
+1000
+999
+992
+277
+1000
+288
+288
+288
+286
+1000
+288
+1000
+286
+288
+1000
+1000
+1000
+288
+288
+288
+288
+1000
+1000
+288
+288
+288
+1000
+993
+288
+288
+288
+288
+288
+287
+287
+288
+288
+288
+996
+1000
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+1000
+288
+1000
+288
+288
+288
+1000
+1000
+288
+998
+98
+283
+288
+288
+288
+288
+996
+288
+1000
+1000
+288
+1000
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+998
+288
+996
+288
+1000
+288
+288
+288
+288
+990
+288
+288
+1000
+288
+997
+288
+288
+288
+288
+288
+288
+288
+993
+288
+288
+1000
+288
+998
+288
+286
+994
+288
+996
+999
+288
+288
+288
+288
+994
+994
+288
+1000
+286
+288
+1000
+288
+1000
+288
+288
+1000
+288
+288
+1000
+288
+288
+288
+280
+288
+288
+288
+288
+995
+288
+288
+998
+286
+288
+288
+288
+288
+288
+288
+288
+288
+999
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+998
+288
+288
+997
+288
+288
+288
+287
+288
+996
+997
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+1000
+1000
+288
+288
+288
+288
+719
+288
+999
+288
+1000
+288
+1000
+1000
+1000
+1000
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+230
+288
+288
+288
+1000
+288
+288
+288
+288
+1000
+288
+288
+288
+999
+286
+288
+288
+286
+288
+288
+288
+1000
+288
+288
+1000
+288
+288
+1000
+288
+1000
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+1000
+288
+288
+288
+1000
+288
+1000
+1000
+1000
+288
+1000
+288
+288
+288
+997
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+1000
+288
+288
+288
+288
+1000
+286
+288
+288
+288
+288
+999
+1000
+288
+288
+288
+288
+1000
+994
+1000
+288
+992
+1000
+288
+288
+1000
+998
+288
+288
+288
+288
+288
+288
+999
+288
+288
+288
+288
+288
+1000
+787
+288
+288
+288
+992
+997
+288
+288
+288
+288
+288
+999
+288
+288
+1000
+288
+286
+999
+995
+288
+286
+288
+288
+288
+288
+213
+999
+288
+288
+288
+1000
+1000
+1000
+288
+288
+1000
+288
+288
+288
+288
+288
+1000
+288
+998
+288
+287
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+287
+288
+999
+288
+288
+996
+288
+1000
+288
+994
+288
+992
+1000
+1000
+998
+288
+1000
+288
+997
+288
+1000
+288
+288
+288
+1000
+288
+288
+288
+288
+288
+1000
+288
+288
+1000
+288
+288
+999
+97
+288
+990
+288
+288
+288
+288
+286
+288
+288
+288
+288
+288
+1000
+288
+288
+288
+288
+283
+996
+288
+1000
+1000
+288
+288
+288
+288
+288
+1000
+288
+1000
+1000
+288
+274
+288
+994
+288
+1000
+288
+286
+288
+288
+1000
+1000
+288
+1000
+288
+288
+288
+288
+1000
+996
+288
+288
+288
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+987
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+999
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+996
+1000
+1000
+995
+1000
+1000
+1000
+1000
+6086
+995
+1000
+1000
+231
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+998
+1000
+995
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+997
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+286
+1000
+1000
+996
+1000
+1000
+5454
+996
+1000
+1000
+1000
+1000
+1000
+1000
+999
+1000
+1000
+1000
+1000
+1000
+1000
+987
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+285
+1000
+1000
+998
+1000
+1000
+1000
+1000
+1000
+1000
+992
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+998
+1000
+1000
+1000
+1000
+998
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+996
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+998
+1000
+994
+1000
+990
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+287
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+983
+1000
+1000
+1000
+1000
+997
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+994
+1000
+1000
+1000
+994
+1000
+287
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+982
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+994
+1000
+1000
+1000
+995
+1000
+1000
+1000
+7937
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+998
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+719
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+997
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+996
+1000
+998
+998
+1000
+1000
+1000
+1000
+1000
+996
+1000
+1000
+997
+997
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+999
+1000
+1000
+993
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+999
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+283
+1000
+1000
+1000
+1000
+999
+992
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+286
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+993
+1000
+1000
+1000
+1000
+1000
+1000
+287
+1000
+1000
+1000
+996
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+998
+1000
+1000
+1000
+1000
+1000
+1000
+996
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+998
+1000
+996
+1000
+1000
+1000
+1000
+1000
+1000
+990
+1000
+1000
+1000
+1000
+997
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+993
+1000
+1000
+1000
+1000
+998
+1000
+286
+994
+1000
+996
+999
+1000
+1000
+1000
+1000
+994
+994
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+995
+1000
+1000
+998
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+999
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+998
+1000
+1000
+997
+1000
+1000
+1000
+1000
+1000
+996
+997
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+719
+1000
+999
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+999
+1000
+1000
+1000
+286
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+997
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+999
+1000
+1000
+1000
+1000
+1000
+1000
+994
+1000
+1000
+992
+1000
+1000
+1000
+1000
+998
+1000
+1000
+1000
+1000
+1000
+1000
+999
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+992
+997
+1000
+1000
+1000
+1000
+1000
+999
+1000
+1000
+1000
+1000
+1000
+999
+995
+1000
+286
+1000
+1000
+1000
+1000
+1000
+999
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+998
+1000
+287
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+999
+1000
+1000
+996
+1000
+1000
+1000
+994
+1000
+992
+1000
+1000
+998
+1000
+1000
+1000
+997
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+999
+1000
+1000
+990
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+1000
+996
+1000
+1000
\ No newline at end of file
diff --git a/dedupe/dtw/dataset2.txt b/dedupe/dtw/dataset2.txt
new file mode 100644
index 00000000..7f01afc6
--- /dev/null
+++ b/dedupe/dtw/dataset2.txt
@@ -0,0 +1,11044 @@
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+100
+288
+247
+247
+287
+288
+247
+247
+106
+247
+288
+288
+247
+200
+247
+247
+288
+288
+149
+141
+131
+247
+247
+247
+152
+288
+288
+247
+287
+288
+288
+247
+142
+247
+121
+247
+247
+247
+247
+287
+247
+222
+247
+247
+288
+247
+247
+247
+247
+247
+247
+247
+288
+206
+150
+247
+247
+247
+288
+288
+247
+247
+247
+288
+247
+129
+288
+288
+247
+251
+288
+247
+189
+288
+247
+247
+247
+247
+247
+247
+247
+247
+107
+276
+247
+288
+288
+288
+247
+288
+247
+286
+247
+164
+288
+288
+288
+247
+204
+280
+247
+247
+288
+247
+247
+247
+288
+247
+158
+247
+190
+288
+288
+247
+247
+198
+288
+247
+247
+288
+247
+247
+288
+288
+247
+247
+128
+247
+288
+226
+247
+247
+247
+247
+247
+122
+111
+247
+247
+247
+247
+288
+135
+247
+247
+194
+288
+247
+247
+288
+247
+247
+287
+247
+247
+247
+288
+247
+247
+288
+247
+247
+247
+125
+173
+288
+247
+247
+288
+124
+247
+252
+247
+288
+159
+247
+121
+288
+142
+159
+287
+247
+247
+124
+247
+215
+176
+247
+247
+247
+116
+159
+127
+247
+269
+247
+288
+116
+288
+247
+288
+156
+247
+247
+247
+129
+247
+288
+135
+247
+143
+179
+159
+247
+288
+265
+247
+288
+247
+288
+247
+288
+247
+195
+247
+247
+279
+108
+288
+247
+288
+182
+247
+247
+288
+171
+247
+247
+247
+155
+288
+135
+247
+247
+247
+135
+247
+210
+247
+160
+247
+288
+287
+247
+161
+247
+247
+247
+247
+247
+247
+247
+288
+247
+247
+247
+168
+288
+161
+288
+288
+181
+288
+247
+247
+288
+247
+288
+288
+288
+143
+288
+288
+288
+247
+247
+247
+288
+247
+247
+247
+152
+247
+247
+247
+288
+247
+288
+288
+247
+288
+132
+107
+285
+197
+108
+247
+247
+247
+180
+100
+288
+288
+288
+247
+288
+247
+247
+288
+247
+288
+247
+247
+247
+288
+105
+288
+247
+284
+247
+288
+247
+247
+288
+247
+247
+288
+247
+247
+247
+288
+288
+247
+288
+182
+247
+99
+247
+247
+247
+288
+288
+287
+247
+247
+288
+135
+100
+288
+133
+119
+247
+247
+288
+247
+288
+247
+288
+156
+150
+247
+173
+247
+247
+247
+129
+247
+143
+288
+185
+145
+112
+288
+288
+247
+288
+247
+247
+247
+97
+122
+247
+247
+101
+288
+102
+247
+247
+144
+247
+288
+247
+247
+288
+247
+247
+247
+107
+264
+288
+122
+247
+247
+247
+288
+247
+247
+247
+247
+125
+247
+247
+247
+247
+247
+216
+247
+247
+247
+164
+207
+247
+247
+247
+247
+285
+247
+247
+247
+144
+247
+288
+287
+288
+247
+288
+247
+288
+108
+247
+247
+288
+170
+105
+127
+288
+288
+151
+247
+288
+247
+247
+247
+214
+288
+128
+104
+247
+247
+288
+247
+288
+247
+247
+247
+247
+247
+247
+179
+288
+247
+247
+247
+247
+247
+288
+247
+247
+247
+140
+161
+247
+288
+247
+247
+288
+247
+288
+247
+247
+288
+288
+247
+288
+247
+247
+247
+247
+288
+286
+247
+247
+247
+288
+247
+288
+247
+288
+288
+156
+265
+247
+247
+247
+161
+247
+288
+247
+247
+287
+247
+247
+247
+176
+288
+288
+247
+247
+139
+247
+247
+247
+247
+112
+247
+189
+105
+247
+247
+247
+247
+247
+288
+247
+247
+247
+157
+247
+139
+288
+288
+288
+247
+288
+288
+247
+288
+247
+247
+288
+288
+247
+247
+288
+174
+247
+247
+247
+247
+288
+247
+247
+247
+247
+247
+247
+247
+287
+106
+219
+288
+247
+247
+247
+247
+247
+288
+247
+247
+247
+247
+288
+247
+288
+264
+247
+247
+247
+247
+247
+247
+288
+247
+102
+247
+288
+247
+247
+247
+286
+128
+288
+247
+288
+288
+247
+288
+247
+247
+123
+247
+288
+288
+288
+287
+247
+247
+247
+288
+109
+234
+247
+106
+288
+247
+288
+288
+108
+247
+247
+247
+247
+117
+247
+193
+247
+247
+288
+288
+287
+288
+288
+247
+247
+247
+176
+177
+288
+247
+186
+247
+247
+247
+287
+247
+247
+247
+247
+247
+247
+287
+150
+247
+144
+288
+104
+247
+288
+247
+247
+235
+288
+288
+247
+247
+288
+288
+288
+247
+286
+247
+288
+288
+247
+288
+288
+125
+247
+247
+247
+287
+247
+193
+288
+136
+247
+247
+287
+247
+112
+247
+247
+288
+247
+288
+288
+121
+105
+247
+287
+288
+109
+183
+98
+288
+287
+288
+247
+247
+288
+247
+288
+247
+247
+288
+202
+247
+288
+247
+247
+247
+288
+247
+247
+247
+139
+247
+102
+247
+247
+247
+288
+288
+97
+102
+247
+288
+100
+288
+247
+247
+247
+288
+113
+247
+247
+280
+247
+288
+247
+247
+247
+288
+247
+247
+247
+247
+247
+247
+141
+247
+247
+144
+225
+247
+247
+155
+260
+217
+105
+288
+101
+247
+247
+167
+288
+247
+230
+247
+247
+286
+288
+288
+247
+247
+237
+247
+99
+288
+247
+247
+130
+288
+247
+288
+247
+247
+247
+288
+247
+288
+273
+247
+247
+247
+247
+247
+288
+247
+247
+247
+247
+247
+101
+247
+138
+288
+288
+247
+247
+247
+182
+247
+197
+247
+151
+247
+247
+247
+247
+107
+247
+169
+247
+288
+102
+250
+247
+247
+288
+247
+288
+287
+284
+247
+247
+288
+247
+247
+158
+288
+288
+247
+288
+247
+288
+247
+203
+260
+247
+288
+132
+287
+129
+178
+247
+288
+288
+247
+121
+247
+105
+247
+129
+169
+247
+287
+247
+152
+247
+247
+247
+247
+247
+247
+283
+247
+288
+247
+247
+247
+274
+247
+288
+247
+287
+260
+247
+247
+288
+247
+106
+288
+247
+288
+107
+247
+247
+288
+247
+247
+288
+288
+288
+247
+120
+247
+166
+247
+288
+247
+247
+288
+288
+288
+247
+247
+288
+247
+247
+247
+182
+288
+288
+288
+247
+288
+247
+247
+247
+247
+288
+247
+288
+247
+159
+247
+247
+112
+247
+247
+247
+247
+247
+247
+288
+285
+247
+247
+199
+247
+247
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+100
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+131
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+129
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+107
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+128
+142
+142
+142
+142
+142
+142
+142
+142
+122
+111
+142
+142
+142
+142
+142
+135
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+125
+142
+142
+142
+142
+142
+124
+142
+142
+142
+142
+142
+142
+121
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+116
+142
+142
+142
+142
+142
+142
+116
+142
+142
+142
+142
+142
+142
+142
+129
+142
+142
+135
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+108
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+135
+142
+142
+142
+135
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+107
+142
+142
+108
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+105
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+99
+142
+142
+142
+142
+142
+142
+142
+142
+142
+135
+100
+142
+133
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+112
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+101
+142
+102
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+107
+142
+142
+122
+142
+142
+142
+142
+142
+142
+142
+142
+125
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+108
+142
+142
+142
+142
+105
+127
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+104
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+112
+142
+142
+105
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+106
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+102
+142
+142
+142
+142
+142
+142
+128
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+106
+142
+142
+142
+142
+108
+142
+142
+142
+142
+117
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+104
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+125
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+112
+142
+142
+142
+142
+142
+142
+121
+105
+142
+142
+142
+109
+142
+98
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+102
+142
+142
+142
+142
+142
+97
+102
+142
+142
+100
+142
+142
+142
+142
+142
+113
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+105
+142
+101
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+99
+142
+142
+142
+130
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+101
+142
+138
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+107
+142
+142
+142
+142
+102
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+132
+142
+129
+142
+142
+142
+142
+142
+121
+142
+105
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+106
+142
+142
+142
+107
+142
+142
+142
+142
+142
+142
+142
+142
+142
+120
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+112
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+142
+288
+287
+288
+288
+288
+287
+288
+288
+284
+288
+288
+288
+288
+288
+288
+288
+157
+288
+100
+288
+288
+288
+287
+288
+288
+288
+106
+288
+288
+288
+288
+200
+286
+288
+288
+288
+149
+141
+131
+288
+288
+288
+152
+288
+288
+287
+287
+288
+288
+236
+142
+288
+121
+288
+288
+288
+288
+287
+288
+222
+287
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+206
+150
+288
+286
+288
+288
+288
+288
+288
+288
+288
+288
+129
+288
+288
+288
+251
+288
+288
+189
+288
+288
+288
+288
+288
+288
+288
+288
+288
+107
+276
+240
+288
+288
+288
+288
+288
+288
+286
+288
+164
+288
+288
+288
+288
+204
+280
+284
+288
+288
+288
+288
+288
+288
+288
+158
+281
+190
+288
+288
+288
+287
+198
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+128
+288
+288
+226
+288
+213
+288
+288
+288
+122
+111
+288
+287
+288
+288
+288
+135
+288
+288
+194
+288
+288
+288
+288
+288
+288
+287
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+125
+173
+288
+288
+288
+288
+124
+288
+252
+288
+288
+159
+288
+121
+288
+142
+159
+287
+288
+288
+124
+287
+215
+176
+288
+288
+288
+116
+159
+127
+288
+269
+288
+288
+116
+288
+288
+288
+156
+288
+288
+288
+129
+288
+288
+135
+285
+143
+179
+159
+288
+288
+265
+288
+288
+288
+288
+288
+288
+288
+195
+288
+230
+279
+108
+288
+288
+288
+182
+288
+288
+288
+171
+288
+288
+288
+155
+288
+135
+288
+288
+288
+135
+288
+210
+287
+160
+288
+288
+287
+288
+161
+288
+288
+284
+288
+288
+288
+288
+288
+287
+288
+288
+168
+288
+161
+288
+288
+181
+288
+288
+288
+288
+288
+288
+288
+288
+143
+288
+288
+288
+288
+287
+237
+288
+288
+288
+288
+152
+288
+288
+288
+288
+288
+288
+288
+288
+288
+132
+107
+285
+197
+108
+287
+288
+288
+180
+100
+288
+288
+288
+288
+288
+285
+288
+288
+284
+288
+285
+288
+288
+288
+105
+288
+288
+284
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+182
+288
+99
+288
+288
+288
+288
+288
+287
+288
+288
+288
+135
+100
+288
+133
+119
+288
+288
+288
+288
+288
+286
+288
+156
+150
+288
+173
+288
+288
+156
+129
+288
+143
+288
+185
+145
+112
+288
+288
+288
+288
+288
+288
+288
+97
+122
+288
+288
+101
+288
+102
+288
+288
+144
+288
+288
+288
+288
+288
+288
+288
+288
+107
+264
+288
+122
+288
+288
+288
+288
+288
+288
+288
+288
+125
+288
+288
+288
+288
+288
+216
+288
+288
+288
+164
+207
+288
+288
+288
+288
+285
+288
+288
+288
+144
+288
+288
+287
+288
+286
+288
+288
+288
+108
+288
+288
+288
+170
+105
+127
+288
+288
+151
+288
+288
+288
+288
+282
+214
+288
+128
+104
+288
+288
+288
+288
+288
+288
+288
+288
+277
+288
+288
+179
+288
+288
+288
+283
+288
+288
+288
+288
+288
+288
+140
+161
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+286
+288
+288
+286
+288
+288
+288
+288
+288
+288
+156
+265
+288
+288
+288
+161
+288
+288
+288
+288
+287
+288
+288
+288
+176
+288
+288
+288
+288
+139
+288
+288
+288
+288
+112
+287
+189
+105
+288
+288
+288
+288
+288
+288
+288
+288
+288
+157
+288
+139
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+174
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+287
+106
+219
+288
+288
+288
+288
+288
+286
+288
+288
+288
+288
+288
+288
+288
+288
+264
+288
+288
+288
+288
+288
+288
+288
+288
+102
+288
+288
+288
+288
+288
+286
+128
+288
+288
+288
+288
+288
+288
+288
+288
+123
+288
+288
+288
+288
+287
+288
+288
+288
+288
+109
+234
+288
+106
+288
+288
+288
+288
+108
+287
+288
+288
+288
+117
+288
+193
+288
+288
+288
+288
+287
+288
+288
+288
+288
+288
+176
+177
+288
+288
+186
+288
+288
+288
+287
+288
+288
+288
+288
+288
+288
+287
+150
+288
+144
+288
+104
+288
+288
+288
+288
+235
+288
+288
+288
+230
+288
+288
+288
+288
+286
+288
+288
+288
+288
+288
+288
+125
+288
+286
+288
+287
+288
+193
+288
+136
+288
+287
+287
+288
+112
+288
+288
+288
+288
+288
+288
+121
+105
+288
+287
+288
+109
+183
+98
+288
+287
+288
+288
+288
+288
+288
+288
+288
+288
+288
+202
+288
+288
+288
+288
+288
+288
+288
+288
+288
+139
+288
+102
+288
+288
+247
+288
+288
+97
+102
+288
+288
+100
+288
+288
+288
+288
+288
+113
+288
+288
+280
+288
+288
+288
+288
+288
+288
+288
+288
+287
+288
+288
+288
+141
+288
+288
+144
+225
+288
+288
+155
+260
+217
+105
+288
+101
+288
+288
+167
+288
+288
+230
+288
+288
+286
+288
+288
+288
+288
+237
+288
+99
+288
+288
+288
+130
+288
+288
+288
+286
+288
+288
+288
+288
+288
+273
+288
+288
+213
+288
+287
+288
+288
+288
+288
+288
+282
+101
+288
+138
+288
+288
+288
+288
+288
+182
+288
+197
+288
+151
+288
+288
+288
+288
+107
+288
+169
+288
+288
+102
+250
+288
+288
+288
+288
+288
+287
+284
+288
+288
+288
+288
+288
+158
+288
+288
+288
+288
+288
+288
+288
+203
+260
+288
+288
+132
+287
+129
+178
+288
+288
+288
+137
+121
+287
+105
+288
+129
+169
+288
+287
+288
+152
+288
+288
+288
+288
+288
+288
+283
+288
+288
+288
+283
+288
+274
+288
+288
+288
+287
+260
+288
+288
+288
+288
+106
+288
+288
+288
+107
+288
+97
+288
+288
+288
+288
+288
+288
+288
+120
+288
+166
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+182
+288
+288
+288
+288
+288
+288
+288
+288
+274
+288
+288
+288
+288
+159
+288
+288
+112
+288
+288
+288
+288
+288
+288
+288
+285
+288
+288
+199
+288
+288
+287
+288
+288
+1000
+287
+288
+1000
+284
+288
+1000
+288
+288
+787
+1000
+1000
+157
+288
+100
+288
+211
+288
+287
+288
+287
+288
+106
+288
+288
+288
+1000
+200
+286
+1000
+288
+288
+149
+141
+131
+1000
+1000
+288
+152
+288
+288
+287
+287
+288
+288
+236
+142
+288
+121
+1000
+288
+288
+1000
+287
+288
+222
+287
+1000
+288
+1000
+1000
+1000
+288
+288
+1000
+1000
+288
+206
+150
+1000
+286
+1000
+288
+288
+1000
+288
+288
+288
+285
+129
+288
+288
+996
+251
+288
+1000
+189
+288
+1000
+288
+1000
+1000
+1000
+1000
+1000
+288
+107
+276
+240
+288
+288
+288
+1000
+288
+995
+286
+1000
+164
+288
+288
+288
+1000
+204
+280
+284
+288
+288
+288
+997
+288
+288
+288
+158
+281
+190
+288
+288
+1000
+287
+198
+288
+1000
+286
+288
+288
+996
+288
+288
+1000
+996
+128
+288
+288
+226
+288
+213
+999
+288
+286
+122
+111
+287
+287
+1000
+1000
+288
+135
+1000
+1000
+194
+288
+285
+287
+288
+998
+609
+287
+1000
+1000
+1000
+288
+1000
+288
+288
+288
+288
+1000
+125
+173
+288
+1000
+998
+288
+124
+288
+252
+1000
+288
+159
+288
+121
+288
+142
+159
+287
+288
+288
+124
+287
+215
+176
+287
+1000
+1000
+116
+159
+127
+1000
+269
+288
+288
+116
+288
+1000
+288
+156
+1000
+288
+994
+129
+1000
+288
+135
+285
+143
+179
+159
+288
+288
+265
+1000
+288
+1000
+288
+1000
+288
+288
+195
+288
+230
+279
+108
+288
+288
+288
+182
+209
+288
+288
+171
+288
+288
+288
+155
+288
+135
+1000
+288
+1000
+135
+287
+210
+287
+160
+288
+288
+287
+1000
+161
+288
+1000
+284
+1000
+983
+288
+609
+288
+287
+1000
+288
+168
+288
+161
+288
+288
+181
+288
+288
+288
+288
+288
+288
+288
+288
+143
+288
+288
+288
+1000
+287
+237
+288
+994
+1000
+288
+152
+1000
+1000
+1000
+288
+288
+288
+288
+288
+288
+132
+107
+285
+197
+108
+287
+287
+982
+180
+100
+288
+288
+288
+288
+288
+285
+280
+288
+284
+288
+285
+1000
+1000
+288
+105
+288
+994
+284
+1000
+288
+1000
+288
+288
+1000
+1000
+288
+1000
+1000
+288
+288
+288
+1000
+288
+182
+1000
+99
+1000
+1000
+1000
+288
+288
+287
+285
+1000
+288
+135
+100
+288
+133
+119
+1000
+1000
+288
+288
+288
+286
+288
+156
+150
+1000
+173
+288
+719
+156
+129
+1000
+143
+288
+185
+145
+112
+288
+288
+288
+288
+997
+1000
+1000
+97
+122
+288
+1000
+101
+288
+102
+1000
+288
+144
+288
+288
+288
+288
+288
+288
+288
+288
+107
+264
+288
+122
+288
+288
+283
+288
+1000
+1000
+280
+288
+125
+287
+288
+288
+1000
+996
+216
+998
+998
+285
+164
+207
+1000
+1000
+1000
+1000
+285
+997
+1000
+288
+144
+288
+288
+287
+288
+286
+288
+999
+288
+108
+993
+288
+288
+170
+105
+127
+288
+288
+151
+1000
+288
+999
+1000
+282
+214
+288
+128
+104
+1000
+283
+288
+1000
+288
+1000
+1000
+1000
+277
+1000
+288
+179
+288
+286
+1000
+283
+1000
+286
+288
+1000
+1000
+1000
+140
+161
+288
+288
+1000
+1000
+288
+288
+288
+1000
+1000
+288
+288
+288
+288
+288
+287
+287
+288
+288
+286
+996
+1000
+286
+288
+1000
+288
+288
+288
+288
+156
+265
+1000
+288
+1000
+161
+288
+288
+1000
+1000
+287
+998
+98
+283
+176
+288
+288
+288
+996
+139
+1000
+1000
+288
+1000
+112
+287
+189
+105
+1000
+288
+288
+288
+288
+288
+998
+288
+996
+157
+1000
+139
+288
+288
+288
+1000
+288
+288
+1000
+288
+997
+288
+288
+288
+288
+288
+288
+174
+1000
+288
+288
+1000
+288
+1000
+288
+286
+1000
+288
+1000
+999
+287
+106
+219
+288
+994
+994
+288
+1000
+286
+288
+1000
+288
+1000
+288
+288
+1000
+288
+264
+1000
+288
+288
+288
+280
+288
+288
+288
+102
+995
+288
+288
+1000
+286
+286
+128
+288
+288
+288
+288
+288
+288
+1000
+288
+123
+288
+288
+288
+288
+287
+288
+288
+288
+288
+109
+234
+1000
+106
+288
+1000
+288
+288
+108
+287
+288
+996
+997
+117
+288
+193
+1000
+288
+288
+288
+287
+288
+288
+1000
+1000
+288
+176
+177
+288
+719
+186
+999
+288
+1000
+287
+1000
+1000
+1000
+1000
+1000
+288
+287
+150
+288
+144
+288
+104
+288
+288
+288
+1000
+235
+288
+288
+288
+230
+288
+288
+288
+1000
+286
+288
+288
+288
+1000
+288
+288
+125
+1000
+286
+288
+287
+1000
+193
+288
+136
+1000
+287
+287
+1000
+112
+288
+1000
+288
+1000
+288
+288
+121
+105
+1000
+287
+288
+109
+183
+98
+288
+287
+288
+288
+1000
+288
+288
+288
+1000
+288
+288
+202
+1000
+288
+1000
+1000
+1000
+288
+1000
+288
+288
+139
+997
+102
+288
+288
+247
+288
+288
+97
+102
+1000
+288
+100
+288
+1000
+288
+288
+288
+113
+1000
+286
+280
+288
+288
+288
+1000
+1000
+288
+288
+288
+287
+1000
+1000
+1000
+141
+1000
+1000
+144
+225
+1000
+998
+155
+260
+217
+105
+288
+101
+999
+288
+167
+288
+288
+230
+1000
+787
+286
+288
+288
+1000
+1000
+237
+288
+99
+288
+288
+999
+130
+288
+1000
+288
+286
+1000
+1000
+288
+286
+288
+273
+288
+288
+213
+999
+287
+288
+288
+1000
+1000
+1000
+282
+101
+1000
+138
+288
+288
+288
+288
+1000
+182
+1000
+197
+287
+151
+288
+288
+288
+288
+107
+1000
+169
+288
+288
+102
+250
+288
+1000
+288
+288
+288
+287
+284
+288
+1000
+288
+288
+288
+158
+288
+288
+288
+288
+288
+288
+1000
+203
+260
+288
+288
+132
+287
+129
+178
+1000
+288
+288
+137
+121
+287
+105
+999
+129
+169
+1000
+287
+1000
+152
+1000
+288
+1000
+1000
+1000
+998
+283
+1000
+288
+997
+283
+1000
+274
+288
+288
+1000
+287
+260
+288
+288
+288
+1000
+106
+288
+1000
+288
+107
+1000
+97
+288
+1000
+288
+288
+288
+288
+286
+120
+288
+166
+288
+288
+1000
+288
+288
+288
+288
+283
+996
+288
+1000
+1000
+288
+182
+288
+288
+288
+1000
+288
+1000
+1000
+288
+274
+288
+1000
+288
+1000
+159
+286
+288
+112
+1000
+1000
+288
+1000
+288
+288
+288
+285
+1000
+1000
+199
+288
+288
+288
+288
+287
+287
+287
+287
+284
+288
+287
+288
+288
+287
+287
+287
+157
+288
+100
+288
+287
+288
+287
+288
+287
+287
+106
+287
+288
+288
+287
+200
+286
+287
+288
+288
+149
+141
+131
+287
+287
+288
+152
+288
+288
+287
+287
+288
+288
+287
+142
+288
+121
+287
+287
+287
+287
+287
+288
+222
+287
+287
+288
+287
+287
+287
+287
+288
+287
+287
+288
+206
+150
+287
+286
+287
+288
+288
+287
+288
+287
+288
+287
+129
+288
+288
+287
+251
+288
+287
+189
+288
+287
+287
+287
+287
+287
+287
+287
+288
+107
+276
+240
+288
+288
+288
+287
+288
+287
+286
+287
+164
+288
+288
+288
+287
+204
+280
+284
+288
+288
+288
+287
+287
+288
+288
+158
+281
+190
+288
+288
+287
+287
+198
+288
+287
+287
+288
+288
+287
+288
+288
+287
+287
+128
+287
+288
+226
+288
+287
+287
+288
+287
+122
+111
+287
+287
+287
+287
+288
+135
+287
+287
+194
+288
+287
+287
+288
+287
+287
+287
+287
+287
+287
+288
+287
+287
+288
+288
+287
+287
+125
+173
+288
+287
+287
+288
+124
+288
+252
+287
+288
+159
+287
+121
+288
+142
+159
+287
+288
+287
+124
+287
+215
+176
+287
+287
+287
+116
+159
+127
+287
+269
+288
+288
+116
+288
+287
+288
+156
+287
+287
+287
+129
+287
+288
+135
+285
+143
+179
+159
+287
+288
+265
+287
+288
+287
+288
+287
+288
+287
+195
+288
+287
+279
+108
+288
+287
+288
+182
+287
+288
+288
+171
+287
+287
+288
+155
+288
+135
+287
+287
+287
+135
+287
+210
+287
+160
+288
+288
+287
+287
+161
+288
+287
+284
+287
+287
+288
+287
+288
+287
+287
+287
+168
+288
+161
+288
+288
+181
+288
+288
+288
+288
+288
+288
+288
+288
+143
+288
+288
+288
+287
+287
+237
+288
+287
+287
+288
+152
+287
+287
+287
+288
+287
+288
+288
+288
+288
+132
+107
+285
+197
+108
+287
+287
+287
+180
+100
+288
+288
+288
+287
+288
+287
+287
+288
+284
+288
+287
+287
+287
+288
+105
+288
+287
+284
+287
+288
+287
+288
+288
+287
+287
+288
+287
+287
+288
+288
+288
+287
+288
+182
+287
+99
+287
+287
+287
+288
+288
+287
+287
+287
+288
+135
+100
+288
+133
+119
+287
+287
+288
+288
+288
+287
+288
+156
+150
+287
+173
+288
+287
+156
+129
+287
+143
+288
+185
+145
+112
+288
+288
+287
+288
+287
+287
+287
+97
+122
+287
+287
+101
+288
+102
+287
+288
+144
+288
+288
+287
+287
+288
+288
+287
+288
+107
+264
+288
+122
+288
+287
+287
+288
+287
+287
+287
+288
+125
+287
+287
+288
+287
+287
+216
+287
+287
+287
+164
+207
+287
+287
+287
+287
+285
+287
+287
+287
+144
+288
+288
+287
+288
+286
+288
+287
+288
+108
+287
+288
+288
+170
+105
+127
+288
+288
+151
+287
+288
+287
+287
+282
+214
+288
+128
+104
+287
+287
+288
+287
+288
+287
+287
+287
+287
+287
+287
+179
+288
+287
+287
+283
+287
+287
+288
+287
+287
+287
+140
+161
+288
+288
+287
+287
+288
+288
+288
+287
+287
+288
+288
+287
+288
+288
+287
+287
+288
+288
+286
+287
+287
+286
+288
+287
+288
+288
+288
+288
+156
+265
+287
+288
+287
+161
+288
+288
+287
+287
+287
+287
+287
+287
+176
+288
+288
+287
+287
+139
+287
+287
+287
+287
+112
+287
+189
+105
+287
+288
+288
+288
+288
+288
+287
+288
+287
+157
+287
+139
+288
+288
+288
+287
+288
+288
+287
+288
+287
+288
+288
+288
+287
+288
+288
+174
+287
+288
+288
+287
+288
+287
+287
+287
+287
+288
+287
+287
+287
+106
+219
+288
+287
+287
+288
+287
+287
+288
+287
+287
+287
+288
+288
+287
+288
+264
+287
+288
+288
+288
+287
+287
+288
+288
+102
+287
+288
+288
+287
+287
+286
+128
+288
+288
+288
+288
+288
+288
+287
+288
+123
+287
+288
+288
+288
+287
+287
+288
+288
+288
+109
+234
+287
+106
+288
+287
+288
+288
+108
+287
+287
+287
+287
+117
+287
+193
+287
+288
+288
+288
+287
+288
+288
+287
+287
+288
+176
+177
+288
+287
+186
+287
+288
+287
+287
+287
+287
+287
+287
+287
+287
+287
+150
+288
+144
+288
+104
+287
+288
+287
+287
+235
+288
+288
+287
+287
+288
+288
+288
+287
+286
+288
+288
+288
+287
+288
+288
+125
+287
+287
+288
+287
+287
+193
+288
+136
+287
+287
+287
+287
+112
+288
+287
+288
+287
+288
+288
+121
+105
+287
+287
+288
+109
+183
+98
+288
+287
+288
+288
+287
+288
+287
+288
+287
+288
+288
+202
+287
+288
+287
+287
+287
+288
+287
+288
+288
+139
+287
+102
+288
+288
+247
+288
+288
+97
+102
+287
+288
+100
+288
+287
+287
+287
+288
+113
+287
+287
+280
+288
+288
+288
+287
+287
+288
+288
+288
+287
+287
+287
+287
+141
+287
+287
+144
+225
+287
+287
+155
+260
+217
+105
+288
+101
+287
+288
+167
+288
+288
+230
+287
+287
+286
+288
+288
+287
+287
+237
+288
+99
+288
+288
+287
+130
+288
+287
+288
+287
+287
+287
+288
+287
+288
+273
+287
+288
+287
+287
+287
+288
+288
+287
+287
+287
+282
+101
+287
+138
+288
+288
+288
+288
+287
+182
+287
+197
+287
+151
+287
+288
+288
+287
+107
+287
+169
+287
+288
+102
+250
+288
+287
+288
+288
+288
+287
+284
+287
+287
+288
+288
+288
+158
+288
+288
+288
+288
+287
+288
+287
+203
+260
+288
+288
+132
+287
+129
+178
+287
+288
+288
+137
+121
+287
+105
+287
+129
+169
+287
+287
+287
+152
+287
+288
+287
+287
+287
+287
+283
+287
+288
+287
+283
+287
+274
+287
+288
+287
+287
+260
+288
+287
+288
+287
+106
+288
+287
+288
+107
+287
+287
+288
+287
+288
+288
+288
+288
+287
+120
+288
+166
+287
+288
+287
+288
+288
+288
+288
+287
+287
+288
+287
+287
+288
+182
+288
+288
+288
+287
+288
+287
+287
+288
+287
+288
+287
+288
+287
+159
+287
+288
+112
+287
+287
+287
+287
+288
+287
+288
+285
+287
+287
+199
+288
+288
+288
+288
+287
+288
+288
+284
+288
+288
+288
+288
+288
+288
+288
+157
+288
+100
+288
+288
+288
+287
+288
+288
+288
+106
+288
+288
+288
+288
+200
+288
+288
+288
+288
+149
+141
+131
+288
+288
+288
+152
+288
+288
+287
+287
+288
+288
+288
+142
+288
+121
+288
+288
+288
+288
+287
+288
+222
+287
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+206
+150
+288
+286
+288
+288
+288
+288
+288
+288
+288
+288
+129
+288
+288
+288
+251
+288
+288
+189
+288
+288
+288
+288
+288
+288
+288
+288
+288
+107
+276
+240
+288
+288
+288
+288
+288
+288
+286
+288
+164
+288
+288
+288
+288
+204
+280
+288
+288
+288
+288
+288
+288
+288
+288
+158
+281
+190
+288
+288
+288
+287
+198
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+128
+288
+288
+226
+288
+288
+288
+288
+288
+122
+111
+288
+288
+288
+288
+288
+135
+288
+288
+194
+288
+288
+288
+288
+288
+288
+287
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+125
+173
+288
+288
+288
+288
+124
+288
+252
+288
+288
+159
+288
+121
+288
+142
+159
+287
+288
+288
+124
+287
+215
+176
+288
+288
+288
+116
+159
+127
+288
+269
+288
+288
+116
+288
+288
+288
+156
+288
+288
+288
+129
+288
+288
+135
+288
+143
+179
+159
+288
+288
+265
+288
+288
+288
+288
+288
+288
+288
+195
+288
+288
+279
+108
+288
+288
+288
+182
+288
+288
+288
+171
+288
+288
+288
+155
+288
+135
+288
+288
+288
+135
+288
+210
+287
+160
+288
+288
+287
+288
+161
+288
+288
+284
+288
+288
+288
+288
+288
+288
+288
+288
+168
+288
+161
+288
+288
+181
+288
+288
+288
+288
+288
+288
+288
+288
+143
+288
+288
+288
+288
+288
+237
+288
+288
+288
+288
+152
+288
+288
+288
+288
+288
+288
+288
+288
+288
+132
+107
+285
+197
+108
+287
+288
+288
+180
+100
+288
+288
+288
+288
+288
+288
+288
+288
+284
+288
+288
+288
+288
+288
+105
+288
+288
+284
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+182
+288
+99
+288
+288
+288
+288
+288
+287
+288
+288
+288
+135
+100
+288
+133
+119
+288
+288
+288
+288
+288
+288
+288
+156
+150
+288
+173
+288
+288
+156
+129
+288
+143
+288
+185
+145
+112
+288
+288
+288
+288
+288
+288
+288
+97
+122
+288
+288
+101
+288
+102
+288
+288
+144
+288
+288
+288
+288
+288
+288
+288
+288
+107
+264
+288
+122
+288
+288
+288
+288
+288
+288
+288
+288
+125
+288
+288
+288
+288
+288
+216
+288
+288
+288
+164
+207
+288
+288
+288
+288
+285
+288
+288
+288
+144
+288
+288
+287
+288
+288
+288
+288
+288
+108
+288
+288
+288
+170
+105
+127
+288
+288
+151
+288
+288
+288
+288
+288
+214
+288
+128
+104
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+179
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+140
+161
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+286
+288
+288
+286
+288
+288
+288
+288
+288
+288
+156
+265
+288
+288
+288
+161
+288
+288
+288
+288
+287
+288
+288
+288
+176
+288
+288
+288
+288
+139
+288
+288
+288
+288
+112
+288
+189
+105
+288
+288
+288
+288
+288
+288
+288
+288
+288
+157
+288
+139
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+174
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+287
+106
+219
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+264
+288
+288
+288
+288
+288
+288
+288
+288
+102
+288
+288
+288
+288
+288
+286
+128
+288
+288
+288
+288
+288
+288
+288
+288
+123
+288
+288
+288
+288
+287
+288
+288
+288
+288
+109
+234
+288
+106
+288
+288
+288
+288
+108
+288
+288
+288
+288
+117
+288
+193
+288
+288
+288
+288
+287
+288
+288
+288
+288
+288
+176
+177
+288
+288
+186
+288
+288
+288
+287
+288
+288
+288
+288
+288
+288
+287
+150
+288
+144
+288
+104
+288
+288
+288
+288
+235
+288
+288
+288
+288
+288
+288
+288
+288
+286
+288
+288
+288
+288
+288
+288
+125
+288
+288
+288
+287
+288
+193
+288
+136
+288
+287
+287
+288
+112
+288
+288
+288
+288
+288
+288
+121
+105
+288
+287
+288
+109
+183
+98
+288
+287
+288
+288
+288
+288
+288
+288
+288
+288
+288
+202
+288
+288
+288
+288
+288
+288
+288
+288
+288
+139
+288
+102
+288
+288
+247
+288
+288
+97
+102
+288
+288
+100
+288
+288
+288
+288
+288
+113
+288
+288
+280
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+141
+288
+288
+144
+225
+288
+288
+155
+260
+217
+105
+288
+101
+288
+288
+167
+288
+288
+230
+288
+288
+286
+288
+288
+288
+288
+237
+288
+99
+288
+288
+288
+130
+288
+288
+288
+288
+288
+288
+288
+288
+288
+273
+288
+288
+288
+288
+287
+288
+288
+288
+288
+288
+288
+101
+288
+138
+288
+288
+288
+288
+288
+182
+288
+197
+288
+151
+288
+288
+288
+288
+107
+288
+169
+288
+288
+102
+250
+288
+288
+288
+288
+288
+287
+284
+288
+288
+288
+288
+288
+158
+288
+288
+288
+288
+288
+288
+288
+203
+260
+288
+288
+132
+287
+129
+178
+288
+288
+288
+137
+121
+288
+105
+288
+129
+169
+288
+287
+288
+152
+288
+288
+288
+288
+288
+288
+283
+288
+288
+288
+288
+288
+274
+288
+288
+288
+287
+260
+288
+288
+288
+288
+106
+288
+288
+288
+107
+288
+288
+288
+288
+288
+288
+288
+288
+288
+120
+288
+166
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+182
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+159
+288
+288
+112
+288
+288
+288
+288
+288
+288
+288
+285
+288
+288
+199
+288
+288
+288
+287
+288
+288
+284
+288
+288
+288
+288
+288
+288
+288
+157
+288
+100
+288
+288
+288
+287
+288
+288
+288
+106
+288
+288
+288
+288
+200
+288
+288
+288
+288
+149
+141
+131
+288
+288
+288
+152
+288
+288
+287
+287
+288
+288
+288
+142
+288
+121
+288
+288
+288
+288
+287
+288
+222
+287
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+206
+150
+288
+286
+288
+288
+288
+288
+288
+288
+288
+288
+129
+288
+288
+288
+251
+288
+288
+189
+288
+288
+288
+288
+288
+288
+288
+288
+288
+107
+276
+288
+288
+288
+288
+288
+288
+288
+286
+288
+164
+288
+288
+288
+288
+204
+280
+288
+288
+288
+288
+288
+288
+288
+288
+158
+288
+190
+288
+288
+288
+287
+198
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+128
+288
+288
+226
+288
+288
+288
+288
+288
+122
+111
+288
+288
+288
+288
+288
+135
+288
+288
+194
+288
+288
+288
+288
+288
+288
+287
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+125
+173
+288
+288
+288
+288
+124
+288
+252
+288
+288
+159
+288
+121
+288
+142
+159
+287
+288
+288
+124
+288
+215
+176
+288
+288
+288
+116
+159
+127
+288
+269
+288
+288
+116
+288
+288
+288
+156
+288
+288
+288
+129
+288
+288
+135
+288
+143
+179
+159
+288
+288
+265
+288
+288
+288
+288
+288
+288
+288
+195
+288
+288
+279
+108
+288
+288
+288
+182
+288
+288
+288
+171
+288
+288
+288
+155
+288
+135
+288
+288
+288
+135
+288
+210
+288
+160
+288
+288
+287
+288
+161
+288
+288
+284
+288
+288
+288
+288
+288
+288
+288
+288
+168
+288
+161
+288
+288
+181
+288
+288
+288
+288
+288
+288
+288
+288
+143
+288
+288
+288
+288
+288
+237
+288
+288
+288
+288
+152
+288
+288
+288
+288
+288
+288
+288
+288
+288
+132
+107
+285
+197
+108
+287
+288
+288
+180
+100
+288
+288
+288
+288
+288
+288
+288
+288
+284
+288
+288
+288
+288
+288
+105
+288
+288
+284
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+182
+288
+99
+288
+288
+288
+288
+288
+287
+288
+288
+288
+135
+100
+288
+133
+119
+288
+288
+288
+288
+288
+288
+288
+156
+150
+288
+173
+288
+288
+156
+129
+288
+143
+288
+185
+145
+112
+288
+288
+288
+288
+288
+288
+288
+97
+122
+288
+288
+101
+288
+102
+288
+288
+144
+288
+288
+288
+288
+288
+288
+288
+288
+107
+264
+288
+122
+288
+288
+288
+288
+288
+288
+288
+288
+125
+288
+288
+288
+288
+288
+216
+288
+288
+288
+164
+207
+288
+288
+288
+288
+285
+288
+288
+288
+144
+288
+288
+287
+288
+288
+288
+288
+288
+108
+288
+288
+288
+170
+105
+127
+288
+288
+151
+288
+288
+288
+288
+288
+214
+288
+128
+104
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+179
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+140
+161
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+286
+288
+288
+288
+288
+288
+288
+288
+288
+288
+156
+265
+288
+288
+288
+161
+288
+288
+288
+288
+287
+288
+288
+288
+176
+288
+288
+288
+288
+139
+288
+288
+288
+288
+112
+288
+189
+105
+288
+288
+288
+288
+288
+288
+288
+288
+288
+157
+288
+139
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+174
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+287
+106
+219
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+264
+288
+288
+288
+288
+288
+288
+288
+288
+102
+288
+288
+288
+288
+288
+286
+128
+288
+288
+288
+288
+288
+288
+288
+288
+123
+288
+288
+288
+288
+287
+288
+288
+288
+288
+109
+234
+288
+106
+288
+288
+288
+288
+108
+288
+288
+288
+288
+117
+288
+193
+288
+288
+288
+288
+287
+288
+288
+288
+288
+288
+176
+177
+288
+288
+186
+288
+288
+288
+287
+288
+288
+288
+288
+288
+288
+287
+150
+288
+144
+288
+104
+288
+288
+288
+288
+235
+288
+288
+288
+288
+288
+288
+288
+288
+286
+288
+288
+288
+288
+288
+288
+125
+288
+288
+288
+287
+288
+193
+288
+136
+288
+288
+287
+288
+112
+288
+288
+288
+288
+288
+288
+121
+105
+288
+287
+288
+109
+183
+98
+288
+287
+288
+288
+288
+288
+288
+288
+288
+288
+288
+202
+288
+288
+288
+288
+288
+288
+288
+288
+288
+139
+288
+102
+288
+288
+247
+288
+288
+97
+102
+288
+288
+100
+288
+288
+288
+288
+288
+113
+288
+288
+280
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+141
+288
+288
+144
+225
+288
+288
+155
+260
+217
+105
+288
+101
+288
+288
+167
+288
+288
+230
+288
+288
+286
+288
+288
+288
+288
+237
+288
+99
+288
+288
+288
+130
+288
+288
+288
+288
+288
+288
+288
+288
+288
+273
+288
+288
+288
+288
+287
+288
+288
+288
+288
+288
+288
+101
+288
+138
+288
+288
+288
+288
+288
+182
+288
+197
+288
+151
+288
+288
+288
+288
+107
+288
+169
+288
+288
+102
+250
+288
+288
+288
+288
+288
+287
+284
+288
+288
+288
+288
+288
+158
+288
+288
+288
+288
+288
+288
+288
+203
+260
+288
+288
+132
+287
+129
+178
+288
+288
+288
+137
+121
+288
+105
+288
+129
+169
+288
+287
+288
+152
+288
+288
+288
+288
+288
+288
+283
+288
+288
+288
+288
+288
+274
+288
+288
+288
+287
+260
+288
+288
+288
+288
+106
+288
+288
+288
+107
+288
+288
+288
+288
+288
+288
+288
+288
+288
+120
+288
+166
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+182
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+159
+288
+288
+112
+288
+288
+288
+288
+288
+288
+288
+285
+288
+288
+199
+288
+288
+287
+288
+1000
+284
+288
+1000
+288
+288
+787
+1000
+1000
+157
+288
+100
+288
+211
+288
+287
+288
+287
+288
+106
+288
+288
+288
+1000
+200
+286
+1000
+288
+288
+149
+141
+131
+1000
+987
+288
+152
+288
+288
+287
+287
+288
+288
+236
+142
+288
+121
+1000
+288
+288
+1000
+287
+288
+222
+287
+1000
+288
+1000
+994
+1000
+288
+288
+999
+1000
+288
+206
+150
+1000
+286
+994
+288
+288
+1000
+288
+288
+288
+285
+129
+288
+288
+996
+251
+288
+995
+189
+288
+1000
+288
+994
+995
+1000
+1000
+231
+288
+107
+276
+240
+288
+288
+288
+994
+288
+995
+286
+1000
+164
+288
+288
+288
+1000
+204
+280
+284
+288
+288
+288
+997
+288
+288
+288
+158
+281
+190
+288
+288
+1000
+287
+198
+288
+1000
+286
+288
+288
+996
+288
+288
+994
+996
+128
+288
+288
+226
+288
+213
+999
+288
+286
+122
+111
+287
+287
+987
+1000
+288
+135
+1000
+1000
+194
+288
+285
+287
+288
+998
+609
+287
+1000
+1000
+1000
+288
+992
+288
+288
+288
+288
+1000
+125
+173
+288
+1000
+998
+288
+124
+288
+252
+998
+288
+159
+288
+121
+288
+142
+159
+287
+288
+288
+124
+287
+215
+176
+287
+1000
+996
+116
+159
+127
+1000
+269
+288
+288
+116
+288
+994
+288
+156
+998
+288
+994
+129
+990
+288
+135
+285
+143
+179
+159
+288
+288
+265
+1000
+288
+1000
+288
+1000
+288
+288
+195
+288
+230
+279
+108
+288
+288
+288
+182
+209
+288
+288
+171
+288
+288
+288
+155
+288
+135
+287
+288
+1000
+135
+287
+210
+287
+160
+288
+288
+287
+1000
+161
+288
+1000
+284
+994
+983
+288
+609
+288
+287
+997
+288
+168
+288
+161
+288
+288
+181
+288
+288
+288
+288
+288
+288
+288
+288
+143
+288
+288
+288
+994
+287
+237
+288
+994
+1000
+288
+152
+994
+1000
+287
+288
+288
+288
+288
+288
+288
+132
+107
+285
+197
+108
+287
+287
+982
+180
+100
+288
+288
+288
+288
+288
+285
+280
+288
+284
+288
+285
+1000
+1000
+288
+105
+288
+994
+284
+1000
+288
+995
+288
+288
+1000
+994
+288
+1000
+1000
+288
+288
+288
+1000
+288
+182
+1000
+99
+1000
+1000
+998
+288
+288
+287
+285
+1000
+288
+135
+100
+288
+133
+119
+1000
+1000
+288
+288
+288
+286
+288
+156
+150
+1000
+173
+288
+719
+156
+129
+1000
+143
+288
+185
+145
+112
+288
+288
+288
+288
+997
+994
+1000
+97
+122
+288
+1000
+101
+288
+102
+1000
+288
+144
+288
+288
+288
+288
+288
+288
+288
+288
+107
+264
+288
+122
+288
+288
+283
+288
+1000
+1000
+280
+288
+125
+287
+288
+288
+1000
+996
+216
+998
+998
+285
+164
+207
+1000
+1000
+996
+1000
+285
+997
+997
+288
+144
+288
+288
+287
+288
+286
+288
+999
+288
+108
+993
+288
+288
+170
+105
+127
+288
+288
+151
+1000
+288
+999
+1000
+282
+214
+288
+128
+104
+1000
+283
+288
+1000
+288
+1000
+999
+992
+277
+1000
+288
+179
+288
+286
+1000
+283
+994
+286
+288
+1000
+1000
+1000
+140
+161
+288
+288
+1000
+1000
+288
+288
+288
+1000
+993
+288
+288
+288
+288
+288
+287
+287
+288
+288
+286
+996
+1000
+286
+288
+1000
+288
+288
+288
+288
+156
+265
+1000
+288
+1000
+161
+288
+288
+1000
+1000
+287
+998
+98
+283
+176
+288
+288
+288
+996
+139
+1000
+1000
+288
+1000
+112
+287
+189
+105
+994
+288
+288
+288
+288
+288
+998
+288
+996
+157
+1000
+139
+288
+288
+288
+990
+288
+288
+1000
+288
+997
+288
+288
+288
+288
+288
+288
+174
+994
+288
+288
+1000
+288
+998
+288
+286
+994
+288
+996
+999
+287
+106
+219
+288
+994
+994
+288
+1000
+286
+288
+1000
+288
+1000
+288
+288
+1000
+288
+264
+1000
+288
+288
+288
+280
+288
+288
+288
+102
+995
+288
+288
+998
+286
+286
+128
+288
+288
+288
+288
+288
+288
+994
+288
+123
+288
+288
+288
+288
+287
+288
+288
+288
+288
+109
+234
+998
+106
+288
+997
+288
+288
+108
+287
+288
+996
+997
+117
+288
+193
+1000
+288
+288
+288
+287
+288
+288
+1000
+1000
+288
+176
+177
+288
+719
+186
+999
+288
+1000
+287
+994
+1000
+994
+1000
+1000
+288
+287
+150
+288
+144
+288
+104
+288
+288
+288
+1000
+235
+288
+288
+288
+230
+288
+288
+288
+1000
+286
+288
+288
+288
+994
+288
+288
+125
+999
+286
+288
+287
+286
+193
+288
+136
+1000
+287
+287
+1000
+112
+288
+1000
+288
+1000
+288
+288
+121
+105
+1000
+287
+288
+109
+183
+98
+288
+287
+288
+288
+1000
+288
+288
+288
+1000
+288
+288
+202
+1000
+288
+1000
+1000
+1000
+288
+1000
+288
+288
+139
+997
+102
+288
+288
+247
+288
+288
+97
+102
+1000
+288
+100
+288
+1000
+288
+288
+288
+113
+1000
+286
+280
+288
+288
+288
+999
+1000
+288
+288
+288
+287
+1000
+994
+1000
+141
+992
+1000
+144
+225
+1000
+998
+155
+260
+217
+105
+288
+101
+999
+288
+167
+288
+288
+230
+1000
+787
+286
+288
+288
+992
+997
+237
+288
+99
+288
+288
+999
+130
+288
+1000
+288
+286
+999
+995
+288
+286
+288
+273
+288
+288
+213
+999
+287
+288
+288
+1000
+1000
+1000
+282
+101
+994
+138
+288
+288
+288
+288
+1000
+182
+998
+197
+287
+151
+288
+288
+288
+288
+107
+1000
+169
+288
+288
+102
+250
+288
+1000
+288
+288
+288
+287
+284
+288
+1000
+288
+288
+288
+158
+288
+288
+288
+288
+288
+288
+1000
+203
+260
+288
+288
+132
+287
+129
+178
+1000
+288
+288
+137
+121
+287
+105
+999
+129
+169
+996
+287
+1000
+152
+994
+288
+994
+1000
+1000
+998
+283
+1000
+288
+997
+283
+1000
+274
+288
+288
+1000
+287
+260
+288
+288
+288
+1000
+106
+288
+1000
+288
+107
+999
+97
+288
+990
+288
+288
+288
+288
+286
+120
+288
+166
+288
+288
+1000
+288
+288
+288
+288
+283
+996
+288
+1000
+1000
+288
+182
+288
+288
+288
+1000
+288
+1000
+1000
+288
+274
+288
+994
+288
+994
+159
+286
+288
+112
+1000
+1000
+288
+1000
+288
+288
+288
+285
+1000
+996
+199
+288
+288
+287
+287
+284
+288
+287
+287
+288
+287
+287
+287
+157
+287
+100
+287
+287
+287
+287
+288
+287
+287
+106
+287
+287
+288
+287
+287
+287
+287
+288
+288
+149
+141
+131
+287
+287
+287
+152
+287
+287
+287
+287
+287
+288
+287
+142
+287
+121
+287
+287
+287
+287
+287
+287
+222
+287
+287
+288
+287
+287
+287
+287
+287
+287
+287
+288
+206
+150
+287
+287
+287
+288
+288
+287
+287
+287
+288
+287
+129
+288
+287
+287
+287
+287
+287
+189
+288
+287
+287
+287
+287
+287
+287
+287
+287
+107
+276
+287
+287
+287
+288
+287
+288
+287
+286
+287
+164
+288
+288
+288
+287
+204
+280
+287
+287
+288
+287
+287
+287
+288
+287
+158
+287
+190
+288
+288
+287
+287
+198
+288
+287
+287
+287
+287
+287
+288
+288
+287
+287
+128
+287
+288
+226
+287
+287
+287
+287
+287
+122
+111
+287
+287
+287
+287
+288
+135
+287
+287
+194
+288
+287
+287
+288
+287
+287
+287
+287
+287
+287
+288
+287
+287
+288
+287
+287
+287
+125
+173
+288
+287
+287
+288
+124
+287
+252
+287
+288
+159
+287
+121
+287
+142
+159
+287
+287
+287
+124
+287
+215
+176
+287
+287
+287
+116
+159
+127
+287
+269
+287
+288
+116
+288
+287
+288
+156
+287
+287
+287
+129
+287
+288
+135
+287
+143
+179
+159
+287
+288
+265
+287
+287
+287
+288
+287
+288
+287
+195
+287
+287
+279
+108
+288
+287
+288
+182
+287
+287
+287
+171
+287
+287
+287
+155
+288
+135
+287
+287
+287
+135
+287
+210
+287
+160
+287
+288
+287
+287
+161
+287
+287
+287
+287
+287
+287
+287
+287
+287
+287
+287
+168
+287
+161
+288
+288
+181
+288
+287
+287
+288
+287
+288
+288
+288
+143
+287
+288
+288
+287
+287
+287
+288
+287
+287
+287
+152
+287
+287
+287
+287
+287
+288
+288
+287
+288
+132
+107
+285
+197
+108
+287
+287
+287
+180
+100
+288
+288
+287
+287
+288
+287
+287
+288
+287
+288
+287
+287
+287
+288
+105
+288
+287
+284
+287
+288
+287
+287
+288
+287
+287
+288
+287
+287
+287
+288
+287
+287
+288
+182
+287
+99
+287
+287
+287
+288
+288
+287
+287
+287
+288
+135
+100
+288
+133
+119
+287
+287
+287
+287
+288
+287
+288
+156
+150
+287
+173
+287
+287
+287
+129
+287
+143
+287
+185
+145
+112
+288
+288
+287
+288
+287
+287
+287
+97
+122
+287
+287
+101
+288
+102
+287
+287
+144
+287
+288
+287
+287
+288
+287
+287
+287
+107
+264
+288
+122
+287
+287
+287
+288
+287
+287
+287
+287
+125
+287
+287
+287
+287
+287
+216
+287
+287
+287
+164
+207
+287
+287
+287
+287
+285
+287
+287
+287
+144
+287
+288
+287
+287
+287
+288
+287
+288
+108
+287
+287
+288
+170
+105
+127
+287
+287
+151
+287
+288
+287
+287
+287
+214
+288
+128
+104
+287
+287
+288
+287
+288
+287
+287
+287
+287
+287
+287
+179
+288
+287
+287
+287
+287
+287
+288
+287
+287
+287
+140
+161
+287
+288
+287
+287
+288
+287
+288
+287
+287
+288
+288
+287
+288
+287
+287
+287
+287
+288
+286
+287
+287
+287
+288
+287
+288
+287
+288
+287
+156
+265
+287
+287
+287
+161
+287
+288
+287
+287
+287
+287
+287
+287
+176
+288
+287
+287
+287
+139
+287
+287
+287
+287
+112
+287
+189
+105
+287
+287
+287
+287
+287
+287
+287
+287
+287
+157
+287
+139
+288
+288
+288
+287
+288
+287
+287
+288
+287
+287
+288
+288
+287
+287
+287
+174
+287
+287
+287
+287
+288
+287
+287
+287
+287
+287
+287
+287
+287
+106
+219
+287
+287
+287
+287
+287
+287
+288
+287
+287
+287
+287
+288
+287
+288
+264
+287
+287
+287
+287
+287
+287
+288
+287
+102
+287
+288
+287
+287
+287
+286
+128
+288
+287
+287
+287
+287
+288
+287
+287
+287
+287
+288
+288
+288
+287
+287
+287
+287
+288
+109
+234
+287
+106
+288
+287
+288
+288
+108
+287
+287
+287
+287
+117
+287
+193
+287
+287
+287
+288
+287
+288
+287
+287
+287
+287
+176
+177
+288
+287
+186
+287
+287
+287
+287
+287
+287
+287
+287
+287
+287
+287
+150
+287
+144
+288
+104
+287
+288
+287
+287
+235
+288
+288
+287
+287
+287
+288
+288
+287
+286
+287
+288
+288
+287
+288
+288
+125
+287
+287
+287
+287
+287
+193
+288
+136
+287
+287
+287
+287
+112
+287
+287
+288
+287
+287
+288
+121
+105
+287
+287
+288
+109
+183
+98
+288
+287
+288
+287
+287
+288
+287
+288
+287
+287
+288
+202
+287
+288
+287
+287
+287
+288
+287
+287
+287
+139
+287
+102
+287
+287
+247
+288
+288
+97
+102
+287
+288
+100
+287
+287
+287
+287
+288
+113
+287
+287
+280
+287
+288
+287
+287
+287
+288
+287
+287
+287
+287
+287
+287
+141
+287
+287
+144
+225
+287
+287
+155
+260
+217
+105
+288
+101
+287
+287
+167
+288
+287
+230
+287
+287
+286
+288
+288
+287
+287
+237
+287
+99
+287
+287
+287
+130
+288
+287
+288
+287
+287
+287
+288
+287
+287
+273
+287
+287
+287
+287
+287
+288
+287
+287
+287
+287
+287
+101
+287
+138
+288
+288
+287
+287
+287
+182
+287
+197
+287
+151
+287
+287
+287
+287
+107
+287
+169
+287
+288
+102
+250
+287
+287
+288
+287
+288
+287
+284
+287
+287
+288
+287
+287
+158
+288
+288
+287
+288
+287
+288
+287
+203
+260
+287
+287
+132
+287
+129
+178
+287
+288
+288
+287
+121
+287
+105
+287
+129
+169
+287
+287
+287
+152
+287
+287
+287
+287
+287
+287
+283
+287
+287
+287
+287
+287
+274
+287
+288
+287
+287
+260
+287
+287
+288
+287
+106
+288
+287
+288
+107
+287
+287
+288
+287
+287
+288
+288
+288
+287
+120
+287
+166
+287
+288
+287
+287
+288
+288
+288
+287
+287
+288
+287
+287
+287
+182
+287
+288
+288
+287
+287
+287
+287
+287
+287
+288
+287
+288
+287
+159
+287
+287
+112
+287
+287
+287
+287
+287
+287
+288
+285
+287
+287
+199
+287
+287
+288
+284
+288
+288
+288
+288
+288
+288
+288
+157
+288
+100
+288
+288
+288
+287
+288
+288
+288
+106
+288
+288
+288
+288
+200
+286
+288
+288
+288
+149
+141
+131
+288
+288
+288
+152
+288
+288
+287
+287
+288
+288
+288
+142
+288
+121
+288
+288
+288
+288
+287
+288
+222
+287
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+206
+150
+288
+286
+288
+288
+288
+288
+288
+288
+288
+288
+129
+288
+288
+288
+251
+288
+288
+189
+288
+288
+288
+288
+288
+288
+288
+288
+288
+107
+276
+240
+288
+288
+288
+288
+288
+288
+286
+288
+164
+288
+288
+288
+288
+204
+280
+284
+288
+288
+288
+288
+288
+288
+288
+158
+281
+190
+288
+288
+288
+287
+198
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+128
+288
+288
+226
+288
+288
+288
+288
+288
+122
+111
+288
+288
+288
+288
+288
+135
+288
+288
+194
+288
+288
+288
+288
+288
+288
+287
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+125
+173
+288
+288
+288
+288
+124
+288
+252
+288
+288
+159
+288
+121
+288
+142
+159
+287
+288
+288
+124
+287
+215
+176
+288
+288
+288
+116
+159
+127
+288
+269
+288
+288
+116
+288
+288
+288
+156
+288
+288
+288
+129
+288
+288
+135
+285
+143
+179
+159
+288
+288
+265
+288
+288
+288
+288
+288
+288
+288
+195
+288
+288
+279
+108
+288
+288
+288
+182
+288
+288
+288
+171
+288
+288
+288
+155
+288
+135
+288
+288
+288
+135
+288
+210
+287
+160
+288
+288
+287
+288
+161
+288
+288
+284
+288
+288
+288
+288
+288
+287
+288
+288
+168
+288
+161
+288
+288
+181
+288
+288
+288
+288
+288
+288
+288
+288
+143
+288
+288
+288
+288
+288
+237
+288
+288
+288
+288
+152
+288
+288
+288
+288
+288
+288
+288
+288
+288
+132
+107
+285
+197
+108
+287
+288
+288
+180
+100
+288
+288
+288
+288
+288
+288
+288
+288
+284
+288
+288
+288
+288
+288
+105
+288
+288
+284
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+182
+288
+99
+288
+288
+288
+288
+288
+287
+288
+288
+288
+135
+100
+288
+133
+119
+288
+288
+288
+288
+288
+288
+288
+156
+150
+288
+173
+288
+288
+156
+129
+288
+143
+288
+185
+145
+112
+288
+288
+288
+288
+288
+288
+288
+97
+122
+288
+288
+101
+288
+102
+288
+288
+144
+288
+288
+288
+288
+288
+288
+288
+288
+107
+264
+288
+122
+288
+288
+288
+288
+288
+288
+288
+288
+125
+288
+288
+288
+288
+288
+216
+288
+288
+288
+164
+207
+288
+288
+288
+288
+285
+288
+288
+288
+144
+288
+288
+287
+288
+286
+288
+288
+288
+108
+288
+288
+288
+170
+105
+127
+288
+288
+151
+288
+288
+288
+288
+282
+214
+288
+128
+104
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+179
+288
+288
+288
+283
+288
+288
+288
+288
+288
+288
+140
+161
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+286
+288
+288
+286
+288
+288
+288
+288
+288
+288
+156
+265
+288
+288
+288
+161
+288
+288
+288
+288
+287
+288
+288
+288
+176
+288
+288
+288
+288
+139
+288
+288
+288
+288
+112
+287
+189
+105
+288
+288
+288
+288
+288
+288
+288
+288
+288
+157
+288
+139
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+174
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+287
+106
+219
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+264
+288
+288
+288
+288
+288
+288
+288
+288
+102
+288
+288
+288
+288
+288
+286
+128
+288
+288
+288
+288
+288
+288
+288
+288
+123
+288
+288
+288
+288
+287
+288
+288
+288
+288
+109
+234
+288
+106
+288
+288
+288
+288
+108
+288
+288
+288
+288
+117
+288
+193
+288
+288
+288
+288
+287
+288
+288
+288
+288
+288
+176
+177
+288
+288
+186
+288
+288
+288
+287
+288
+288
+288
+288
+288
+288
+287
+150
+288
+144
+288
+104
+288
+288
+288
+288
+235
+288
+288
+288
+288
+288
+288
+288
+288
+286
+288
+288
+288
+288
+288
+288
+125
+288
+288
+288
+287
+288
+193
+288
+136
+288
+287
+287
+288
+112
+288
+288
+288
+288
+288
+288
+121
+105
+288
+287
+288
+109
+183
+98
+288
+287
+288
+288
+288
+288
+288
+288
+288
+288
+288
+202
+288
+288
+288
+288
+288
+288
+288
+288
+288
+139
+288
+102
+288
+288
+247
+288
+288
+97
+102
+288
+288
+100
+288
+288
+288
+288
+288
+113
+288
+288
+280
+288
+288
+288
+288
+288
+288
+288
+288
+287
+288
+288
+288
+141
+288
+288
+144
+225
+288
+288
+155
+260
+217
+105
+288
+101
+288
+288
+167
+288
+288
+230
+288
+288
+286
+288
+288
+288
+288
+237
+288
+99
+288
+288
+288
+130
+288
+288
+288
+288
+288
+288
+288
+288
+288
+273
+288
+288
+288
+288
+287
+288
+288
+288
+288
+288
+282
+101
+288
+138
+288
+288
+288
+288
+288
+182
+288
+197
+288
+151
+288
+288
+288
+288
+107
+288
+169
+288
+288
+102
+250
+288
+288
+288
+288
+288
+287
+284
+288
+288
+288
+288
+288
+158
+288
+288
+288
+288
+288
+288
+288
+203
+260
+288
+288
+132
+287
+129
+178
+288
+288
+288
+137
+121
+288
+105
+288
+129
+169
+288
+287
+288
+152
+288
+288
+288
+288
+288
+288
+283
+288
+288
+288
+283
+288
+274
+288
+288
+288
+287
+260
+288
+288
+288
+288
+106
+288
+288
+288
+107
+288
+288
+288
+288
+288
+288
+288
+288
+288
+120
+288
+166
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+182
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+288
+159
+288
+288
+112
+288
+288
+288
+288
+288
+288
+288
+285
+288
+288
+199
+288
+288
+284
+288
+1000
+288
+288
+787
+1000
+1000
+157
+288
+100
+288
+211
+288
+287
+288
+287
+288
+106
+288
+288
+288
+1000
+200
+286
+1000
+288
+288
+149
+141
+131
+1000
+1000
+288
+152
+288
+288
+287
+287
+288
+288
+236
+142
+288
+121
+1000
+288
+288
+1000
+287
+288
+222
+287
+1000
+288
+1000
+1000
+1000
+288
+288
+1000
+1000
+288
+206
+150
+1000
+286
+1000
+288
+288
+1000
+288
+288
+288
+285
+129
+288
+288
+1000
+251
+288
+1000
+189
+288
+1000
+288
+1000
+1000
+1000
+1000
+1000
+288
+107
+276
+240
+288
+288
+288
+1000
+288
+1000
+286
+1000
+164
+288
+288
+288
+1000
+204
+280
+284
+288
+288
+288
+1000
+288
+288
+288
+158
+281
+190
+288
+288
+1000
+287
+198
+288
+1000
+1000
+288
+288
+1000
+288
+288
+1000
+1000
+128
+288
+288
+226
+288
+213
+1000
+288
+286
+122
+111
+287
+287
+1000
+1000
+288
+135
+1000
+1000
+194
+288
+1000
+287
+288
+1000
+609
+287
+1000
+1000
+1000
+288
+1000
+288
+288
+288
+288
+1000
+125
+173
+288
+1000
+1000
+288
+124
+288
+252
+1000
+288
+159
+288
+121
+288
+142
+159
+287
+288
+288
+124
+287
+215
+176
+287
+1000
+1000
+116
+159
+127
+1000
+269
+288
+288
+116
+288
+1000
+288
+156
+1000
+288
+1000
+129
+1000
+288
+135
+285
+143
+179
+159
+288
+288
+265
+1000
+288
+1000
+288
+1000
+288
+288
+195
+288
+230
+279
+108
+288
+288
+288
+182
+209
+288
+288
+171
+288
+288
+288
+155
+288
+135
+1000
+288
+1000
+135
+287
+210
+287
+160
+288
+288
+287
+1000
+161
+288
+1000
+284
+1000
+1000
+288
+609
+288
+287
+1000
+288
+168
+288
+161
+288
+288
+181
+288
+288
+288
+288
+288
+288
+288
+288
+143
+288
+288
+288
+1000
+287
+237
+288
+1000
+1000
+288
+152
+1000
+1000
+1000
+288
+288
+288
+288
+288
+288
+132
+107
+285
+197
+108
+287
+287
+1000
+180
+100
+288
+288
+288
+288
+288
+285
+280
+288
+284
+288
+285
+1000
+1000
+288
+105
+288
+1000
+284
+1000
+288
+1000
+288
+288
+1000
+1000
+288
+1000
+1000
+288
+288
+288
+1000
+288
+182
+1000
+99
+1000
+1000
+1000
+288
+288
+287
+285
+1000
+288
+135
+100
+288
+133
+119
+1000
+1000
+288
+288
+288
+286
+288
+156
+150
+1000
+173
+288
+1000
+156
+129
+1000
+143
+288
+185
+145
+112
+288
+288
+288
+288
+1000
+1000
+1000
+97
+122
+288
+1000
+101
+288
+102
+1000
+288
+144
+288
+288
+288
+288
+288
+288
+288
+288
+107
+264
+288
+122
+288
+288
+283
+288
+1000
+1000
+280
+288
+125
+287
+288
+288
+1000
+1000
+216
+1000
+1000
+285
+164
+207
+1000
+1000
+1000
+1000
+285
+1000
+1000
+288
+144
+288
+288
+287
+288
+286
+288
+1000
+288
+108
+1000
+288
+288
+170
+105
+127
+288
+288
+151
+1000
+288
+1000
+1000
+282
+214
+288
+128
+104
+1000
+1000
+288
+1000
+288
+1000
+1000
+1000
+277
+1000
+288
+179
+288
+286
+1000
+283
+1000
+1000
+288
+1000
+1000
+1000
+140
+161
+288
+288
+1000
+1000
+288
+288
+288
+1000
+1000
+288
+288
+288
+288
+288
+287
+1000
+288
+288
+286
+1000
+1000
+286
+288
+1000
+288
+288
+288
+288
+156
+265
+1000
+288
+1000
+161
+288
+288
+1000
+1000
+287
+1000
+98
+283
+176
+288
+288
+288
+1000
+139
+1000
+1000
+288
+1000
+112
+287
+189
+105
+1000
+288
+288
+288
+288
+288
+1000
+288
+1000
+157
+1000
+139
+288
+288
+288
+1000
+288
+288
+1000
+288
+1000
+288
+288
+288
+288
+288
+288
+174
+1000
+288
+288
+1000
+288
+1000
+288
+1000
+1000
+288
+1000
+1000
+287
+106
+219
+288
+1000
+1000
+288
+1000
+286
+288
+1000
+288
+1000
+288
+288
+1000
+288
+264
+1000
+288
+288
+288
+280
+288
+288
+288
+102
+1000
+288
+288
+1000
+286
+286
+128
+288
+288
+288
+288
+288
+288
+1000
+288
+123
+288
+288
+288
+288
+287
+288
+288
+288
+288
+109
+234
+1000
+106
+288
+1000
+288
+288
+108
+287
+288
+1000
+1000
+117
+288
+193
+1000
+288
+288
+288
+287
+288
+288
+1000
+1000
+288
+176
+177
+288
+1000
+186
+1000
+288
+1000
+287
+1000
+1000
+1000
+1000
+1000
+288
+287
+150
+288
+144
+288
+104
+288
+288
+288
+1000
+235
+288
+288
+288
+230
+288
+288
+288
+1000
+286
+288
+288
+288
+1000
+288
+288
+125
+1000
+286
+288
+287
+1000
+193
+288
+136
+1000
+287
+287
+1000
+112
+288
+1000
+288
+1000
+288
+288
+121
+105
+1000
+287
+288
+109
+183
+98
+288
+287
+288
+288
+1000
+288
+288
+288
+1000
+288
+288
+202
+1000
+288
+1000
+1000
+1000
+288
+1000
+288
+288
+139
+1000
+102
+288
+288
+247
+288
+288
+97
+102
+1000
+288
+100
+288
+1000
+288
+288
+288
+113
+1000
+286
+280
+288
+288
+288
+1000
+1000
+288
+288
+288
+287
+1000
+1000
+1000
+141
+1000
+1000
+144
+225
+1000
+1000
+155
+260
+217
+105
+288
+101
+1000
+288
+167
+288
+288
+230
+1000
+787
+286
+288
+288
+1000
+1000
+237
+288
+99
+288
+288
+1000
+130
+288
+1000
+288
+286
+1000
+1000
+288
+1000
+288
+273
+288
+288
+213
+1000
+287
+288
+288
+1000
+1000
+1000
+282
+101
+1000
+138
+288
+288
+288
+288
+1000
+182
+1000
+197
+1000
+151
+288
+288
+288
+288
+107
+1000
+169
+288
+288
+102
+250
+288
+1000
+288
+288
+288
+287
+284
+288
+1000
+288
+288
+288
+158
+288
+288
+288
+288
+288
+288
+1000
+203
+260
+288
+288
+132
+287
+129
+178
+1000
+288
+288
+137
+121
+287
+105
+1000
+129
+169
+1000
+287
+1000
+152
+1000
+288
+1000
+1000
+1000
+1000
+283
+1000
+288
+1000
+283
+1000
+274
+288
+288
+1000
+287
+260
+288
+288
+288
+1000
+106
+288
+1000
+288
+107
+1000
+97
+288
+1000
+288
+288
+288
+288
+286
+120
+288
+166
+288
+288
+1000
+288
+288
+288
+288
+283
+1000
+288
+1000
\ No newline at end of file
diff --git a/dedupe/dtw/rectangleMatrixProper.java b/dedupe/dtw/rectangleMatrixProper.java
new file mode 100644
index 00000000..cb62ea8a
--- /dev/null
+++ b/dedupe/dtw/rectangleMatrixProper.java
@@ -0,0 +1,255 @@
+import java.io.FileInputStream;
+import java.io.FileNotFoundException;
+import java.util.Scanner;
+
+public class rectangleMatrixProper extends SqaureGridUpdateRec
+{
+	static int[] ZeroCounter; //static members of the class which can be accessed anywhere
+	static int[][] DistanceMatrix;
+	static int[] LongestZeroString;
+	static int[][] LZScoordinates;
+	static int[] DataSetX;
+  	static int[] DataSetY;
+
+
+
+	public static void main(String[] args) throws FileNotFoundException 
+	{
+
+//QUICK TEST CASES
+		// {1,1,2,2,1,1};//set of values that should have different LongestZeroString and ZeroCounter
+		// {1,2,2,2,0,1};
+
+	// int[] ArrayX = new int[]{1,1,2,3,2,1,0};//set of values that should have different LongestZeroString and ZeroCounter
+	// int[] ArrayY = new int[]{0,1,1,2,3,2,1};
+
+		//{0,0,0,1,1};//
+		//{0,0,1,1,0};//
+
+
+		 // int[] ArrayY = new int[]{1,2,1,1,2,4,4,3}; 
+		 // int[] ArrayX = new int[]{1,1,1,2,4,4,3,2,3,2,1};
+
+		int[] ArrayY = new int[]{2,2,3,3,2,2,2,2,2}; //set of values that should have different LongestZeroString and ZeroCounter
+		int[] ArrayX = new int[]{2,2,2,3,2,2};
+
+		 // int[] ArrayX = new int[]{3,2,3,1}; //GOOD example of finding starting coordinates of starting positions
+		 // int[] ArrayY = new int[]{2,3,1,3,1,3,4,1};
+		// int[] ArrayX = new int[]{80,82,85,85,94,90,90,75,77,80,81};
+		// int[] ArrayY = new int[]{75,77,80,82,85,85,85,89,94,90,90};
+		
+
+		// FileInputStream data = new FileInputStream("/Users/srapp/Desktop/data-analytics/dedupe/dtw/dataset.txt"); //X
+  //       FileInputStream data2 = new FileInputStream("/Users/srapp/Desktop/data-analytics/dedupe/dtw/dataset2.txt"); //Y
+  //       Scanner scanner = new Scanner(data);
+  //       Scanner scanner2 = new Scanner(data2);
+
+        DataSetX = new int[11044];//I looked at the number of lines in the file
+        DataSetY = new int[11044];
+        DataSetX = ArrayX;
+        DataSetY = ArrayY;
+
+        // int i = 0;
+        // while(scanner.hasNextLine())
+        //     {
+                      
+        //         DataSetX[i] = scanner.nextInt();
+        //         DataSetY[i] = scanner2.nextInt();
+               
+        //         i++;
+        //     } 
+        // scanner.close();
+        // scanner2.close();
+
+
+
+		int HorizontalTraversals = DataSetX.length+DataSetY.length-1;
+		ZeroCounter = new int[HorizontalTraversals]; //count total zero/matchs in each diagonal traversal 
+		LongestZeroString = new int[HorizontalTraversals]; //tallys the longest continious string of zeros found in any given traversal
+		LZScoordinates = new int[HorizontalTraversals][2];//records coordinates(in 2 column matrix) 0 index is X pos, 1 index is Y pos (seems reversed for some reason)
+
+
+		
+				DistanceMatrix = new int[DataSetY.length][DataSetX.length]; //row then columns (incrementing the X values chances the column)
+				//Columns of DisMatrixFillingHorizontally = DisMatrixCreater
+
+				DisMatrixFillingHorizontally(DataSetY,DataSetX);
+				//DisMatrixFillingHorizontally(ArrayY,ArrayX);//horizontally filling the Matrix, while counting zeros per traversal
+			//	PrintMatrix(DistanceMatrix); //just a basic print function
+			//	PrintMatrix(LZScoordinates);
+				System.out.println("RESULT SECTION:");
+				System.out.println("1. Array index of most zeros: " + getIndexOfLargest(ZeroCounter)); //index of most exact overlap(ala most matching values/zeros)
+				System.out.println("2. Array index of longest string of zeros: " + getIndexOfLargest(LongestZeroString));
+				System.out.println("3. Starting coordinates of the traversal(on the grid edge) with the longest continuous string of zeros: (x,y)_" + GridEdgeCoordinates(LongestZeroString, DistanceMatrix)); //index of most exact overlap(ala most matching values/zeros)
+				System.out.println("4. Starting coordinates of the traversal(on the grid edge) with the most total zeros: (x,y)_" + GridEdgeCoordinates(ZeroCounter, DistanceMatrix));//converts the index of greatest traversal to the starting index(on the edge of the grid) of said traversal
+				//DisMatrixCreater(ArrayY,ArrayX);//standard double for loop to create the proper distance matrix- to check agaisnt by horizontal creation
+				PrintMatrix(DistanceMatrix);
+				System.out.println("5. Exact X & Y grid coordinates of longest String of Zeros (x,y)_"+ "(" + LZScoordinates[getIndexOfLargest(LongestZeroString)][0] + "," + LZScoordinates[getIndexOfLargest(LongestZeroString)][1] + ")");
+				System.out.println("6. Percentage Match relative to perfect match_(most total zeros)_" + PercentMatch(ZeroCounter,DistanceMatrix) + "%");
+				System.out.println("7. Percentage Match relative to perfect match_(longest continous string of zeros)_"  + PercentMatch(LongestZeroString,DistanceMatrix) + "%");
+
+	}
+
+//public static void ReadGoogleSlides()
+
+	public static void DisMatrixFillingHorizontally(int[]DY, int[]DX)
+	{//arguemnts are the arrays of data points
+		//Xpos = columns Ypos= rows
+		int TotalTraversals = DY.length+DX.length-1;  //# of horizontal iterations needed to go through every potential unit of the grid. Its the number of edge points we use
+										//13 is the answer for a 7 by 7 grid. 
+										//its equal to the number of edge values or length + width - 1	
+		int TraversalsStartingonYAxis = TotalTraversals-DX.length;
+		int TraversalsStartingonXAxis = TotalTraversals-DY.length;
+		int XstartPos = 0;
+		int YstartPos = 0;
+		int traversalsFromMiddle = 0;
+		int ZeroCounter = 0; //index of ZeroCounter array- it is the same as the traversalFromMiddle untill TFM is reset after half the grid is filled
+		//with evenly sized arrays the X value will always be Odd so we have to account for java rounding down by adding 1
+			
+		for(int i=0; i<(TraversalsStartingonXAxis+1); i++)//goes through as many times are you need to traverse the middle traversal to the bottom left corner.
+			{
+				traversalsFromMiddle = MatrixHelper(DY, DX, XstartPos, YstartPos, traversalsFromMiddle, ZeroCounter)+1; //if the Helper returns the traversal count we can use its value even if the method is creating seperate variables
+				ZeroCounter++;
+				XstartPos = traversalsFromMiddle;
+			}
+
+			traversalsFromMiddle=1;
+			XstartPos = 0;//give new starting edge index values
+			YstartPos = 1;
+			
+		for(int p=0; p<TraversalsStartingonYAxis; p++) //traversals from 1 above the middle to top right corner.
+			{
+				traversalsFromMiddle = MatrixHelper(DY, DX, XstartPos, YstartPos, traversalsFromMiddle, ZeroCounter)+1; 
+				ZeroCounter++;
+				YstartPos = traversalsFromMiddle;
+			}
+	}
+
+
+			/*to know when to make the recursive call A know how many grid positions must be filled before hand and count or B know the final position index you will land at
+
+			if the length/width of the DisMX grid are equal(THE GRID IS A SQUARE) the length of the longest horizontal(corner to corner) requires sidelength amount of sqaure traversals.
+			The longest traversal of a grid with sidelength of X is X operations. Starting at position (0,0)
+			starting position (0,y) or (y,0) (where sidelength>y>0) takes Sidelength-Y operations to reach its final grid position
+
+			ex with #s: a  7 by 7 grid's longest traversal is 7 operations long(Starting at position 0,0)
+			(0,1)=6op (0,2) = 5...(0,6) = 1 same with (1,0)=6op, (2,0)=5op....(6,0)=1op
+			longest traversal(starting at 0,0) is maximum the length of the shorter side 
+			
+
+
+			for a sqaure the longest traversal ends at (sidelength, sidelength) (the perfect diagonal)
+			starting position (y,0) ends at position (sidelength-1, sidelength-y-1) //moving towards bottom right corner of grid
+			starting position (0,x) ends at position (sidelength-x-1, sidelength-1) //moving towards top right corner of grid
+			//we do -1 because the side length starts at 1 but the indexing of the grid starts at 0. so we have to adjust
+			*/
+
+
+
+	public static int MatrixHelper(int[]DY, int[]DX, int Xpos, int Ypos, int traversals, int ZerocIndex)
+	{//the matrix helper function does one complete diagonal traversal of the grid
+		//It compares values from DY/DX arrays
+		//int XstartPos, int YstartPos are starting positions for the traversal
+		//traversals is a arguement that keeps the matrix aware of how far it is from the center diagonal
+		//ZeroxIndex is the index of the zero counter static array(for data collection) It matches the traversals counter until traversals is reset before the 2nd for loop in DisMatrixFillingHorizontally
+
+		int SidelengthX = DX.length; //.length is the actually amount of positions allocated in memory so index 0-9 is length 10
+		int SidelengthY = DY.length;
+		boolean test = true;
+		int ActiveZeroCounter = 0;
+
+		while(test==true)
+				{
+				int DistanceValue = (DX[Xpos]-DY[Ypos])*(DX[Xpos]-DY[Ypos]); //the difference between the values squared
+				DistanceMatrix[Ypos][Xpos] = DistanceValue;//put value into Matrix
+
+				if(DistanceValue == 0)//found match (maybe pick a larger range ala 2-6 to allow for puedomatch)
+					{
+				       	ZeroCounter[ZerocIndex] = ZeroCounter[ZerocIndex]+1;//increment index of total zeros in diagonal traversal
+				 		ActiveZeroCounter = ActiveZeroCounter+1;
+					}
+					//
+				else //found non zero value
+					{
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//if the String of zeros currently found is greater than what we have previously found for this traversal
+						{
+							LongestZeroString[ZerocIndex] = ActiveZeroCounter;//change the value of longest Active Zero counter to the active zero counter
+							LZScoordinates[ZerocIndex][0] = (Xpos - ActiveZeroCounter); 
+							LZScoordinates[ZerocIndex][1] = (Ypos - ActiveZeroCounter); 
+
+						}
+						ActiveZeroCounter = 0; //reset the active counter to zero 
+					}
+
+				//leave loop if the array indexs being called match the final position the call reaches
+				if(Xpos >= (SidelengthX-1) || Ypos >= (SidelengthY-1))//-1 is because array index starts at zero but side length doesn't.
+					{
+						if(ActiveZeroCounter > LongestZeroString[ZerocIndex])//Need to check in senario when the traversal ends in a match/zero
+							{
+								LongestZeroString[ZerocIndex] = ActiveZeroCounter;
+								System.out.println(ActiveZeroCounter);
+								if(ActiveZeroCounter>0)
+								LZScoordinates[ZerocIndex][0] = ((Xpos+1) - ActiveZeroCounter);
+								LZScoordinates[ZerocIndex][1] = ((Ypos+1) - ActiveZeroCounter); 
+						 //the +1 is needed because the ActiveZeroCounter could potentially give you a negative 'coordinate', 
+						 //If the zero string makes it all the way to the bottom, the (X/Ypos-activeZeroCounter) < 0. Not possible
+						//It isn't needed for the strings that don't end on the final position on the traversal because the +1s are happening within the while loop. 
+							//IE. These coordinates are being calculated during the same loop as the final zero is found, but in the case above the coordinates are being calculated in the loop after the final zero is found.
+							}
+
+						test = false;
+					}
+
+				Xpos = Xpos+1;
+				Ypos = Ypos+1;
+				}
+
+		return traversals;		//so we can keep track of the position of the traversal
+		//we need to know which travesal we have just done. To know where to start the next one
+	}
+
+
+	public static String GridEdgeCoordinates(int[] array, int[][]Matrix) //Gets starting coordinates of traversal based on largest value in array
+	{
+		int LargestValueIndex = getIndexOfLargest(array);
+		String coordinates;
+
+
+		if(LargestValueIndex>=(Matrix[1].length))
+			{
+				coordinates = new String("(" + 0 + "," + ((LargestValueIndex-(Matrix[1].length)+1) +") "+ "value: " + array[LargestValueIndex]));
+				//if the starting value was in the top half of the grid
+				//this is because the grid is made middle to bottom left corner then back to the middle line to top right corner
+			}
+		else
+			{
+				coordinates = new String("(" + LargestValueIndex + "," + 0 + ") " + "value: " + array[LargestValueIndex]);
+			} 
+
+		return coordinates;
+	}
+
+	public static double PercentMatch(int[]Array, int[][]Matrix)
+	{ 	//takes in one array, and a matrix. Finds the percent match between largest value in array and shorter sidelength of the matrix.
+		//We are determining how many matchs occured(or consequetively or not), in the best case, vs how many could have
+		int IndexOfLargest = getIndexOfLargest(Array);
+		double ValueTotal;
+
+		//no given traversal is longer than the shorter side of the Matrix-thus the longest traversal is = the shorter sidelength
+		if(Matrix.length > Matrix[1].length)
+			{
+				ValueTotal = Matrix[1].length;
+			}
+		else
+			{
+				ValueTotal = Matrix.length;
+			}
+
+		double ValueMatchs = (double) Array[IndexOfLargest];
+		double PercentMatch = (ValueMatchs/ValueTotal)*100;
+		return PercentMatch;
+	}
+	
+}
+
+
diff --git a/dedupe/mass/FindNN.cpp b/dedupe/mass/FindNN.cpp
new file mode 100644
index 00000000..d2bd5992
--- /dev/null
+++ b/dedupe/mass/FindNN.cpp
@@ -0,0 +1,205 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <fftw3.h>
+#include <math.h>
+
+
+
+double * multiply(double * x, int n , double * y , int m , double * z);
+double * zNorm(double * x, int n, double * y);
+double * findNN(double * x, double * y, int n, int m, double * dist);
+
+
+
+int main(int argc, char* argv[])
+{
+	//Assume n > m
+
+	int n = atol(argv[3]); 
+	int m = atol(argv[4]);
+	double *x, *y, *dist;
+
+	//Memory Allocation
+	
+	FILE * fp ; errno_t err = fopen_s(&fp,argv[1],"r");
+	  if( err )
+      printf_s( "The file fscanf.out was not opened\n" );
+	FILE * fp1 ; err = fopen_s(&fp1,argv[2],"r");
+		   if( err )
+      printf_s( "The file fscanf.out was not opened\n");
+
+	x = (double *)malloc(sizeof(double) * n);
+	y = (double *)malloc(sizeof(double) * m);
+	dist = (double *)malloc(sizeof(double) * n);
+
+	//Data Input
+	for ( int i = 0 ; i < n ; i ++ )
+	{
+		double d;
+		fscanf_s(fp,"%lf",&d);
+		x[i] = d;
+		if( i < m )
+		{
+			fscanf_s(fp1,"%lf",&d);
+			y[i] = d;
+		}
+	}
+
+	dist = findNN(x,y,n,m,dist);
+	
+	double minm = 99999999999999.000222;
+	int mini = 0;
+	for ( int i = 0 ; i < n-m+1	 ; i++ )
+		if( dist[i] < minm )
+		{	minm = dist[i]; mini = i; }
+	
+	printf("Nearest Neighbor Distance is %lf\nNearest Neighbor location is %d (starting at 1)\n",minm, mini);
+	fclose(fp); fclose(fp1);
+    
+
+
+
+	free(x); free(y); free(dist);
+
+	system("PAUSE");
+}
+
+
+double * findNN(double * x, double * y, int n, int m, double * dist)
+{
+	
+	//Assume n > m
+	double *z ;
+	double *cx, *cx2, *cy, *cy2;
+
+	//Allocation
+	cx = (double *)malloc(sizeof(double) * (n+1));
+	cx2 = (double *)malloc(sizeof(double) * (n+1));
+	cy = (double *)malloc(sizeof(double) * (m+1));
+	cy2 = (double *)malloc(sizeof(double) * (m+1));
+
+	//Normalize
+	x = zNorm(x,n,x);
+	y = zNorm(y,m,y);
+
+	//Compute the cumulative sums
+	cx[0] = cx2[0] = cy[0] = cy2[0] = 0.0;
+	for( int i = 1 ; i <= n; i++ )
+	{
+		cx[i] = cx[i-1]+x[i-1];
+		cx2[i] = cx2[i-1]+x[i-1]*x[i-1];
+		if( i <= m )
+		{
+			cy[i] = cy[i-1]+y[i-1];
+			cy2[i] = cy2[i-1]+y[i-1]*y[i-1];
+
+		}
+
+	}
+
+	//Compute the multiplication numbers
+	z = (double *)malloc(sizeof(double)*2*n);
+	z = multiply(x,n,y,m,z);
+	
+	//y Stats
+				
+	double sumy = cy[m];
+	double sumy2 = cy2[m];
+	double meany = sumy/m;
+	double sigmay = (sumy2/m)-meany*meany;
+	sigmay = sqrt(sigmay);
+			
+
+	//The Search
+	for( int j = 0 ; j < n-m+1 ; j=j+1 )
+	{
+				double sumxy = z[m-1+j];
+
+				double sumx = cx[j+m]-cx[j];
+				double sumx2 = cx2[j+m]-cx2[j];
+				double meanx = sumx/m;
+				double sigmax = (sumx2/m)-meanx*meanx;
+				sigmax = sqrt(sigmax);
+
+				double c = ( sumxy - m*meanx*meany ) / ( m*sigmax*sigmay );
+				dist[j] = sqrt(2*m*(1-c));
+				
+	}
+	
+    free(cx); free(cx2); free(cy); free(cy2);
+	free(z);
+	return dist;
+}
+
+
+double * zNorm(double * x, int n, double * y)
+{
+	double ex = 0, ex2 = 0;
+	for(int i = 0 ; i < n ; i++ )
+	{
+		ex += x[i];
+		ex2 += x[i]*x[i];
+	}
+	double	mean = ex/n;
+    double std = ex2/n;
+    std = sqrt(std-mean*mean);
+	for(int i = 0 ; i < n ; i++ )
+		y[i] = (x[i]-mean)/std;
+	return y;
+}
+
+double * multiply(double * x, int n , double * y , int m , double * z)
+{
+	fftw_complex * X, * Y, * Z , *XX, *YY, *ZZ;
+    fftw_plan p;
+    
+	//assuming n > m
+	X = (fftw_complex*) fftw_malloc(sizeof(fftw_complex) * 2 * n);
+	Y = (fftw_complex*) fftw_malloc(sizeof(fftw_complex) * 2 * n);
+	XX = (fftw_complex*) fftw_malloc(sizeof(fftw_complex) * 2 * n);
+	YY = (fftw_complex*) fftw_malloc(sizeof(fftw_complex) * 2 * n);
+	Z = (fftw_complex*) fftw_malloc(sizeof(fftw_complex) * 2 * n);
+	ZZ = (fftw_complex*) fftw_malloc(sizeof(fftw_complex) * 2 * n);
+
+
+	for(int i = 0 ; i < 2*n ; i++ )
+	{
+		X[i][1] = 0; Y[i][1] = 0; //iaginary part is always zero
+		if(i < n )
+			X[i][0] = x[i];
+		else
+			X[i][0] = 0;
+
+		if(i < m )
+			Y[i][0] = y[m-i-1]; //reversing y
+		else
+			Y[i][0] = 0;
+	}
+
+
+    p = fftw_plan_dft_1d(2 * n, X, XX, FFTW_FORWARD, FFTW_ESTIMATE);
+    fftw_execute(p); 
+    
+    p = fftw_plan_dft_1d(2 * n, Y, YY, FFTW_FORWARD, FFTW_ESTIMATE);
+    fftw_execute(p); 
+
+	for(int i = 0 ; i < 2*n; i++)
+	{
+		ZZ[i][0] = XX[i][0]*YY[i][0] - XX[i][1]*YY[i][1]; 
+		ZZ[i][1] = XX[i][1]*YY[i][0] + XX[i][0]*YY[i][1];
+	}
+	
+	p = fftw_plan_dft_1d(2 * n, ZZ , Z , FFTW_BACKWARD, FFTW_ESTIMATE);
+    fftw_execute(p); 
+
+
+	for(int i = 0; i < 2*n; i++ )
+		z[i] = Z[i][0]/(2*n);
+	
+	fftw_destroy_plan(p);
+    fftw_free(X); fftw_free(Y);
+	fftw_free(XX); fftw_free(YY);
+	fftw_free(Z); fftw_free(ZZ);
+	
+	return z;
+}
\ No newline at end of file
diff --git a/dedupe/mass/Mass.py b/dedupe/mass/Mass.py
new file mode 100644
index 00000000..cda715a9
--- /dev/null
+++ b/dedupe/mass/Mass.py
@@ -0,0 +1,49 @@
+import numpy as np
+from scipy import stats
+import pandas as pd
+import math
+
+def movstd(a,window):
+    left= window[0]
+    right = window[1]
+    result = []
+    for i in range(len(a)):
+        r=0
+        if i >= left and i +right<len(a):
+            r=np.std(a[i - left:i + right+1],ddof=1)
+        elif i < left:
+            r= np.std(a[:i + right+1],ddof=1)
+        elif i + right >= len(a):
+            r= np.std(a[i - left:],ddof=1)
+        else:
+            r=np.std(a[:],ddof=1)
+        result.append(0 if math.isnan(r)  else r)
+    return result
+
+
+def findInT(query,target):
+    m = len(query);
+    n = len(target);
+    Q = stats.zscore(query,ddof=1)#zNorm ???
+    stdv = movstd(target,(0,m-1))
+    Q= np.append(Q[::-1],np.zeros(n-m))
+    dots =np.convolve(target,Q)
+    dist =2 * (m - (dots[m-1:n])/ stdv[0:n - m +1])
+    return np.sqrt(dist)
+
+qry = np.array([1, 10, 5]);
+tgt = [4,8,6,-1,-2,-3,-1,3,4,5];
+output=findInT(qry,tgt)
+print output
+#disp(Stdv) 2.0000    2.0000    1.0000   18.7705   21.0000    4.2426         0
+#Q = Q(end:-1:1); % Reverse
+#the query
+#disp(Q);
+#Q(m + 1:n) = 0; % pad
+#zeros
+#disp(Q);
+#dots = conv(T, Q);
+#disp(X(m:n))
+#dist = 2 * (m - (dots(m:n))./ Stdv(1:n - m + 1));
+#dist = sqrt(dist);
+