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.
18, 26, ['k', '9203', '423', 'I', 'r', '6791', 'o', 'b', '6525', 'B', 'W', '7747', '309', '5437', 'P', '3545', 'P', '2535', '4563', '2069', '1209', 'd', 'I', 'q', 'k', '8615', 'c', 'M', 'e', '5617']