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, 22, ['l', '161', 'c', '2421', '7447', 'C', '5305', 'R', '2083', '7227', 'y', '7103', 'l', '1765', 'I', '1133', '4381', '489', 'y', 'z', 'N', '8015', '4775', '7887', 'e', '839']