Определить, можно ли привести весы в состояние равновесия

var
  p:array[1..10] of integer;
  i1,i2,i3,i4,i5,i6,i7,i8,i9,i10,j1,j2,j3,j4,j5,j6,j7,j8,j9,j10,k,n:integer;
begin
  readln(k);
  readln(n);
  for n:=1 to n do  read(p[n]);
  for i1:=0 to 1 do
  for i2:=0 to 1 do
  for i3:=0 to 1 do
  for i4:=0 to 1 do
  for i5:=0 to 1 do
  for i6:=0 to 1 do
  for i7:=0 to 1 do
  for i8:=0 to 1 do
  for i9:=0 to 1 do
  for i10:=0 to 1 do
  for j1:=0 to 1 do
  for j2:=0 to 1 do
  for j3:=0 to 1 do
  for j4:=0 to 1 do
  for j5:=0 to 1 do
  for j6:=0 to 1 do
  for j7:=0 to 1 do
  for j8:=0 to 1 do
  for j9:=0 to 1 do
  for j10:=0 to 1 do
   if k+i1*p[1]+i2*p[2]+i3*p[3]+i4*p[4]+i5*p[5]+i6*p[6]+i7*p[7]+i8*p[8]+i9*p[9]+i10*p[10]=
      j1*p[1]+j2*p[2]+j3*p[3]+j4*p[4]+i5*p[5]+j6*p[6]+j7*p[7]+j8*p[8]+j9*p[9]+j10*p[10]
   then begin
      if i1*p[1]>0 then write(p[1],' ');
      if i2*p[2]>0 then write(p[2],' ');
      if i3*p[3]>0 then write(p[3],' ');
      if i4*p[4]>0 then write(p[4],' ');
      if i5*p[5]>0 then write(p[5],' ');
      if i6*p[6]>0 then write(p[6],' ');
      if i7*p[7]>0 then write(p[7],' ');
      if i8*p[8]>0 then write(p[8],' ');
      if i9*p[9]>0 then write(p[9],' ');
      if i10*p[10]>0 then write(p[10],' ');
      if i1*p[1]+i2*p[2]+i3*p[3]+i4*p[4]+i5*p[5]+i6*p[6]+i7*p[7]+i8*p[8]+i9*p[9]+i10*p[10]=0 then write('0');
      writeln;
      if j1*p[1]>0 then write(p[1],' ');
      if j2*p[2]>0 then write(p[2],' ');
      if j3*p[3]>0 then write(p[3],' ');
      if j4*p[4]>0 then write(p[4],' ');
      if j5*p[5]>0 then write(p[5],' ');
      if j6*p[6]>0 then write(p[6],' ');
      if j7*p[7]>0 then write(p[7],' ');
      if j8*p[8]>0 then write(p[8],' ');
      if j9*p[9]>0 then write(p[9],' ');
      if j10*p[10]>0 then write(p[10],' ');
      if j1*p[1]+j2*p[2]+j3*p[3]+j4*p[4]+i5*p[5]+j6*p[6]+j7*p[7]+j8*p[8]+j9*p[9]+j10*p[10]=0 then write('0');
      exit;
   end;
   writeln('-1');
 end.

const maxweight = 50;
      maxquantity = 10;
 
var i, j, k, n, sum, carry: integer;
    weights: array [1..maxquantity] of integer;
    scales: array [1..maxquantity] of integer;
    overflow, correct: boolean;
 
procedure prnscales(bowl: integer);
var notfound: boolean;
    i: integer;
begin
  notfound := true;
  for i := 1 to n do
    if scales[i] = bowl
      then begin
        write(weights[i]:3);
        notfound := false
      end;
  if notfound then write(0:3);
  writeln
end;
 
begin
  repeat
    write('K in [1..', maxweight, '];  K = ');
    readln(k)
  until k in [1..maxweight];
  repeat
    write('N in [1..', maxquantity, '];  N = ');
    readln(n)
  until n in [1..maxquantity];
  writeln('Enter the weight of weights (in [1..', maxweight, ']):');
  for i := 1 to n do
    repeat
      write('Weight ', i, ': ');
      readln(weights[i]);
      for j := 1 to i - 1 do
        if weights[i] = weights[j]
          then begin
            writeln('Such weight already is in a set, reenter');
            weights[i] := 0
          end;
    until weights[i] in [1..maxweight];
  for i := 1 to n do scales[i] := 1;
  repeat
    inc(scales[1]);
    carry := 0;
    for i := 1 to n do
      begin
        scales[i] := scales[i] + carry;
        if scales[i] > 1
          then begin
            carry := 1;
            scales[i] := -1
          end
          else break
      end;
    sum := 0;
    for i := 1 to n do sum := sum + scales[i] * weights[i];
    correct := sum = k;
    overflow := true;
    for i := 1 to n do overflow := overflow and (scales[i] = 1)
  until correct or overflow;
  if correct
    then begin
      prnscales(-1);
      prnscales(1)
    end
    else write(-1:3);
  readln
end.