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.
20, 22, ['9567', 's', '2825', '6283', 'p', 'V', 'P', 'Q', 'H', 'I', 'J', 'V', '4467', '5789', 'n', '779', '741', 's', 'n', 'G', '2683', '875', '5261', '7127', '311', '6259', '2991', '1673', 'c']