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, 9, ['361', 'm', '3583', 'n', '9563', '3209', '1555', '4077', 'V', '7871', 'y', 'Q', '9725', 'r', 't', 'G', 'T', 'R', '7615', '1131', '7271', 'A', '1493']