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]: 2, 11, ['8237', '8149', '7077', '2199', '7839', 'c', 'j', 'Y', '845', '2273', 'n', 'Q']
[EX A]: 28382

[EX Q]: 24, 26, ['7615', '2107', '5481', '3881', '1529', '7275', 'H', '8097', 'b', '1437', 'C', '9647', '9119', '461', '3671', '9655', 'V', '8613', 'I', 'F', 'X', '3661', 'c', 'T', 'T', 'n']
[EX A]:
0