The problem to be solved is:
 Max  sum{j=1,...,n} p(j)x(j)
 st   sum{j=1,...,n} r(i,j)x(j) <= b(i)       i=1,...,m
                     x(j)=0 or 1
  
 The format of this data file is:
 number of test problems (K)
 then for each test problem k (k=1,...,K) in turn:
    number of variables (n), number of constraints (m), optimal
    solution value (zero if unavailable)
    the coefficients p(j); j=1,...,n
    for each constraint i (i=1,...,m): the coefficients r(i,j); j=1,...,n
    the constraint right-hand sides b(i); i=1,...,m