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]: 8, 22, ['h', '2971', 'l', 'F', 'e', 'f', 'b', 'I', 'b', '4759', 'm', 'w', '6179', 'R', '2875', '3469', '3801', 'm', '6987', 'A', 'c', '6303', '8135', 'c']
[EX A]: 34373

[EX Q]: 1, 3, ['Z', 'X', 't']
[EX A]: 0

[EX Q]: 12, 14, ['w', '1355', '835', '8109', '3345', 'n', '6635', 'k', '9461', 'g', 'F', 's', '1851', 'E']
[EX A]:
1851