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]: 5, 8, ['5745', '5919', '2351', 'M', '3273', '6855', '2999', 's', 'F', 'o', 'W', '8607']
[EX A]: 13127

[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]: 6, 24, ['8849', 'J', 'm', '5667', 'L', 'h', '8199', 'c', 'T', '9453', '5029', '6171', 'x', 'Z', 'e', 'H', 'Y', '6395', '8591', 'L', '9273', 'Z', '5559', 'H', '7565', 'y']
[EX A]:
58670