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, 4, ['8181', '9349', '2531', 'S', '5333', '3721', '9641']
11880

1, 9, ['6869', '4103', 'S', 'k', '6745', 'n', 'x', '7657', 'F', 'd', '1953']
25374

2, 26, ['5773', '1873', '7709', '7089', '8887', 'X', '855', 'v', 'O', 'S', 'q', '6333', '7807', '8755', '2923', 'B', '7245', '679', 'o', 's', 'v', '5573', '1667', '1487', 't', 'J', '8569', '2419']

68882