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.
7, 19, ['465', 'S', 'G', '7463', '6947', '3065', 'F', '2275', 'a', '6253', '5785', '7447', 'T', '1123', 'X', 'l', '4659', '7201', '8421', 'F', 'J', '2347', 'I', '4397', '3881']