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]: 6, 10, ['5601', '3783', '7919', '9195', 'G', 'J', 'L', 'X', 'O', 'F', '2479', 's', 'H', '5353', '7079', '2199', '2937', 'S']
[EX A]: 0

[EX Q]: 3, 4, ['3949', '5315', 'G', 's', 'v', 'm', '7833', 'E', 'j']
[EX A]: 0

[EX Q]: 2, 12, ['r', '9659', '3933', 'k', 'U', '7567', '6397', 'O', '7153', 'z', 'u', '9211', '2857', 'O', '8433', '1209', '8639', '7259', '1139']
[EX A]:
43920