def RGS_enum(m):
 if (m < 1):
  return 0
 elif (m == 1):
  return 1
 else:
  return bell(m)

def RGS_enum ( m ) : if ( m < 1 ) : return 0 elif ( m == 1 ) : return 1 else : return bell ( m )
rgs_enum computes the total number of restricted growth strings possible for a superset of size m .