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, 21, ['h', 'C', '8411', 'j', '5693', 'L', 'D', 'V', 't', 't', 'E', '3101', '5045', '9945', 'P', 'q', 'e', 'k', 'T', 'b', 'A', '7015', '6635', '3769', 'j', 'X', '6469']
[EX A]: 18091

[EX Q]: 3, 4, ['h', 'w', 'L', 'L']
[EX A]: 0

[EX Q]: 12, 16, ['e', 'g', 'S', 'e', 'J', 'Q', 'c', '4097', 'J', '4785', '2273', 'l', 'A', 'E', '7871', 'w']
[EX A]:
7871