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, 18, ['P', '1429', '3883', '1883', 'u', 'K', 'N', 'j', 'u', 'H', 'y', '7785', '7371', '6869', '1613', '6515', '695', 'U', 'u']

Output: 36614

Input: Consider Input: 4, 5, ['3365', 'x', '3373', '8905', '1527', '9433', '2907', 'j', 'x', '7201', '307', '4507', '785', '6749', '4419', '2743']

Output: 10432

Input: Consider Input: 3, 8, ['7339', 'i', '8779', '3341', '6015', '6293', '1645', '4445', 'T', '9629', '6949', 'C', 'M', 'N', 'L']
Output: 30518