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, 18, ['1137', '7521', '1291', 'o', '391', '5329', 'X', '391', 'i', '6893', '8547', '9361', 'Z', 'O', '9701', '4097', '9273', '3877', '1589', '9097']
67809

11, 11, ['1049', 'a', '7521', 'f', 'Z', '2973', '7245', 'e', '1807', 'e', '1325', '7327', 'r']
1325

5, 11, ['8731', 'N', 'D', '3773', 'R', 'v', 'n', 'c', 'M', '5653', '5101', 'W', '143', 'q', '5541', '7841', '8515', 'g', '6107']

10754