anchor.diff:  
         call read_sukp_instance(fname, n, c, w, p)
         jdim = n + 1
  -
  -      ! Code for printing the instance. CAUTION: knapsack_reorder
  -      ! changes the input of the algorithm.
  -c      write ( *, '(a)' ) ' '
  -c      write ( *, '(a)' ) '  MTU2 solves the UKP.'
  -c      write ( *, '(a)' ) ' '
  -c      write ( *, '(a,i6)' ) '  Knapsack capacity is ', c
  -
  -c      call knapsack_reorder ( n, p, w )
  -
  -c      write ( *, '(a)' ) ' '
  -c      write ( *, '(a)' ) '  Object  Profit    Mass'
  -c      write ( *, '(a)' ) ' '
  -c      do i = 1, n
  -c        write ( *, '(2x,i6,2x,i6,2x,i6)' ) 
  -c     &  i, p(i), w(i)
  -c      end do
   
         jfo = 1 ! We want an exact solution.
         jck = 1 ! We don't want input checking (to not mess the times).
  
positive.code: c
  c  Modified:
  c
  c    TODO
  c
  c  Author:
  c
  
negative.code: 
        return
        end
        end program
  
        SUBROUTINE MTU2(N,P,W,C,Z,X,JDIM,JFO,JCK,JUB,PO,WO,XO,RR,PP)
  C
  