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.

3, 18, ['5593', '9147', 'F', 'O', '3355', '4669', 'j', '8117', 'I', '6935', 'x', 'Z', 'q', '8919', 'F', 'j', 'z', '215', '1761', 'y', '9889', '5557', 'p', 'm', '9293', '4673', 'X', '9519', '6099']
32210

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

2, 4, ['n', 'T', '4085', '407', 's', '9107', 'f', '3931', '9607', 'x', 'y']

4492