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]: 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]: 3, 4, ['3949', '5315', 'G', 's', 'v', 'm', '7833', 'E', 'j']
[EX A]: 0

[EX Q]: 1, 11, ['5413', 'E', 'Y', '963', 'b', 'p', '6305', '867', '2543', 'O', '5415', 'W', '4745']
[EX A]:
21506