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, 5, ['5713', 'f', 'g', '9979', '2651', 't', '6513', 'v', '5733', '3325', 'M', 'B', '6139', 'n', 'K', 'h', 'c', '1181', '1263', '6625', 'F', '7059', 'c', '4083', 'i', 'g', '6783']
[EX A]: 12630

[EX Q]: 3, 6, ['r', '8615', '4477', 'k', 'Z', 'B']
[EX A]: 4477

[EX Q]: 1, 2, ['X', '6095', '5959', '4481', '5997', '3307', 'B']
[EX A]:
6095