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: 2, 15, ['U', '2613', '769', 'X', '3767', 'T', '8859', 'C', '3819', '8535', 'P', '1429', 'J', 'e', '3349', 'C', '3047', '9045', '2747', '1171']

33140