Substitution for Landau's O notation formula

Question

　I found the following description when I was reading a paper on computational complexity theory.

This can be done ... in time 2ⁿ･poly(logs,n)+2^O(logs)c. For s≤2^no(1), the runtime is 2ⁿ･poly(n).

I know this means substituting s≤2^no(1) for 2ⁿ･poly(logs,n)+2^O(logs)c results in 2ⁿ･poly(n), but I don't know how this is done. So please tell me the calculation process.