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]: 14, 15, ['B', 'i', 'F', 'F', '7361', 'U', '6625', 'x', '7875', 'm', '5637', '9533', 'y', 'e', '5049', '3809', '1', '8269', '435', '2363', '1679', 'e', '8775', 'A', 'l', '161']
[EX A]: 5049

[EX Q]: 7, 16, ['l', '1165', '8087', 'M', '6269', '6349', 'R', 'm', 'j', '9437', '3875', 'n', 'R', 'Y', '4427', 'g', '6231', 'm', '1139', '3891', '3773', '1303', 'Y', '7347']
[EX A]: 17739

[EX Q]: 1, 1, ['1559', '7649']
[EX A]:
1559