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, 15, ['k', 'z', 'D', '4827', '8921', 'o', 'e', 'U', 'f', '7419', 't', 'Z', 'c', '4089', '1117', '2309', '9095']
[EX A]: 26373

[EX Q]: 6, 13, ['Z', 'h', 'j', 'i', '4335', 'c', 'A', 'O', 'U', '8173', 'N', 'E', '9187', '9911']
[EX A]: 17360

[EX Q]: 5, 11, ['t', 'M', 'p', 'g', 'A', 'U', 'X', 'X', 'M', '5193', '995', 'X', '3365', 'N', 'c', 'j', 'S', '3949']
[EX A]:
6188