Text this: Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth