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.
1, 21, ['J', '8679', '1325', '4739', '8859', '7193', 'Y', '9249', 'K', 'u', '2075', '8223', '2697', '1919', '7353', 'K', 'P', 'G', 'p', '9747', 'E', 'i', 'i', 'a', 'D']