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, 20, ['d', 'M', '9429', '2817', '2209', '3189', '9577', 'B', '1639', 'Y', 'L', '5091', 'h', 'k', 'c', 'G', '1327', '9365', '8743', 'd', '2067', 'x', '6225', '7091', '3907', '949', 'R', 'i', 'p']