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, 5, ['t', 'd', 'q', 'T', '1671', '3187', '7659', '8767', '1921', '8653', '5495', 'w', '2243', '5765', '9227', 'G', 'f', 'i', '6591', 'h', 'O', '4503', 'P', 'A', 'U', 'S', 't', 's', '6873']
1671

1, 5, ['O', 'T', 'V', '9035', 'L', 't', 'I']
9035

12, 14, ['U', '7995', '5367', '9027', '3409', 'K', 'U', '4303', 'j', '3327', '2427', '5941', '2049', 'B', 'I', 'b', 's', 'e', 'S', 'o', 'I', 'H', '6111', '529', 'H', 'd', '9283', '2439']

7990