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.

[Q]: 1, 2, ['X', '6095', '5959', '4481', '5997', '3307', 'B']
[A]: 6095


[Q]: 10, 14, ['E', 'P', 'm', 'o', '4203', '657', 'Z', '9975', 'p', '4013', 'M', 'm', '7369', 'x', 'K', 's', '9411', '9787', '4293', '8229']
[A]: 11382


[Q]: 6, 6, ['T', '7507', 'u', '2827', 'a', '4441', 'a', '3275', 'V', 'P', '5', '6841', '7723', 'd', 'R', '3189', '9989', '995', 'X', '5411', 's', '2023', '3971']
[A]:
4441