Accolite Digital Solution

# cook your dish here
from sys import stdin
input = lambda : stdin.readline().strip()
from math import ceil,sqrt,factorial,gcd
from collections import deque
from bisect import bisect_left
def beauty(n,m,s,x,y):
    degree=[0 for i in range(n)]
    graph={i:[] for i in range(n)}
    for i in range(m):
        x[i]-=1
        y[i]-=1
        graph[x[i]].append(y[i])
        degree[y[i]]+=1
    q=deque()
    for i in range(n):
        if degree[i]==0:
            q.append(i)
        count=0
        ans=0
        dp=[[0 for i in range(26)]for i in range(n)]
    while count