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.
11, 13, ['383', 'z', '8789', '3707', '1011', '8805', '851', '1417', '2025', '7789', 'm', '7635', '6145', 'p', '8275', 'M', 'K', '4113', 'i', '309']