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.
5, 5, ['8905', '459', 'o', '5443', '1477', '5311', 'B', '309', 'M', 'N', 'G', '9351', 'T', '4463', '7515', 's', '2169', 'C']