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.
22, 22, ['293', 'z', '1429', '7031', 'k', 'd', '4973', 'x', '1885', '1907', '3951', '8051', 'G', 'H', 'O', 'r', '3223', '563', 'W', '1933', 'X', '345', 'B']