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.
9, 22, ['P', '9695', 'n', 'P', 'O', '7519', 'p', 'R', '6791', 'o', 'D', 'r', '2867', '8659', '5507', 'R', '3265', '6463', '4431', 'F', 'w', 'k', 'u', '9941', '6529', 'c', 'S']