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.

16, 22, ['F', '197', '9799', 'W', '9967', 'V', '9955', '5143', 't', 'f', '749', 'N', 'b', '8049', 'W', '6835', '8007', 'm', '7233', 'B', 'I', '599', '6101', 'G', 'i', '2271', 'h', 'P']
22674

1, 2, ['8895', 't', '5739']
8895

12, 14, ['Q', 'n', '5371', '4313', '6717', '8175', '3631', 'z', 'D', '5873', '4223', '931', 'c', '8981', 'r', 'K', '1445', '7685', 'x', 'i', 's', 'c', '6523']

9912