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]: 4, 6, ['c', 'I', 'O', 'q', 'W', 'w', '7245', '4329', '3833', 'v', 'p', 'V', '5311', 'x', '3971', 't', '8157', '1803']
[EX A]: 0

[EX Q]: 1, 9, ['6607', '6185', 'X', 'd', 'T', 't', 'Y', 'p', '2789', 'a', '7365', 'k', 'n', '1853', 'x', 'F', '5523', '2827', '1441', 'F', 'c', 'i', 'n', 'h', '3633']
[EX A]: 15581

[EX Q]: 3, 3, ['S', '6801', 'S']
[EX A]:
0