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: 4, 5, ['1427', '7597', '765', 't', '7057', 'f', 'B', 'k']

A: 7057
****
Q: 3, 7, ['1687', '1929', '3189', '3277', 'L', 'b', 'x', '3181', 'C', 'w', 'A', 't', 'I', '3421']

A:
6466
****