anchor.diff:         (loop for c from 0 to (1- colNum) do
               (progn ;(print (change-index-to-string r c))
                 (setf (gethash (change-index-to-string r c) indexHash)
  -                (how-many-larger (do-around 'find-ele *matrix* r c))))))
  +                    (how-many-larger (do-around 'find-ele matrix r c)))
  +              ;(print (gethash (change-index-to-string r c) indexHash))
  +              )))
       indexHash))
   
   (defun sum-list (list)
  
positive.code:     (dolist (i list summation)
        (setf summation (+ i summation)))))
  
  (defun longest-list (&rest llist)
    (let ((length-list '()))
      (loop for i in llist do
           (setf length-list (append length-list (length i))))
      (max 
  
           
    
  
  (defun tree-search-matrix (indexTable r c)
    (let ((this-hash (gethash (change-index-to-string r c) indexTable))
          (result))
    (cond ((= 0 (car this-hash))
           (return '(1) ))
          ((= 1 (car this-hash))
           (return (setf result
                         (append '(1) (tree-search-matrix indexTable
                                                          (nth 1 (nth 1 (this-hash)))
                                                          (nth 2 (nth 1 (this-hash))))))))
          ((= 2 (car this-hash))
           (return (setf result (longest-list 
                         (append '(1) (tree-search-matrix indexTable
                                                          (nth 1 (nth 1 (this-hash)))
                                                          (nth 2 (nth 1 (this-hash)))))
                         (append '(1) (tree-search-matrix indexTable
                                                          (nth 1 (nth 2 (this-hash)))
                                                          (nth 2 (nth 2 (this-hash)))))))))
          ((= 2 (car this-hash))
           (return (setf result (longest-list 
                         (append '(1) (tree-search-matrix indexTable
                                                          (nth 1 (nth 1 (this-hash)))
                                                          (nth 2 (nth 1 (this-hash)))))
                         (append '(1) (tree-search-matrix indexTable
                                                          (nth 1 (nth 2 (this-hash)))
                                                          (nth 2 (nth 2 (this-hash)))))))
          
  #|
  (defun main (matrix)
    (let ((resultList '())
          (indexTable (gen-index-table matrix))
  
negative.code:         (largerIndex '()))
      (dolist (i lastList (list largerNum largerIndex))
        (if (> (car i) thisNum)
            (progn ;(print i)
              (incf largerNum)
                  (setf largerIndex (append largerIndex (list (cadr i))))
            )))))
  
  