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.
1, 20, ['O', 'B', 'R', '4949', 'm', '8921', 'n', 'J', 'q', '8945', 'K', '7291', 'y', 'J', '8473', '3807', 'u', '1177', 'U', 'o', '937', 'Z', 'd', '4415', '9647', 'O', '9137', 'L', 't']