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]: 16, 29, ['1431', 'a', '7223', '5743', '4571', 'q', 'Z', '3415', '6237', '1537', '5403', 'Y', 'K', '1949', 'p', '2641', '3307', 'X', 'O', 'q', 'T', 'n', '845', '1489', '161', '8515', '8735', '5065', '4973', '9287']
[A]: 35731


[Q]: 3, 8, ['g', 'D', 'W', 'q', '7817', '9295', '2385', 'V', 'c', '7761']
[A]: 19497


[Q]: 5, 9, ['6387', '8001', '447', 'w', 'T', '555', 'R', '8635', 'k', 'd', 'U']
[A]:
9190