




def 						UpperCAmelCase				(			A__:    int							,				A__:    int							,				A__:    int     )  ->     Optional[int]:
			__lowerCamelCase					:	Optional[int]	       =				(num_of_terms / 2) * (2 * first_term + (num_of_terms - 1) * common_diff)
			# formula for sum of series
			return total





def 						UpperCAmelCase				(			)  ->     Optional[int]:
			print(sum_of_series(1							,				1							,				10     )     )


if __name__ == "__main__":
					import doctest

					doctest.testmod()









"""simple docstring"""
import math





def 						UpperCAmelCase				(			A__:    int = 100     )  ->     int:
			__lowerCamelCase					:	Optional[Any]	       =				sum(i * i for i in range(1							,				n + 1     )     )
			__lowerCamelCase					:	Union[str, Any]	       =				int(math.pow(sum(range(1							,				n + 1     )     )							,				2     )     )
			return square_of_sum - sum_of_squares


if __name__ == "__main__":
					print(F"""{solution() = }""")



