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.
9, 11, ['L', '8899', 'v', '3057', 'X', 'f', '2189', 'J', '1845', '2899', 'f', 'J', '4417', '929', '5261', 'q', 'H', '1989', '1741', '3795', 'i', '459', '7565']