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.

2, 7, ['7349', 'P', 'i', 'I', 'e', 'f', '9829']
9829

2, 9, ['S', 't', '243', '5691', '5695', 'Y', 'd', '8695', 'M', 'K', 'z', 'I', '7325', '8945', 'P', 'Q', 'I', 'N']
20324

7, 10, ['3917', 'l', 'l', 'A', 'Q', 'Z', 'K', 'I', '8367', '1207', 'Y', '3569', 'Z', 'j', '3421', '6693', 'C', '2655', '6905']

9574