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: 11, 19, ['J', '1289', '4551', '9179', '2405', 'W', '7111', 'E', '5565', 'p', '7941', '7183', '5475', 'z', 'o', '371', 'U', '7943', '8767']

37680