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, 5, ['u', 'Y', '4165', '1421', '7617']
[EX A]: 13203

[EX Q]: 1, 1, ['2821', '3823', '9741', 'k', 'X', '2457']
[EX A]: 2821

[EX Q]: 10, 20, ['V', 'z', '5711', 'c', '7453', '5319', '5063', 'X', 'L', 'F', 'q', 'B', '3301', 'd', '9675', 'd', '7655', '9045', 'P', 'n', '8645']
[EX A]:
29676