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]: 2, 11, ['N', '3963', 'O', 'T', '8551', '3099', '577', '9273', '9849', '2593', '4693', 'A', 'O', '7381', 'o', 'P', 'g', 'H', '3927']
[EX A]: 42598

[EX Q]: 1, 3, ['g', 'g', 'K']
[EX A]: 0

[EX Q]: 4, 5, ['x', 'l', 'R', 'n', 'O', '2715', 'N', 'J', 'j', 'I', 'M', '897', '161', '6259', '8493', 'j', '6657', 'O', 'v']
[EX A]:
0