





import logging

from transformers.configuration_utils import PretrainedConfig


UpperCAmelCase_      							=     logging.getLogger(__name__)
class 			UpperCamelCase_		(  _lowerCamelCase					):
					lowerCAmelCase_							=	'''masked_bert'''




					def __init__(		self				,						lowerCAmelCase_=3_0522				,						lowerCAmelCase_=768				,						lowerCAmelCase_=12				,						lowerCAmelCase_=12				,						lowerCAmelCase_=3072				,						lowerCAmelCase_="gelu"				,						lowerCAmelCase_=0.1				,						lowerCAmelCase_=0.1				,						lowerCAmelCase_=512				,						lowerCAmelCase_=2				,						lowerCAmelCase_=0.02				,						lowerCAmelCase_=1E-12				,						lowerCAmelCase_=0				,						lowerCAmelCase_="topK"				,						lowerCAmelCase_="constant"				,						lowerCAmelCase_=0.0				,						**lowerCAmelCase_				,						)		->							Union[str, Any]:
												super().__init__(pad_token_id=lowerCAmelCase_				,						**lowerCAmelCase_  )

												_snake_case									=				vocab_size
												_snake_case									=				hidden_size
												_snake_case									=				num_hidden_layers
												_snake_case									=				num_attention_heads
												_snake_case									=				hidden_act
												_snake_case									=				intermediate_size
												_snake_case									=				hidden_dropout_prob
												_snake_case									=				attention_probs_dropout_prob
												_snake_case									=				max_position_embeddings
												_snake_case									=				type_vocab_size
												_snake_case									=				initializer_range
												_snake_case									=				layer_norm_eps
												_snake_case									=				pruning_method
												_snake_case									=				mask_init
												_snake_case									=				mask_scale










def 						lowerCamelCase__     (     UpperCamelCase__			:       list[int]       ,    UpperCamelCase__			:       int						)			-> bool:



					'''simple docstring'''




					_snake_case									=				len(UpperCamelCase__						)
					_snake_case									=				[[False] * (required_sum + 1) for _ in range(arr_len + 1						)]

					# for each arr value, a sum of zero(0) can be formed by not taking any element
					# hence True/1
					for i in range(arr_len + 1						):
										_snake_case									=				True

					# sum is not zero and set is empty then false
					for i in range(1       ,    required_sum + 1						):
										_snake_case									=				False

					for i in range(1       ,    arr_len + 1						):
										for j in range(1       ,    required_sum + 1						):
															if arr[i - 1] > j:
																				_snake_case									=				subset[i - 1][j]
															if arr[i - 1] <= j:
																				_snake_case									=				subset[i - 1][j] or subset[i - 1][j - arr[i - 1]]

					return subset[arr_len][required_sum]


if __name__ == "__main__":
					import doctest

					doctest.testmod()



