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: 16, 21, ['C', '3591', '779', 'm', '9541', '2801', '3971', 'J', 'A', 'n', 'T', 'I', '5131', 'V', 'l', '6115', 'f', '7057', '3025', 'I', '3887', 'C']

20084