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]: 3, 4, ['v', 't', '4357', '1303']
[EX A]: 5660

[EX Q]: 17, 22, ['4123', '6299', '2781', '759', 'f', 'A', 'X', '2549', 'K', '8119', '8725', 'e', 'I', 'S', '1429', 'd', '8051', 'Q', 'y', '1045', '763', 't', 'J', 'J', '169', 'b', '721']
[EX A]: 9859

[EX Q]: 5, 6, ['b', 'P', '7199', '9131', '4987', '3063', '987', 'r', '9281', 'z', 'P', '7627']
[EX A]:
8050