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

9, 11, ['6655', 'V', 'm', '3229', '2427', '9165', 'F', 'c', 'K', '3925', '1261', '1055', 'S']
5186

20, 26, ['n', '2655', '4683', '3979', '1385', 'L', 'M', 'i', '5265', '3823', 'p', 'H', 'R', '3089', 'e', '5057', 'I', '2977', 'w', 'O', '5827', '2995', '4223', 'j', '797', '1473', 'X', 'w', '8477', 'V']

15315