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.
15, 20, ['4935', 'G', 'b', 'q', '8983', '783', 'a', '1153', 'o', 's', '7283', 'c', '7913', 'e', '3585', 'r', 'G', 'M', 'n', 'Y', 'h', 'c', 'V', '9401', 'A', '2615', 'e', '3617', 'h']