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.
10, 27, ['3619', '4607', '6049', '4877', '7603', '6639', '3401', '3673', '455', 'f', 'Q', '267', 'N', 'A', '9593', 'Y', '2625', '4127', 'i', 'j', 'i', 'u', '8955', 'E', '7179', 'k', 'F', '1115']