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, ['O', 'T', 'V', '9035', 'L', 't', 'I']
9035

16, 17, ['5985', '1925', 'r', 'H', 'p', 'L', '5019', 'y', 'O', '6575', '9729', 'S', '2497', '43', 'u', '317', 'p', '3043', '3247', 'z', 'O', '8379', '7715', '8399']
317

3, 15, ['B', '1727', '1745', 'D', 'L', 'D', '9189', '5603', 'y', 'I', '5489', '6081', 'W', 'n', '3873', '7301', 'b', 'r', '1745', 'k', 'C', 'M', 'Z', '5173', 'U', '3965', '1211', '8489']

31980