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, 6, ['c', '7209', 'z', 'P', '2137', '2809', '6591', '269', 'd', 'y', 'e', 'j', '7945', '7639', '1971', 'Y', 'h', '513', 'z', '9873', 'Y', '4991', '8085', '3531', '457']