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.
7, 7, ['w', 'g', 'T', 'e', 'z', '8135', '6535', '3783', '1647', '9947', 'F', '9255', 'w', 'B', '6857', '8515', 'F', 'i', 'T', '5201', '5335', 'g', '3327', '6487', 'K', '9095', 'T', 'y', '849']