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, 6, ['a', '9091', 'I', '4849', 'O', '2435', 'v']
[EX A]: 16375

[EX Q]: 3, 6, ['7233', '7997', 'a', '727', '8387', 'Q', '1313', 'E']
[EX A]: 9114

[EX Q]: 1, 14, ['661', '2493', '5879', '9847', 'd', '6193', '3575', '1421', '6767', 'u', 'm', '8253', 'k', '2973', 'J', '187', '3073']
[EX A]:
48062