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.
2, 12, ['4761', '6485', '1653', '1181', '8561', '6803', 'k', '5837', 'y', 't', 'f', '9089', '291', '8283', 'Q', '5827', 'f']