






from collections import deque
from math import floor
from random import random
from time import time



class   lowerCamelCase      :







		'''simple docstring'''



		def __init__(							self   )	->							Optional[int]:
							UpperCAmelCase_    :      Dict            =						{}



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase				,		_UpperCamelCase				,		_UpperCamelCase=1   )	->							List[Any]:
							if self.graph.get(_UpperCamelCase   ):
												if self.graph[u].count([w, v]   ) == 0:
																	self.graph[u].append([w, v]   )
							else:
												UpperCAmelCase_    :      Optional[int]            =						[[w, v]]
							if not self.graph.get(_UpperCamelCase   ):
												UpperCAmelCase_    :      int            =						[]



		def 					__UpperCAmelCase			(							self   )	->							Dict:
							return list(self.graph   )



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase				,		_UpperCamelCase   )	->							int:
							if self.graph.get(_UpperCamelCase   ):
												for _ in self.graph[u]:
																	if _[1] == v:
																						self.graph[u].remove(_UpperCamelCase   )



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase=-2				,		_UpperCamelCase=-1   )	->							Union[str, Any]:
							if s == d:
												return []
							UpperCAmelCase_    :      Optional[Any]            =						[]
							UpperCAmelCase_    :      Optional[int]            =						[]
							if s == -2:
												UpperCAmelCase_    :      Any            =						list(self.graph   )[0]
							stack.append(_UpperCamelCase   )
							visited.append(_UpperCamelCase   )
							UpperCAmelCase_    :      Optional[int]            =						s

							while True:
												# check if there is any non isolated nodes
												if len(self.graph[s]   ) != 0:
																	UpperCAmelCase_    :      Union[str, Any]            =						s
																	for node in self.graph[s]:
																						if visited.count(node[1]   ) < 1:
																											if node[1] == d:
																																visited.append(_UpperCamelCase   )
																																return visited
																											else:
																																stack.append(node[1]   )
																																visited.append(node[1]   )
																																UpperCAmelCase_    :      Tuple            =						node[1]
																																break

            # check if all the children are visited
												if s == ss:
																	stack.pop()
																	if len(_UpperCamelCase   ) != 0:
																						UpperCAmelCase_    :      Union[str, Any]            =						stack[len(_UpperCamelCase   ) - 1]
												else:
																	UpperCAmelCase_    :      int            =						ss

												# check if se have reached the starting point
												if len(_UpperCamelCase   ) == 0:
																	return visited



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase=-1   )	->							Union[str, Any]:
							if c == -1:
												UpperCAmelCase_    :      Any            =						floor(random() * 1_0_0_0_0   ) + 1_0
							for i in range(_UpperCamelCase   ):
												# every vertex has max 100 edges
												for _ in range(floor(random() * 1_0_2   ) + 1   ):
																	UpperCAmelCase_    :      int            =						floor(random() * c   ) + 1
																	if n != i:
																						self.add_pair(_UpperCamelCase				,		_UpperCamelCase				,		1   )



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase=-2   )	->							Tuple:
							UpperCAmelCase_    :      Union[str, Any]            =						deque()
							UpperCAmelCase_    :      Dict            =						[]
							if s == -2:
												UpperCAmelCase_    :      Tuple            =						list(self.graph   )[0]
							d.append(_UpperCamelCase   )
							visited.append(_UpperCamelCase   )
							while d:
												UpperCAmelCase_    :      Any            =						d.popleft()
												if len(self.graph[s]   ) != 0:
																	for node in self.graph[s]:
																						if visited.count(node[1]   ) < 1:
																											d.append(node[1]   )
																											visited.append(node[1]   )
							return visited



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase   )	->							Any:
							UpperCAmelCase_    :      Dict            =						0
							for x in self.graph:
												for y in self.graph[x]:
																	if y[1] == u:
																						count += 1
							return count



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase   )	->							Dict:
							return len(self.graph[u]   )



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase=-2   )	->							Optional[int]:
							UpperCAmelCase_    :      Tuple            =						[]
							UpperCAmelCase_    :      List[Any]            =						[]
							if s == -2:
												UpperCAmelCase_    :      Optional[Any]            =						list(self.graph   )[0]
							stack.append(_UpperCamelCase   )
							visited.append(_UpperCamelCase   )
							UpperCAmelCase_    :      List[str]            =						s
							UpperCAmelCase_    :      Union[str, Any]            =						[]

							while True:
												# check if there is any non isolated nodes
												if len(self.graph[s]   ) != 0:
																	UpperCAmelCase_    :      Tuple            =						s
																	for node in self.graph[s]:
																						if visited.count(node[1]   ) < 1:
																											stack.append(node[1]   )
																											visited.append(node[1]   )
																											UpperCAmelCase_    :      Union[str, Any]            =						node[1]
																											break

            # check if all the children are visited
												if s == ss:
																	sorted_nodes.append(stack.pop()   )
																	if len(_UpperCamelCase   ) != 0:
																						UpperCAmelCase_    :      List[Any]            =						stack[len(_UpperCamelCase   ) - 1]
												else:
																	UpperCAmelCase_    :      Optional[int]            =						ss

												# check if se have reached the starting point
												if len(_UpperCamelCase   ) == 0:
																	return sorted_nodes



		def 					__UpperCAmelCase			(							self   )	->							int:
							UpperCAmelCase_    :      List[Any]            =						[]
							UpperCAmelCase_    :      str            =						[]
							UpperCAmelCase_    :      Union[str, Any]            =						list(self.graph   )[0]
							stack.append(_UpperCamelCase   )
							visited.append(_UpperCamelCase   )
							UpperCAmelCase_    :      Any            =						-2
							UpperCAmelCase_    :      List[Any]            =						[]
							UpperCAmelCase_    :      List[str]            =						s
							UpperCAmelCase_    :      Optional[int]            =						False
							UpperCAmelCase_    :      Any            =						set()

							while True:
												# check if there is any non isolated nodes
												if len(self.graph[s]   ) != 0:
																	UpperCAmelCase_    :      Union[str, Any]            =						s
																	for node in self.graph[s]:
																						if (
																						    visited.count(node[1]   ) > 0
																						    and node[1] != parent
																						    and indirect_parents.count(node[1]   ) > 0
																						    and not on_the_way_back
																						):
																											UpperCAmelCase_    :      Dict            =						len(_UpperCamelCase   ) - 1
																											while len_stack >= 0:
																																if stack[len_stack] == node[1]:
																																					anticipating_nodes.add(node[1]   )
																																					break
																																else:
																																					anticipating_nodes.add(stack[len_stack]   )
																																					len_stack -= 1
																						if visited.count(node[1]   ) < 1:
																											stack.append(node[1]   )
																											visited.append(node[1]   )
																											UpperCAmelCase_    :      Dict            =						node[1]
																											break

            # check if all the children are visited
												if s == ss:
																	stack.pop()
																	UpperCAmelCase_    :      Any            =						True
																	if len(_UpperCamelCase   ) != 0:
																						UpperCAmelCase_    :      List[str]            =						stack[len(_UpperCamelCase   ) - 1]
												else:
																	UpperCAmelCase_    :      int            =						False
																	indirect_parents.append(_UpperCamelCase   )
																	UpperCAmelCase_    :      Tuple            =						s
																	UpperCAmelCase_    :      List[Any]            =						ss

												# check if se have reached the starting point
												if len(_UpperCamelCase   ) == 0:
																	return list(_UpperCamelCase   )



		def 					__UpperCAmelCase			(							self   )	->							Optional[int]:
							UpperCAmelCase_    :      Union[str, Any]            =						[]
							UpperCAmelCase_    :      Optional[Any]            =						[]
							UpperCAmelCase_    :      Any            =						list(self.graph   )[0]
							stack.append(_UpperCamelCase   )
							visited.append(_UpperCamelCase   )
							UpperCAmelCase_    :      Tuple            =						-2
							UpperCAmelCase_    :      Dict            =						[]
							UpperCAmelCase_    :      Tuple            =						s
							UpperCAmelCase_    :      Any            =						False
							UpperCAmelCase_    :      Dict            =						set()

							while True:
												# check if there is any non isolated nodes
												if len(self.graph[s]   ) != 0:
																	UpperCAmelCase_    :      Optional[Any]            =						s
																	for node in self.graph[s]:
																						if (
																						    visited.count(node[1]   ) > 0
																						    and node[1] != parent
																						    and indirect_parents.count(node[1]   ) > 0
																						    and not on_the_way_back
																						):
																											UpperCAmelCase_    :      int            =						len(_UpperCamelCase   ) - 1
																											while len_stack_minus_one >= 0:
																																if stack[len_stack_minus_one] == node[1]:
																																					anticipating_nodes.add(node[1]   )
																																					break
																																else:
																																					return True
																						if visited.count(node[1]   ) < 1:
																											stack.append(node[1]   )
																											visited.append(node[1]   )
																											UpperCAmelCase_    :      Optional[Any]            =						node[1]
																											break

            # check if all the children are visited
												if s == ss:
																	stack.pop()
																	UpperCAmelCase_    :      List[Any]            =						True
																	if len(_UpperCamelCase   ) != 0:
																						UpperCAmelCase_    :      int            =						stack[len(_UpperCamelCase   ) - 1]
												else:
																	UpperCAmelCase_    :      List[Any]            =						False
																	indirect_parents.append(_UpperCamelCase   )
																	UpperCAmelCase_    :      Union[str, Any]            =						s
																	UpperCAmelCase_    :      Dict            =						ss

												# check if se have reached the starting point
												if len(_UpperCamelCase   ) == 0:
																	return False



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase=-2				,		_UpperCamelCase=-1   )	->							Tuple:
							UpperCAmelCase_    :      Optional[int]            =						time()
							self.dfs(_UpperCamelCase				,		_UpperCamelCase   )
							UpperCAmelCase_    :      Optional[int]            =						time()
							return end - begin



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase=-2   )	->							int:
							UpperCAmelCase_    :      int            =						time()
							self.bfs(_UpperCamelCase   )
							UpperCAmelCase_    :      List[Any]            =						time()
							return end - begin





