






from collections import defaultdict
class 		SCREAMING_SNAKE_CASE__	:

  '''simple docstring'''







  def __init__(      self		:			List[Any]       ,				lowerCamelCase		:			Any       ,				lowerCamelCase		:			Tuple							)						->	Dict:


         """simple docstring"""
         _UpperCAmelCase							=    total  # total no of tasks (N)

         # DP table will have a dimension of (2^M)*N
         # initially all values are set to -1
         _UpperCAmelCase							=    [
             [-1 for i in range(total + 1							)] for j in range(2 ** len(lowerCamelCase							)							)
         ]

         _UpperCAmelCase							=    defaultdict(lowerCamelCase							)  # stores the list of persons for each task

         # final_mask is used to check if all persons are included by setting all bits
         # to 1
         _UpperCAmelCase							=    (1 << len(lowerCamelCase							)) - 1


  def  lowerCamelCase       (      self		:			Tuple       ,				lowerCamelCase		:			Any       ,				lowerCamelCase		:			Any							)						->	List[Any]:


         """simple docstring"""
         # if mask == self.finalmask all persons are distributed tasks, return 1
         if mask == self.final_mask:
                return 1

         # if not everyone gets the task and no more tasks are available, return 0
         if task_no > self.total_tasks:
                return 0

         # if case already considered
         if self.dp[mask][task_no] != -1:
                return self.dp[mask][task_no]

         # Number of ways when we don't this task in the arrangement
         _UpperCAmelCase							=    self.count_ways_until(lowerCamelCase       ,				task_no + 1							)

         # now assign the tasks one by one to all possible persons and recursively
         # assign for the remaining tasks.
         if task_no in self.task:
                for p in self.task[task_no]:
                       # if p is already given a task
                       if mask & (1 << p):
                              continue

                       # assign this task to p and change the mask value. And recursively
                       # assign tasks with the new mask value.
                       total_ways_util += self.count_ways_until(mask | (1 << p)       ,				task_no + 1							)

        # save the value.
         _UpperCAmelCase							=    total_ways_util

         return self.dp[mask][task_no]





  def  lowerCamelCase       (      self		:			List[Any]       ,				lowerCamelCase		:			Tuple							)						->	Optional[int]:


         """simple docstring"""
         # Store the list of persons for each task
         for i in range(len(lowerCamelCase							)							):
                for j in task_performed[i]:
                       self.task[j].append(lowerCamelCase							)

        # call the function to fill the DP table, final answer is stored in dp[0][1]
         return self.count_ways_until(0       ,				1							)


if __name__ == "__main__":
  __a:     Tuple   					=					5  # total no of tasks (the value of N)

  # the list of tasks that can be done by M persons.
  __a:     int   					=					[[1, 3, 4], [1, 2, 5], [3, 4]]
  print(
      AssignmentUsingBitmask(task_performed, total_tasks).count_no_of_ways(
          task_performed
      )
  )






"""simple docstring"""





from typing import TYPE_CHECKING

from ...utils import OptionalDependencyNotAvailable, _LazyModule, is_sentencepiece_available


__A											=						{}


try:
  if not is_sentencepiece_available():
    raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
  pass
else:
  __A											=						["""MLukeTokenizer"""]

if TYPE_CHECKING:
  try:
    if not is_sentencepiece_available():
      raise OptionalDependencyNotAvailable()
  except OptionalDependencyNotAvailable:
    pass
  else:
    from .tokenization_mluke import MLukeTokenizer


else:
  import sys

  __A											=						_LazyModule(__name__, globals()["""__file__"""], _import_structure, module_spec=__spec__)
