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.

2, 10, ['907', '3413', 'y', 'Y', 'y', '9671', '6631', 'g', '8803', '3127', 'k', 'Y', '413', '3871', '909', 'G', '4431', '6489', '7291', 'J', 'W', '6423', '641', 'G', '2545', '4471', '3717', '2671', '561']
31645

1, 18, ['1137', '7521', '1291', 'o', '391', '5329', 'X', '391', 'i', '6893', '8547', '9361', 'Z', 'O', '9701', '4097', '9273', '3877', '1589', '9097']
67809

2, 30, ['6505', '8735', 'y', 'l', 'z', '2527', '989', '5617', 'P', '2031', '8411', '8529', '2795', 'q', 'A', 'Q', 'a', 's', '4915', 'S', '2053', 'C', '3755', '1531', '6905', 'v', 'L', 'Z', 'v', 'c']

58793