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.
19, 20, ['5339', '2845', '6647', '3493', '6597', '5137', 'x', 'Z', '3567', '5175', 'H', '2177', 'g', '6751', 'C', '9305', 'Z', '689', 'x', 'l', '6621', 'x', '5243', '4441', 'W', '8401']