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.
6, 13, ['r', '5001', '3329', 'M', 'n', '5051', 'J', 'J', 'P', '7045', 'W', 'W', '5383', 'n', '7137', '7685', 'c', '4239', 'd', 'B', '2365', 'N', 'V', 'M', '3571', 'S']