kmp模板，线性完成pos

var
 p:array[..] of longint;
 i,j:longint;
 a,b:ansistring;

  begin

    readln(a);
    readln(b);

    P[]:=;
    j:=;
   for i:= to length(b) do
     begin
       while (j>) and (B[j+]<>B[i]) do j:=P[j];
       if B[j+]=B[i] then j:=j+;
       P[i]:=j;
     end;

     j:=;
    for i:= to length(a) do
        begin
          while (j>) and (B[j+]<>A[i]) do j:=P[j];
          if B[j+]=A[i] then j:=j+;
          if j=length(b) then
          begin
            writeln(i-length(b)+);
            halt;
            j:=P[j];
         end;
        end;
     writeln();
   end.