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.

1, 6, ['3309', 'w', '1143', 'D', 'Z', 'd']
4452

1, 6, ['H', '7937', '9919', 'G', 's', '1929', '8585', 'n', 'u', 'J', 'C', '387']
19785

12, 15, ['3203', '9761', 'O', '287', 'S', '1663', '2575', 'h', '6817', '6803', '3641', '6207', '3703', '2403', '4015', 'U', 'w', 'm', 'n', 'L', '2263', 'j', '577', '1935']

16328