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, 1, ['D', 'W', '5783']
[EX A]: 0

[EX Q]: 11, 18, ['7053', '4271', '3175', '3997', '4153', '3255', 'd', '4507', 'q', 'm', 'V', '9999', 'Q', 'v', '8543', '2835', '1545', '3549']
[EX A]: 26471

[EX Q]: 7, 12, ['a', 'X', 'l', 'H', '5421', '7803', '167', '7743', 'z', '5935', 'i', 'G', 'd', 'k', '8859', '523', 'J', 'R', 'w', 'C', 'G']
[EX A]:
13845