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, 15, ['H', '6145', '7429', 'Q', 'N', '6683', 'w', '4553', '9469', 's', '117', 'C', '9463', '9715', 'e', '7137', '3551', 'd', 'A', '2715', 'k', 'E', '6087', '3165', 'g', '3445', 'e']