

'''simple docstring'''




from dataclasses import dataclass, field
from typing import ClassVar, Dict

from ..features import Features, Sequence, Value
from .base import TaskTemplate



@dataclass(frozen=UpperCAmelCase_			)
class 							lowercase_						(		UpperCAmelCase_			):

  '''simple docstring'''





  __lowerCAmelCase       :			str     	= field(default="question-answering-extractive"			,							metadata={"include_in_asdict_even_if_is_default": True}			)
  __lowerCAmelCase       :			ClassVar[Features]     	= Features({"question": Value("string"			), "context": Value("string"			)}			)
  __lowerCAmelCase       :			ClassVar[Features]     	= Features(
      {
          "answers": Sequence(
              {
                  "text": Value("string"			),
                  "answer_start": Value("int32"			),
              }			)
      }			)
  __lowerCAmelCase       :			str     	= "question"
  __lowerCAmelCase       :			str     	= "context"
  __lowerCAmelCase       :			str     	= "answers"
  @property
  def     snake_case_      (  self  )				->					Any:


    """simple docstring"""
    return {self.question_column: "question", self.context_column: "context", self.answers_column: "answers"}




lowerCamelCase__     :		dict[tuple[int, int, int], int]        = {}

def 		UpperCamelCase						(   lowercase_			,			lowercase_			,			lowercase_ )		->						int:


  '''simple docstring'''






  if late == 3 or absent == 2:
    return 0

  # if we have no days left, and have not failed any other rules,
  # we have a prize string
  if days == 0:
    return 1

  # No easy solution, so now we need to do the recursive calculation

  # First, check if the combination is already in the cache, and
  # if yes, return the stored value from there since we already
  # know the number of possible prize strings from this point on
  lowercase__	: Tuple     		=   (days, absent, late)
  if key in cache:
    return cache[key]

  # now we calculate the three possible ways that can unfold from
  # this point on, depending on our attendance today

  # 1) if we are late (but not absent), the "absent" counter stays as
  # it is, but the "late" counter increases by one
  lowercase__	: Union[str, Any]     		=   _calculate(days - 1			,			lowercase_			,			late + 1 )

  # 2) if we are absent, the "absent" counter increases by 1, and the
  # "late" counter resets to 0
  lowercase__	: List[str]     		=   _calculate(days - 1			,			absent + 1			,			0 )

  # 3) if we are on time, this resets the "late" counter and keeps the
  # absent counter
  lowercase__	: Dict     		=   _calculate(days - 1			,			lowercase_			,			0 )

  lowercase__	: List[str]     		=   state_late + state_absent + state_ontime

  lowercase__	: List[Any]     		=   prizestrings
  return prizestrings

def 		UpperCamelCase						(   lowercase_ = 30 )		->						int:


  '''simple docstring'''






  return _calculate(lowercase_			,			absent=0			,			late=0 )


if __name__ == "__main__":
     print(solution())






