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, ['g', '9753', '551', 'A', '4549', '6887', 'K', '6989', 'd', 'M', 'a', 'z', 'z', '1843', '3779', 'w', '1139', '3523', '5345', 'E', 'J', '9839', '5697', '8171', '9971']