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, 8, ['6669', 'G', 'y', '129', 'y', 'x', 'w', 'C', 'J']
[EX A]: 129

[EX Q]: 13, 14, ['6693', 'J', '2765', 'P', 'h', '755', 'z', '7483', 'W', '6895', '1293', '3479', 'Y', '1667', '9635']
[EX A]: 1667

[EX Q]: 1, 3, ['573', '1431', 'a']
[EX A]:
2004