





import doctest
from collections import deque

import numpy as np

class    _UpperCAmelCase							:
      def __init__(		self       ):
         A_     :				Any			      =	[2, 1, 2, -1]
         A_     :				int			      =	[1, 2, 3, 4]






      def 		_lowerCamelCase      (		self       ):
         A_     :				Optional[int]			      =	len(self.first_signal       )
         A_     :				List[Any]			      =	len(self.second_signal       )

         A_     :				Optional[int]			      =	max(a__      ,       a__       )

         # create a zero matrix of max_length x max_length
         A_     :				Union[str, Any]			      =	[[0] * max_length for i in range(a__       )]

         # fills the smaller signal with zeros to make both signals of same length
         if length_first_signal < length_second_signal:
            self.first_signal += [0] * (max_length - length_first_signal)
         elif length_first_signal > length_second_signal:
            self.second_signal += [0] * (max_length - length_second_signal)
         for i in range(a__       ):
            A_     :				List[Any]			      =	deque(self.second_signal       )
            rotated_signal.rotate(a__       )
            for j, item in enumerate(a__       ):
               matrix[i][j] += item

        # multiply the matrix with the first signal
         A_     :				Optional[Any]			      =	np.matmul(np.transpose(a__       )      ,       np.transpose(self.first_signal       )       )

         # rounding-off to two decimal places
         return [round(a__      ,       2       ) for i in final_signal]


if __name__ == "__main__":
      doctest.testmod()













import re



def     _lowerCAmelCase		(  _lowerCAmelCase     ):
   '''simple docstring'''


   A_     :				Any			      =	re.compile(r"""^(\+91[\-\s]?)?[0]?(91)?[789]\d{9}$"""     )
   if match := re.search(_lowerCAmelCase  ,_lowerCAmelCase     ):
      return match.string == phone
   return False


if __name__ == "__main__":
      print(indian_phone_validator("""+918827897895"""))






