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, ['3933', 'g', '4259', 'c', 'e', '5473', '8603', 'O', 'S', 'a', '8639', 'z', 'W', 'V', '4207', 'A', 't', 's', 'e', '1363', 'R', '1309', '1719', 'P']