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]: 9, 9, ['G', '9137', 'G', '2393', '9383', 'r', '6897', '547', 'W', 'h', 'p', '4557']
[EX A]: 0

[EX Q]: 2, 16, ['e', 'Q', '4017', '1999', '2413', 'v', '4911', 'N', 'x', '3475', '2179', 'o', 'a', '6361', '1723', '6273']
[EX A]: 33351

[EX Q]: 1, 4, ['5309', '8147', '7911', 't', 'a', 'm', '3963', 'Q', 'a', 'v', 'K', '7315']
[EX A]:
21367