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]: 10, 14, ['E', 'P', 'm', 'o', '4203', '657', 'Z', '9975', 'p', '4013', 'M', 'm', '7369', 'x', 'K', 's', '9411', '9787', '4293', '8229']
[EX A]: 11382

[EX Q]: 4, 13, ['2921', '5905', '2835', '3625', '2481', '1657', '6239', '2393', 'u', '3255', '7061', '8197', 'k', '269', '1135', '5833', '7847', 'C', '4371', '4783', '9613']
[EX A]: 34908

[EX Q]: 2, 3, ['V', '5661', 'O']
[EX A]:
5661