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.
12, 15, ['8379', 'O', '6103', '9963', '6969', '8867', '2301', 'D', 'd', '5367', 'y', 'j', 'c', 'a', 'x', 'A', '3495', '1947', '9491', 'Q', 'K', 'b', 'L', 'f']