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.
10, 27, ['8367', '9089', '8319', 'j', 'W', 'K', 'U', '4705', 'm', 'V', '2843', '6527', 'P', 'L', 'T', 'I', 'A', '2837', '6003', '4313', 'w', '7317', '573', '1417', '3837', 'Y', 'G', '9767', '3851', '8055']