Definition: 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.
Input: 12, 21, ['5097', 'C', 'e', '915', 'Z', 'e', '7063', 'C', '5491', 'e', '9673', 'G', 'I', 'y', '4031', 'l', '1481', 'M', '8675', 'A', '5891', '1045', '6259', 'C', '6129', 'J', '9023', '9129', 'J', '6267']

20078