class   lowerCamelCase      :







		'''simple docstring'''



		def __init__(							self   )	->							str:
							UpperCAmelCase_    :      Optional[Any]            =						{}



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase				,		_UpperCamelCase				,		_UpperCamelCase=1   )	->							Any:
							# check if the u exists
							if self.graph.get(_UpperCamelCase   ):
												# if there already is a edge
												if self.graph[u].count([w, v]   ) == 0:
																	self.graph[u].append([w, v]   )
							else:
												# if u does not exist
												UpperCAmelCase_    :      List[str]            =						[[w, v]]
							# add the other way
							if self.graph.get(_UpperCamelCase   ):
												# if there already is a edge
												if self.graph[v].count([w, u]   ) == 0:
																	self.graph[v].append([w, u]   )
							else:
												# if u does not exist
												UpperCAmelCase_    :      List[str]            =						[[w, u]]



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase				,		_UpperCamelCase   )	->							Union[str, Any]:
							if self.graph.get(_UpperCamelCase   ):
												for _ in self.graph[u]:
																	if _[1] == v:
																						self.graph[u].remove(_UpperCamelCase   )
        # the other way round
							if self.graph.get(_UpperCamelCase   ):
												for _ in self.graph[v]:
																	if _[1] == u:
																						self.graph[v].remove(_UpperCamelCase   )



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase=-2				,		_UpperCamelCase=-1   )	->							List[str]:
							if s == d:
												return []
							UpperCAmelCase_    :      Union[str, Any]            =						[]
							UpperCAmelCase_    :      Union[str, Any]            =						[]
							if s == -2:
												UpperCAmelCase_    :      Tuple            =						list(self.graph   )[0]
							stack.append(_UpperCamelCase   )
							visited.append(_UpperCamelCase   )
							UpperCAmelCase_    :      Dict            =						s

							while True:
												# check if there is any non isolated nodes
												if len(self.graph[s]   ) != 0:
																	UpperCAmelCase_    :      Tuple            =						s
																	for node in self.graph[s]:
																						if visited.count(node[1]   ) < 1:
																											if node[1] == d:
																																visited.append(_UpperCamelCase   )
																																return visited
																											else:
																																stack.append(node[1]   )
																																visited.append(node[1]   )
																																UpperCAmelCase_    :      Optional[int]            =						node[1]
																																break

            # check if all the children are visited
												if s == ss:
																	stack.pop()
																	if len(_UpperCamelCase   ) != 0:
																						UpperCAmelCase_    :      Dict            =						stack[len(_UpperCamelCase   ) - 1]
												else:
																	UpperCAmelCase_    :      Dict            =						ss

												# check if se have reached the starting point
												if len(_UpperCamelCase   ) == 0:
																	return visited



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase=-1   )	->							Any:
							if c == -1:
												UpperCAmelCase_    :      List[str]            =						floor(random() * 1_0_0_0_0   ) + 1_0
							for i in range(_UpperCamelCase   ):
												# every vertex has max 100 edges
												for _ in range(floor(random() * 1_0_2   ) + 1   ):
																	UpperCAmelCase_    :      List[Any]            =						floor(random() * c   ) + 1
																	if n != i:
																						self.add_pair(_UpperCamelCase				,		_UpperCamelCase				,		1   )



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase=-2   )	->							Optional[Any]:
							UpperCAmelCase_    :      Optional[Any]            =						deque()
							UpperCAmelCase_    :      List[str]            =						[]
							if s == -2:
												UpperCAmelCase_    :      List[str]            =						list(self.graph   )[0]
							d.append(_UpperCamelCase   )
							visited.append(_UpperCamelCase   )
							while d:
												UpperCAmelCase_    :      str            =						d.popleft()
												if len(self.graph[s]   ) != 0:
																	for node in self.graph[s]:
																						if visited.count(node[1]   ) < 1:
																											d.append(node[1]   )
																											visited.append(node[1]   )
							return visited



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase   )	->							Optional[Any]:
							return len(self.graph[u]   )



		def 					__UpperCAmelCase			(							self   )	->							str:
							UpperCAmelCase_    :      int            =						[]
							UpperCAmelCase_    :      int            =						[]
							UpperCAmelCase_    :      str            =						list(self.graph   )[0]
							stack.append(_UpperCamelCase   )
							visited.append(_UpperCamelCase   )
							UpperCAmelCase_    :      Optional[int]            =						-2
							UpperCAmelCase_    :      Optional[int]            =						[]
							UpperCAmelCase_    :      List[Any]            =						s
							UpperCAmelCase_    :      Any            =						False
							UpperCAmelCase_    :      int            =						set()

							while True:
												# check if there is any non isolated nodes
												if len(self.graph[s]   ) != 0:
																	UpperCAmelCase_    :      List[str]            =						s
																	for node in self.graph[s]:
																						if (
																						    visited.count(node[1]   ) > 0
																						    and node[1] != parent
																						    and indirect_parents.count(node[1]   ) > 0
																						    and not on_the_way_back
																						):
																											UpperCAmelCase_    :      Any            =						len(_UpperCamelCase   ) - 1
																											while len_stack >= 0:
																																if stack[len_stack] == node[1]:
																																					anticipating_nodes.add(node[1]   )
																																					break
																																else:
																																					anticipating_nodes.add(stack[len_stack]   )
																																					len_stack -= 1
																						if visited.count(node[1]   ) < 1:
																											stack.append(node[1]   )
																											visited.append(node[1]   )
																											UpperCAmelCase_    :      Optional[int]            =						node[1]
																											break

            # check if all the children are visited
												if s == ss:
																	stack.pop()
																	UpperCAmelCase_    :      Optional[int]            =						True
																	if len(_UpperCamelCase   ) != 0:
																						UpperCAmelCase_    :      Any            =						stack[len(_UpperCamelCase   ) - 1]
												else:
																	UpperCAmelCase_    :      Optional[Any]            =						False
																	indirect_parents.append(_UpperCamelCase   )
																	UpperCAmelCase_    :      Optional[int]            =						s
																	UpperCAmelCase_    :      Any            =						ss

												# check if se have reached the starting point
												if len(_UpperCamelCase   ) == 0:
																	return list(_UpperCamelCase   )



		def 					__UpperCAmelCase			(							self   )	->							List[Any]:
							UpperCAmelCase_    :      List[Any]            =						[]
							UpperCAmelCase_    :      int            =						[]
							UpperCAmelCase_    :      List[str]            =						list(self.graph   )[0]
							stack.append(_UpperCamelCase   )
							visited.append(_UpperCamelCase   )
							UpperCAmelCase_    :      Optional[Any]            =						-2
							UpperCAmelCase_    :      Tuple            =						[]
							UpperCAmelCase_    :      List[str]            =						s
							UpperCAmelCase_    :      int            =						False
							UpperCAmelCase_    :      Union[str, Any]            =						set()

							while True:
												# check if there is any non isolated nodes
												if len(self.graph[s]   ) != 0:
																	UpperCAmelCase_    :      str            =						s
																	for node in self.graph[s]:
																						if (
																						    visited.count(node[1]   ) > 0
																						    and node[1] != parent
																						    and indirect_parents.count(node[1]   ) > 0
																						    and not on_the_way_back
																						):
																											UpperCAmelCase_    :      Any            =						len(_UpperCamelCase   ) - 1
																											while len_stack_minus_one >= 0:
																																if stack[len_stack_minus_one] == node[1]:
																																					anticipating_nodes.add(node[1]   )
																																					break
																																else:
																																					return True
																						if visited.count(node[1]   ) < 1:
																											stack.append(node[1]   )
																											visited.append(node[1]   )
																											UpperCAmelCase_    :      Optional[Any]            =						node[1]
																											break

            # check if all the children are visited
												if s == ss:
																	stack.pop()
																	UpperCAmelCase_    :      int            =						True
																	if len(_UpperCamelCase   ) != 0:
																						UpperCAmelCase_    :      Dict            =						stack[len(_UpperCamelCase   ) - 1]
												else:
																	UpperCAmelCase_    :      Optional[int]            =						False
																	indirect_parents.append(_UpperCamelCase   )
																	UpperCAmelCase_    :      Dict            =						s
																	UpperCAmelCase_    :      Optional[Any]            =						ss

												# check if se have reached the starting point
												if len(_UpperCamelCase   ) == 0:
																	return False



		def 					__UpperCAmelCase			(							self   )	->							List[str]:
							return list(self.graph   )



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase=-2				,		_UpperCamelCase=-1   )	->							Any:
							UpperCAmelCase_    :      Optional[int]            =						time()
							self.dfs(_UpperCamelCase				,		_UpperCamelCase   )
							UpperCAmelCase_    :      Union[str, Any]            =						time()
							return end - begin



		def 					__UpperCAmelCase			(							self				,		_UpperCamelCase=-2   )	->							Tuple:
							UpperCAmelCase_    :      Optional[Any]            =						time()
							self.bfs(_UpperCamelCase   )
							UpperCAmelCase_    :      Optional[int]            =						time()
							return end - begin








