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, ['M', '3453', '5733', '2337', '9975', '1827', 't', '4937']
[EX A]: 3453

[EX Q]: 11, 11, ['1049', 'a', '7521', 'f', 'Z', '2973', '7245', 'e', '1807', 'e', '1325', '7327', 'r']
[EX A]: 1325

[EX Q]: 8, 10, ['n', 'k', '7971', 'K', 'l', 'e', 'K', 'W', '3329', 'O', 'v', '9705']
[EX A]:
3329