from collections import Counter

def permutation_inclusion(pattern, text):
    m = len(pattern)
    if m == 0:
        return True
    need, window = Counter(pattern), {}
    for right, char in enumerate(text):
        window[char] = window.get(char, 0) + 1
        if right >= m:
            old = text[right - m]
            window[old] -= 1
            if window[old] == 0:
                del window[old]
        if right + 1 >= m and window == need:
            return True
    return False