






def   lowerCamelCase__			(     lowercase						,     lowercase				):

		"""simple docstring"""






		SCREAMING_SNAKE_CASE       :      List[str]							=    len(__lowerCAmelCase				)
		SCREAMING_SNAKE_CASE       :      Dict							=    len(__lowerCAmelCase				)
		SCREAMING_SNAKE_CASE       :      Optional[int]							=    [[False for _ in range(m + 1				)] for _ in range(n + 1				)]
		SCREAMING_SNAKE_CASE       :      int							=    True
		for i in range(__lowerCAmelCase				):
				for j in range(m + 1				):
						if dp[i][j]:
								if j < m and a[i].upper() == b[j]:
										SCREAMING_SNAKE_CASE       :      Union[str, Any]							=    True
								if a[i].islower():
										SCREAMING_SNAKE_CASE       :      List[str]							=    True
		return dp[n][m]


if __name__ == "__main__":
			import doctest

			doctest.testmod()














snake_case    				=		"""Tobias Carryer"""

from time import time


class  SCREAMING_SNAKE_CASE			:
     '''simple docstring'''


     def __init__(				self       :	List[Any]					, UpperCAmelCase_       :	List[str]					, UpperCAmelCase_       :	Optional[int]					, UpperCAmelCase_       :	Any					, UpperCAmelCase_       :	int=int(time()      )      ):  # noqa: B008
       SCREAMING_SNAKE_CASE       :      Optional[Any]							=    multiplier
       SCREAMING_SNAKE_CASE       :      Tuple							=    increment
       SCREAMING_SNAKE_CASE       :      int							=    modulo
       SCREAMING_SNAKE_CASE       :      Optional[int]							=    seed






     def 				_A       (				self       :	Tuple      ):
       SCREAMING_SNAKE_CASE       :      Optional[Any]							=    (self.multiplier * self.seed + self.increment) % self.modulo
       return self.seed


if __name__ == "__main__":
   # Show the LCG in action.
   snake_case    				=		LinearCongruentialGenerator(1_664_525, 1_013_904_223, 2 << 31)
   while True:
      print(lcg.next_number())






