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.

[Q]: 2, 5, ['4487', '3761', '159', '7459', '6781', '2403', 'S', '3079', '7161']
[A]: 18160


[Q]: 1, 11, ['p', '2293', '3291', '4843', 'i', '1303', 'R', '9315', '2485', '8477', 'V', '9629', 'v', '6959', '3019']
[A]: 32007


[Q]: 10, 19, ['G', '7871', 'S', 'M', '6701', '2895', 'f', '2939', '8381', '3607', '2899', '8767', 'P', 'k', 'J', 'T', '9733', '8631', '3055', 'g', '3195', '3777', 't', '5943', 'Q', '9587', '411', 'M', 'C', '9049']
[A]:
36692