from collections import OrderedDict
from typing import TYPE_CHECKING, Any, List, Mapping, Optional, Union

from ...configuration_utils import PretrainedConfig
from ...onnx import OnnxConfig
from ...utils import TensorType, logging


if TYPE_CHECKING:
			from ...onnx.config import PatchingSpec
			from ...tokenization_utils_base import PreTrainedTokenizerBase


_lowerCamelCase       :				List[Any]       =			logging.get_logger(__name__)

_lowerCamelCase       :				Union[str, Any]       =			{
    '''allenai/longformer-base-4096''': '''https://huggingface.co/allenai/longformer-base-4096/resolve/main/config.json''',
    '''allenai/longformer-large-4096''': '''https://huggingface.co/allenai/longformer-large-4096/resolve/main/config.json''',
    '''allenai/longformer-large-4096-finetuned-triviaqa''': (
        '''https://huggingface.co/allenai/longformer-large-4096-finetuned-triviaqa/resolve/main/config.json'''
    ),
    '''allenai/longformer-base-4096-extra.pos.embd.only''': (
        '''https://huggingface.co/allenai/longformer-base-4096-extra.pos.embd.only/resolve/main/config.json'''
    ),
    '''allenai/longformer-large-4096-extra.pos.embd.only''': (
        '''https://huggingface.co/allenai/longformer-large-4096-extra.pos.embd.only/resolve/main/config.json'''
    ),
}




