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, ['9877', '589', 'l', '8205', '7793', 'f', '9219', '7979', 'O', 'c', '2701', 'k', 'N', '8121', '2837', '4073', '7125', 'n', '3335', 'b', 'E', '5917', '6967', '9613', '9995', 'H']