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.
1, 29, ['1419', '1823', 'm', 'y', 'B', '865', '2673', '8465', 'L', 'k', 'A', '7267', '7349', '113', 'q', '5499', 'F', '1455', '3289', '315', 'u', '8587', 'M', 'R', '2309', 'N', '1179', 'A', 'l']