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]: 1, 2, ['5605', '6415']
[EX A]: 12020

[EX Q]: 11, 15, ['S', 'F', 'q', 'r', 'X', '2063', '9327', 'R', 'T', 'B', 'j', 'b', 'T', 'X', '3469', 'E', '2177', '8143', 'U', 'Z', '8007', '4991', 'v', 'm', 'f', '7173', 'N', '2449', '2291']
[EX A]: 3469

[EX Q]: 7, 8, ['m', 'C', 'X', 'S', '5609', 'R', '8407', 'R', 'x', 'l', '9039', '9369', '1683', 'V', '6685', 'r', '1531', '7771', 'h', '999', '3435', 't']
[EX A]:
8407