import logging

from transformers.configuration_utils import PretrainedConfig


UpperCAmelCase_								=							logging.getLogger(__name__)





class      lowerCAmelCase						(					_a			):
     _SCREAMING_SNAKE_CASE     :     Dict		="""masked_bert"""



     def __init__(					self				,      lowerCAmelCase__=30522				,      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__				,      ):
            super().__init__(pad_token_id=lowerCAmelCase__				,      **lowerCAmelCase__       )

            _A=	vocab_size
            _A=	hidden_size
            _A=	num_hidden_layers
            _A=	num_attention_heads
            _A=	hidden_act
            _A=	intermediate_size
            _A=	hidden_dropout_prob
            _A=	attention_probs_dropout_prob
            _A=	max_position_embeddings
            _A=	type_vocab_size
            _A=	initializer_range
            _A=	layer_norm_eps
            _A=	pruning_method
            _A=	mask_init
            _A=	mask_scale
def 							UpperCamelCase				(    )		->						list[list[int]]:




       '''simple docstring'''






       return [list(range(10_00 - i       ,					-10_00 - i       ,					-1   )   ) for i in range(10_00   )]


UpperCAmelCase_								=							generate_large_matrix()
UpperCAmelCase_								=							(
    [[4, 3, 2, -1], [3, 2, 1, -1], [1, 1, -1, -2], [-1, -1, -2, -3]],
    [[3, 2], [1, 0]],
    [[7, 7, 6]],
    [[7, 7, 6], [-1, -2, -3]],
    grid,
)

def 							UpperCamelCase				(    lowerCAmelCase_   )		->						None:




       '''simple docstring'''






       assert all(row == sorted(lowerCAmelCase_       ,					reverse=lowerCAmelCase_   ) for row in grid   )
       assert all(list(lowerCAmelCase_   ) == sorted(lowerCAmelCase_       ,					reverse=lowerCAmelCase_   ) for col in zip(*lowerCAmelCase_   )   )

def 							UpperCamelCase				(    lowerCAmelCase_   )		->						int:




       '''simple docstring'''






       _A=	0
       _A=	len(lowerCAmelCase_   ) - 1

       # Edge cases such as no values or all numbers are negative.
       if not array or array[0] < 0:
              return 0

       while right + 1 > left:
              _A=	(left + right) // 2
              _A=	array[mid]

              # Num must be negative and the index must be greater than or equal to 0.
              if num < 0 and array[mid - 1] >= 0:
                     return mid

              if num >= 0:
                     _A=	mid + 1
              else:
                     _A=	mid - 1
    # No negative numbers so return the last index of the array + 1 which is the length.
       return len(lowerCAmelCase_   )

def 							UpperCamelCase				(    lowerCAmelCase_   )		->						int:




       '''simple docstring'''






       _A=	0
       _A=	len(grid[0]   )

       for i in range(len(lowerCAmelCase_   )   ):
              _A=	find_negative_index(grid[i][:bound]   )
              total += bound
       return (len(lowerCAmelCase_   ) * len(grid[0]   )) - total

def 							UpperCamelCase				(    lowerCAmelCase_   )		->						int:




       '''simple docstring'''






       return len([number for row in grid for number in row if number < 0]   )

def 							UpperCamelCase				(    lowerCAmelCase_   )		->						int:




       '''simple docstring'''






       _A=	0
       for row in grid:
              for i, number in enumerate(lowerCAmelCase_   ):
                     if number < 0:
                            total += len(lowerCAmelCase_   ) - i
                            break
       return total

def 							UpperCamelCase				(    )		->						None:




       '''simple docstring'''






       from timeit import timeit

       print('Running benchmarks'   )
       _A=	(
           'from __main__ import count_negatives_binary_search, '
           'count_negatives_brute_force, count_negatives_brute_force_with_break, grid'
       )
       for func in (
           "count_negatives_binary_search",  # took 0.7727 seconds
           "count_negatives_brute_force_with_break",  # took 4.6505 seconds
           "count_negatives_brute_force",  # took 12.8160 seconds
       ):
              _A=	timeit(F"{func}(grid=grid)"       ,					setup=lowerCAmelCase_       ,					number=5_00   )
              print(F"{func}() took {time:0.4f} seconds"   )


if __name__ == "__main__":
      import doctest

      doctest.testmod()
      benchmark()