Given two strings s and t. Find the maximum number of times that one can recursively remove t from s.

**Example 1:**

s = "aabcbc"

t="abc"

Return 2.

We can first remove s[1:3] and s becomes "abc". We can then remove it all.

**Example 2:**

s = "abababaaba"

t="ababa"

Return 2.