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.

[EX Q]: 3, 6, ['x', '7739', '1923', '5829', '2215', 'M', '1901', 'A', '1585', 'W', '2433', '8947', '2217', '7879', 'i', '8543', '7457']
[EX A]: 9967

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

[EX Q]: 13, 15, ['p', '5827', '4439', 'C', '35', 'y', 'y', 'd', 'j', '6411', 'I', '2831', 'E', '3091', '8905', 'P', 'D', 'K']
[EX A]:
11996