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.

Q: 1, 4, ['2025', '6689', '1227', '3943', 'z', '719', '8941', 'b', 'V', 'w', '5267', '2403', 'N', '5771']

A: 13884
****
Q: 1, 13, ['9225', '8983', 'E', 'F', 'L', 'V', 'h', '9233', '8887', 'o', 'd', 'U', 'B', 'u']

A: 36328
****
Q: 13, 23, ['5945', 'F', '4387', 'X', 'k', '9395', 'j', '1013', 'b', 'f', 'h', '4599', '4841', 'g', '2675', 'W', 'p', 'G', '31', '9301', '2393', 'M', '5927']

A:
25168
****