In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.

Input: Consider Input: 3, 4, ['I', '8765', 'a', '719', '2555', 'w', '3437', '6159', 'e', '5239']

Output: 719


Input: Consider Input: 1, 7, ['J', 'l', '9145', '5805', '4377', '2851', '8781', '7353', '145']

Output: 30959


Input: Consider Input: 4, 5, ['y', '3241', '233', '4619', 'i', 'C']


Output: 4619