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.
19, 20, ['5953', '5679', '4937', '5645', '7133', '3405', 'N', 'H', '4049', '5001', 'n', 'a', 'B', '3687', 'g', 'Z', '6865', '8691', '1305', 'x']