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: 2, 7, ['o', 'n', '793', '8841', 'j', '1967', '1615', '4155', '9919', '469', '9389', 'm', '8543', '3325', '1857', '6571']

13216