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.
11, 17, ['7947', 'P', 'D', 'G', '3425', '8825', '1531', '8139', 'y', '609', '6159', 'v', '6847', 'k', '4421', 'W', '6343', '439', 'G', '5313', '387', 'm', '9049']