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, 2, ['8895', 't', '5739']
8895

4, 16, ['B', 'u', 'M', 'C', '9069', '815', '2175', '6087', 'o', '115', '9559', '2365', 'Z', 'e', '277', '1889', '6181', '6895', 'm']
32351

14, 22, ['487', 'A', '3013', 'h', '2939', '179', 'J', '501', 'O', 'U', '9047', 'D', 'H', '7207', 'l', 'c', '4577', 'a', 'g', 'i', '9317', 'U', 'i', '6489', '7733', '6615', '2491', 'v', 'S']

21101