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]: 1, 7, ['173', '5875', 'C', '7417', '3565', '1949', '537', '7707', 'o', 'y']
[EX A]: 19516

[EX Q]: 4, 6, ['4301', 'a', 'E', '3709', '5105', 'B']
[EX A]: 8814

[EX Q]: 7, 11, ['4855', '9755', '7495', '3619', '4483', '4307', '7625', 'N', 'l', 'd', 'D', '6475', '5003']
[EX A]:
7625