class Solution:
    def subArraySum(self,arr, n, sum_): 
        # Initialize curr_sum as
        # value of first element
        # and starting point as 0 
        A = []
        curr_sum = arr[0]
        start = 0

        # Add elements one by 
        # one to curr_sum and 
        # if the curr_sum exceeds 
        # the sum, then remove 
        # starting element 
        i = 1
        while i <= n:
        
            # If curr_sum exceeds
            # the sum, then remove
            # the starting elements
            while curr_sum > sum_ and start < i-1:
        
                curr_sum = curr_sum - arr[start]
                start += 1
            
            # If curr_sum becomes
            # equal to sum, then
            # return true
            if curr_sum == sum_:
                A.append(start+1)
                A.append(i)
                return A

            # Add this element 
            # to curr_sum
            if i < n:
                curr_sum = curr_sum + arr[i]
            i += 1

        # If we reach here, 
        # then no subarray
        A.append(-1)
        return A


ob = Solution()
a = [1,2,3,4,5,6,7,8,9,10]
n = 10
s = 18
ans = ob.subArraySum(a, n, s)

for i in ans:
    print (i)
