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.
2, 11, ['1863', 'd', '6261', '1767', 'Y', 'F', 'p', '8679', 'A', 'n', '925', 'y', 'h', 'A', '1195', 'v', '6681', '9053', '3605', 'k', 'I', '5421', 'T', 'v', '133', 'm']