code: def RGS_enum(m):
      """
      RGS_enum computes the total number of restricted growth strings
      possible for a superset of size m.
  
      Examples
      ========
  
      >>> from sympy.combinatorics.partitions import RGS_enum
      >>> from sympy.combinatorics import Partition
      >>> RGS_enum(4)
      15
      >>> RGS_enum(5)
      52
      >>> RGS_enum(6)
      203
  
      We can check that the enumeration is correct by actually generating
      the partitions. Here, the 15 partitions of 4 items are generated:
  
      >>> a = Partition(list(range(4)))
      >>> s = set()
      >>> for i in range(20):
      ...     s.add(a)
      ...     a += 1
      ...
      >>> assert len(s) == 15
  
      """
      if m < 1:
          return 0
      elif m == 1:
          return 1
      else:
          return bell(m)
  
imports: from sympy.core import Basic, Dict, sympify, Tuple
  from sympy.core.numbers import Integer
  from sympy.core.sorting import default_sort_key
  from sympy.core.sympify import _sympify
  from sympy.functions.combinatorial.numbers import bell
  from sympy.matrices import zeros
  from sympy.sets.sets import FiniteSet, Union
  from sympy.utilities.iterables import flatten, group
  from sympy.utilities.misc import as_int
  from collections import defaultdict
label_desc: Use image node_id 3 for calling a global function with example usage: RGS_enum(m) and returns: int, int, bell