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.

9, 29, ['E', 'r', '2463', 'F', 'i', '6149', 'y', 'o', '8901', '2789', 'K', '809', '4057', 'l', '619', 'h', '4077', 'w', '5567', 'I', 'm', '8313', '2369', 'V', '1597', '1715', 'R', '6109', 's', '3957']
46922