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, 11, ['407', '8091', '2003', 'a', '7935', '6411', 'D', 'U', 's', 'l', '5905', 'e', '8157', '6859', 'H', 'T', 'k', '5933', 'D', '275', 'O', '4031', '9613', 'b', 'b', '2625', '6341', 'v', 'C', 'l']

30752