program slegpbte;

uses
  iom,
  sle,
  typ;

const
  c = 0;
  d = 100;
  e = 0;
  f = 10;

var
  l, i, p, q, n, term, ind, rw, vb, nvb: ArbInt;
  ca:   ArbFloat;
  a:    array[c..d] of ArbFloat;
  b, x: array[e..f] of ArbFloat;
begin
  Write(' program results slegpbte');
  case sizeof(ArbFloat) of
    4: writeln('(single)');
    6: writeln('(real)');
    8: writeln('(double)');
  end;
  Read(randseed);
  writeln;
  writeln('   randseed =', randseed: 6);
  writeln;
  Read(nvb);
  writeln(' number of examples:', nvb: 3);
  writeln;
  for vb := 1 to nvb do
  begin
    writeln('example', vb: 2);
    Read(p, q, n, l);
    ind := p;
    writeln;
    writeln('   n=', n: 1, '   l=', l: 1);
    for i := 1 to n do
    begin
      if i <= l + 1 then
        rw := i
      else
        rw := l + 1;
      iomrev(input, a[ind], rw);
      ind := ind + rw;
    end;
    iomrev(input, b[q], n);
    slegpb(n, l, a[p], b[q], x[q], ca, term);
    ind := p;
    writeln;
    writeln(' left-under part of A =  ');
    writeln;
    for i := 1 to n do
    begin
      if i <= l + 1 then
        rw := i
      else
      begin
        rw := l + 1;
        Write('': (i - l - 1) * (numdig + 2));
      end;
      iomwrv(output, a[ind], rw, numdig);
      ind := ind + rw;
    end;
    writeln;
    writeln('b=');
    iomwrv(output, b[q], n, numdig);
    writeln;
    writeln('term=', term: 2);
    case term of
      1:
      begin
        writeln;
        writeln('x=');
        iomwrv(output, x[q], n, numdig);
        writeln;
        writeln(' ca=', ca: 12);
      end;
      2: writeln('solution not possible');
      3: writeln(' wrong input (l<0 or l>n-1)')
    end;
    writeln('---------------------------------------------');
  end; {vb}
end.