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]: 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']
[A]: 18091


[Q]: 1, 2, ['4001', 'e', 'm', 'Q', 'T', 'a', '2909', '4043', 'O', 'L', '3401', 'Y', '4015', '2045', '3881', 'd']
[A]: 4001


[Q]: 16, 21, ['C', '3591', '779', 'm', '9541', '2801', '3971', 'J', 'A', 'n', 'T', 'I', '5131', 'V', 'l', '6115', 'f', '7057', '3025', 'I', '3887', 'C']
[A]:
20084