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, ['8415', '3175', '2153', '3863', '9999', '1289', '6873', 'o', 'L', '1701', 'y', 't', '1231', 'I', 'u', '4621', '3343', 'O', 'K', 'c', '9247']