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]: 5, 11, ['P', '8565', '3357', '1049', '9881', 'V', '2119', '2447', 'M', '8017', 'N', 'n', '3913', '4271', 't', '1585']
[EX A]: 22464

[EX Q]: 5, 9, ['125', 'A', 'E', 'X', 'j', '319', 'm', '7037', 'g', 'D', 'g', '6737', 'z', '5249']
[EX A]: 7356

[EX Q]: 3, 19, ['n', '8375', '8735', '3927', 't', 'u', 'K', '5177', '6325', '2647', 'B', 'm', 'f', 'c', '669', '9621', 'J', 'g', '3747', '5621', 'd', '4649']
[EX A]:
40848