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.

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

A: 719
****
Q: 2, 8, ['6901', '3901', '5101', '4297', '1099', 'q', 'z', '6615', 'z', '6859']

A: 21013
****
Q: 6, 12, ['j', 'D', '4025', '3063', '1367', 'E', 'c', 'f', '8559', 'c', 'l', 'u', '907', 'r', 'I', '7647']

A:
8559
****