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.
11, 13, ['L', '6235', '7211', 'G', 'A', '2255', '1443', '9559', 'j', 'F', 'L', '919', '7831', '7407', 'o', '6591', '4829', 'z', 'o', 'u', '5975', 'F', '9219', '775', '5279']