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]: 2, 2, ['4965', '6219']
[EX A]: 6219

[EX Q]: 20, 26, ['8183', 'I', 'o', 'B', '7567', '4953', '8133', '2883', 'g', 'D', '865', 'a', 'y', 'Z', 'F', '3211', 'e', 'X', '5135', '7257', 'G', '1577', '7977', 'X', 'z', 'e']
[EX A]: 16811

[EX Q]: 11, 12, ['3757', 'G', 'z', 'A', '6069', 'E', '6025', '2253', 'f', '4505', 'f', '6037', 'o', 'K', 't', 's', 'j', 'T', '2699', '1687', 'U', 't', '1657', 'P', '3793', 'S', 'H']
[EX A]:
6037