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, 2, ['8895', 't', '5739']
[EX A]: 8895

[EX Q]: 3, 8, ['3403', 'r', '7273', 'g', 'O', 'A', '123', '2839', 'g', 'R', 'f', 'y', 'F']
[EX A]: 10235

[EX Q]: 11, 18, ['g', 'I', 'B', 'p', 'X', '6547', '3703', '2489', 'V', '2961', '6413', 'W', '9045', 'x', '849', 'w', '2429', '2611', '6681']
[EX A]:
21347