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]: 1, 3, ['x', '971', '3029']
[EX A]: 4000

[EX Q]: 1, 11, ['W', 'c', '8889', '2649', '6183', '1489', 't', 'o', '4925', '4411', 'b', '5657', 'i', 'q', 'z', 't']
[EX A]: 28546

[EX Q]: 2, 4, ['A', 'r', '1523', '9467', '7029', '357', '6053', 'Z', '4957', '119', '1243', '4235', '2103', '5557']
[EX A]:
10990