Code in Python only Given an array of size N and two integers K and S, the special sum of a subarray is defined as follows: (Sum of all elements of the subarray) * (K - p * S) Where p = number of...

Please program according to given guidelines in the question only

Extracted text: Code in Python only Given an array of size N and two integers K and S, the special sum of a subarray is defined as follows: (Sum of all elements of the subarray) * (K - p * S) Where p = number of distinct prime factors of "product of all elements of the subarray". Find the maximum special sum by considering all non-empty subarrays of the given array. First line contains 3 integers N, K and S. Second line contains N integers, the elements of the array. Output a single integer. The maximum special sum considering all non-empty subarrays of the array. Input 4 10 2 14 27 Output 138