class    SCREAMING_SNAKE_CASE__     (	UpperCAmelCase					):





	'''simple docstring'''



	_UpperCAmelCase       :		Dict       =					"longformer"



	def __init__(  self	:    Optional[Any]			,  lowercase	:    Union[List[int], int] = 512			,  lowercase	:    int = 2			,  lowercase	:    int = 1			,  lowercase	:    int = 0			,  lowercase	:    int = 2			,  lowercase	:    int = 30_522			,  lowercase	:    int = 768			,  lowercase	:    int = 12			,  lowercase	:    int = 12			,  lowercase	:    int = 3_072			,  lowercase	:    str = "gelu"			,  lowercase	:    float = 0.1			,  lowercase	:    float = 0.1			,  lowercase	:    int = 512			,  lowercase	:    int = 2			,  lowercase	:    float = 0.02			,  lowercase	:    float = 1E-12			,  lowercase	:    bool = False			,  **lowercase	:    Optional[Any]			,  ):


				'''simple docstring'''


				super().__init__(pad_token_id=lowercase			,  **lowercase	)

				_snake_case		=			attention_window
				_snake_case		=			sep_token_id
				_snake_case		=			bos_token_id
				_snake_case		=			eos_token_id
				_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		=			onnx_export




class    SCREAMING_SNAKE_CASE__     (	UpperCAmelCase					):





	'''simple docstring'''



	def __init__(  self	:    int			,  lowercase	:    "PretrainedConfig"			,  lowercase	:    str = "default"			,  lowercase	:    "List[PatchingSpec]" = None	):


				'''simple docstring'''


				super().__init__(lowercase			,  lowercase			,  lowercase	)
				_snake_case		=			True



	@property
	def  A							(  self	:    Union[str, Any]	):


				'''simple docstring'''


				if self.task == "multiple-choice":
							_snake_case		=			{0: 'batch', 1: 'choice', 2: 'sequence'}
				else:
							_snake_case		=			{0: 'batch', 1: 'sequence'}
				return OrderedDict(
				    [
				        ('input_ids', dynamic_axis),
				        ('attention_mask', dynamic_axis),
				        ('global_attention_mask', dynamic_axis),
				    ]	)



	@property
	def  A							(  self	:    int	):


				'''simple docstring'''


				_snake_case		=			super().outputs
				if self.task == "default":
							_snake_case		=			{0: 'batch'}
				return outputs



	@property
	def  A							(  self	:    List[Any]	):


				'''simple docstring'''


				return 1E-4



	@property
	def  A							(  self	:    List[str]	):


				'''simple docstring'''


				return max(super().default_onnx_opset			,  14	)





	def  A							(  self	:    str			,  lowercase	:    "PreTrainedTokenizerBase"			,  lowercase	:    int = -1			,  lowercase	:    int = -1			,  lowercase	:    bool = False			,  lowercase	:    Optional[TensorType] = None			,  ):


				'''simple docstring'''


				_snake_case		=			super().generate_dummy_inputs(
				    preprocessor=lowercase			,  batch_size=lowercase			,  seq_length=lowercase			,  is_pair=lowercase			,  framework=lowercase	)
				import torch

				# for some reason, replacing this code by inputs["global_attention_mask"] = torch.randint(2, inputs["input_ids"].shape, dtype=torch.int64)
				# makes the export fail randomly
				_snake_case		=			torch.zeros_like(inputs['input_ids']	)
				# make every second token global
				_snake_case		=			1

				return inputs