good old days

program o247;
{$APPTYPE CONSOLE}
var n,m,i,s:integer;
b:array[1..1000] of integer;
a:array[1..1000] of integer;
procedure QSort(left, right : integer);
var m, i, j, t : integer;
begin
  m := a[(left+right) div 2];
  i := left; j := right;
  repeat
    while a[i] > m do inc(i); {ïåðâûé while}
    while a[j] < m do dec(j); {âòîðîé while}
    if i <= j then
    begin
      t := a[i]; a[i] := a[j]; a[j] := t;
      t:=b[i];b[i]:=b[j];b[j]:=t;
      inc(i); dec(j);
    end;
  until i > j;
  if j > left then QSort(left, j);
  if i < right then QSort(i, right);
end;
function delit(k:integer):integer;
var d,i,j:integer;
begin
d:=2;
for i := 2 to (k div 2)+1 do if k mod i=0 then inc(d);
delit:=d;
end;
begin
reset(input,'input.txt');
rewrite(output,'output.txt');
readln(n,m);
a[1]:=1;
a[2]:=2;
for i:= 1 to n do b[i]:=i;
for i:=3 to n do a[i]:=delit(i);
Qsort(1,n);
s:=0;
i:=1;
while i<=m do
begin
  if a[i+1]<>a[i] then
  begin
  if a[i-1]=a[i] then  inc(s,b[i-1]) else inc(s,b[i]);
  inc(i);
  end
  else
  begin
    while a[i+1]=a[i] do
    begin
      inc(i);
      inc(m);
    end;
  end;
end;
write(s);
close(output);
end.