L = [10] 
 for k in range(5): 
     n = len(L) 
     for i in range(n): 
         L.append(L[0]+2) 
         L.append(L[0]+3) 
         L.append(L[0]*2) 
         L.remove(L[0]) 
 print(len(set(L))) 
 

##  
 var (m, n) := (1, 7); 
 var L := Lst(1); 
 loop n do 
 begin 
   loop L.Count do 
   begin 
     L.Add(L[0] + 1); 
     L.Add(L[0] + 5); 
     L.Add(L[0] * 3); 
     L.RemoveAt(0) 
   end 
 end;  
 L.Distinct.Count.Print 
 

 
 def f(x,l,t=[]): 
     if l==5: 
         return t+[x] 
     else: 
         return f(x+2,l+1,t)+f(x+3,l+1,t)+f(x*2,l+1,t) 
  
 a=f(10,0,[]) 
 print(len(set(a))) 
 

 var a: array of integer; 
 var i:=0; 
 function f(x, k:uint64):uint64; 
 begin 
     if x > 4 then F:=0; 
     if k = 4 then begin i+=1; a[ i]:=f(x,k); end 
         else F:=0; 
    if x < 4 then F:=f(x+1,k+1)+f(x+5,k+1)+f(x*3,k+1); 
  end;    
  begin 
 f(1,0); 
 print (f(1,0)); 
 for  var j:=1 to i do 
   print(a[j]) 
 end.

var l:=new List<integer>; 
 procedure f(a,n:integer); 
 begin 
   if n<7 then begin 
   f(a+1,n+1); 
   f(a+5,n+1); 
   f(a*3,n+1); 
 end 
 else if n=7 then l.Add(a); 
 end; 
 begin 
   f(1,0); 
   L.Distinct.Count.Print; 
 end.//393