Найти все вхождения строки T в строке S

{$mode Delphi}
{$h+}
program ListPos;
 
uses
  StrUtils;
 
var
  CurrPosition: integer;
  s, t:  string;
  Count: integer;
begin
  readln(s);
  readln(t);
  CurrPosition := 1;
  Count := 0;
  repeat
    CurrPosition := PosEx(T, S, CurrPosition);
    if CurrPosition <> 0 then
    begin
      Inc(Count);
      Write(' ', CurrPosition - 1);
      Inc(CurrPosition);
    end;
  until CurrPosition = 0;
  if Count = 0 then
    Write('NO');
end.

var
  s,t:array[1..50000] of char;
  fin,fout:text;
  i,k,ls,lt:longint;
  f:array of longint;
  ok:boolean;
begin
  assign(fin,'input.txt');
  reset(fin);
  assign(fout,'output.txt');
  rewrite(fout);
  ls:=0;
  ok:=false;
  while not eoln(fin) do begin
      inc(ls);
    read(fin,s[ls]);
  end;
  readln(fin);
  lt:=0;
  while not eoln(fin) do begin
      inc(lt);
    read(fin,t[lt]);
  end;
  setlength(f,lt+1);
  f[1]:=0;
  for i := 2 to lt do
  begin
    while (k > 0) and (t[k+1] <> t[i]) do
      k := f[k];
    if t[k+1] = t[i] then Inc(k);
    f[i] := k;
  end;
  k := 0;
  for i := 1 to ls do
   begin
    while (k > 0) and (t[k+1] <> s[i]) do
      k := f[k];
    if t[k+1] = s[i] Then Inc(k);
    if k =lt Then  begin
      write(fout,i-lt,' ');
      ok:=true;
      k:=1;
    end;
  end;
  if not ok then writeln(fout,'NO');
  close(fin);
  close(fout);
end.

{$mode Delphi}
program TestLongString;
 
var
  f: Text;
  i: integer;
  s: string;
begin
  Assign(f, 'Test.txt');
  rewrite(f);
  for i := 1 to 50000 do
    Write(f, 'a');
  writeln(f);
  Close(f);
 
  Assign(f, 'Test.txt');
  reset(f);
  readln(f, s);
  Close(f);
 
  writeln('Len=', length(s));
end.

{$mode objfpc}
{$h+}
uses strutils;
 
var
  s, subs : string;
  p : pchar;
  start : integer;
 
begin
  s := 'ababbababa';
  subs := 'aba';
  repeat
    p := SearchBuf(PChar(s), Length(s), start, 0, subs);
    if p <> nil then
    begin
      start := p - pchar(s) + 1;
      writeln(pred(start));
    end;
  until p = nil;
end.