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]: 2, 9, ['3707', 'J', 'H', '8907', '597', 'Z', '9725', 'g', 'R']
[EX A]: 19229

[EX Q]: 7, 15, ['1769', 'c', '7895', '8687', '985', '7559', '1109', 'X', 'z', '2309', 'D', 'P', '8655', 'I', 'u', 'z', '9639', '83', '7631']
[EX A]: 12073

[EX Q]: 5, 8, ['7847', '6419', '5649', 'I', 'b', 'o', '1787', '9745', '8737', '6019', '6509', '2415', '4427', '9691', '4793', '6835', 'H', '8853', '4397', '1165', 'X', '8415', 'i', '5083']
[EX A]:
11532