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, 3, ['3335', '3451', 'f', 'M']
[EX A]: 3451

[EX Q]: 1, 1, ['5141', 'S']
[EX A]: 5141

[EX Q]: 16, 17, ['5467', 'l', 'B', 'm', '1287', '3575', '6871', '5213', '4261', 'l', 'N', '3833', 'C', 'k', 'z', '6917', 'G']
[EX A]:
6917