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: 1, 10, ['2995', 'i', 'd', 'U', '6363', 'c', 'K', 'N', '9981', 'l', '7043', 's', 'v', 'O', 'Z', 'I', '9147', 'e', 'e', 'o', 'b', '7211', 'T', '2479', '813']

19339