





def 	A_       (  _lowerCAmelCase							,     _lowerCAmelCase  )		->				bool:
 UpperCamelCase			:      int 			=     len(_lowerCAmelCase  )
 UpperCamelCase			:      List[str] 			=     len(_lowerCAmelCase  )
 UpperCamelCase			:      Any 			=     [[False for _ in range(m + 1  )] for _ in range(n + 1  )]
 UpperCamelCase			:      Union[str, Any] 			=     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]:
     UpperCamelCase			:      List[str] 			=     True
    if a[i].islower():
     UpperCamelCase			:      Union[str, Any] 			=     True
 return dp[n][m]


if __name__ == "__main__":
    import doctest

    doctest.testmod()









def 	A_       (  _lowerCAmelCase							,     _lowerCAmelCase  )		->				int:
 return int(input_a == input_a == 0  )



def 	A_       (  )		->				None:
 print("Truth Table of NOR Gate:"  )
 print("|   Input 1   |  Input 2  | Output |"  )
 print(F"""|      0      |    0      |  {nor_gate(0							,     0  )}     |"""  )
 print(F"""|      0      |    1      |  {nor_gate(0							,     1  )}     |"""  )
 print(F"""|      1      |    0      |  {nor_gate(1							,     0  )}     |"""  )
 print(F"""|      1      |    1      |  {nor_gate(1							,     1  )}     |"""  )


if __name__ == "__main__":
    import doctest

    doctest.testmod()
    main()
