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, 15, ['i', '3795', '7239', '6365', 'i', '4003', 'v', '6905', '9227', 'u', 'e', '5621', 'M', '7481', '4721', 'I', 'e', 'o', 'K', 'f']
[EX A]: 51562

[EX Q]: 1, 6, ['3309', 'w', '1143', 'D', 'Z', 'd']
[EX A]: 4452

[EX Q]: 1, 4, ['R', '9219', 'j', 'L', 'r', '7337', '2121', 'i', 'S', 'L', '6161', 'O', '3291', '2685', 'y', '4597', 'y', 'J']
[EX A]:
9219