7-1 堆栈操作合法性 (20分)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<stdlib.h>
using namespace std;
int main()
{
    int N,M;
    cin>>N>>M;
    char stack[100];
    for(int i=0;i<N;i++)
    {
        scanf("%s", stack);
        int l = 0, len = strlen(stack), flag = 1;
        for(int j=0; j<len; j++)
        {
            if(stack[j]=='S')
                l++;
            else
                l--;
            if(l < 0 || l > M)
            {
            cout<<"NO"<<endl;
            flag = 0;
            break;
            }
        }
        if(flag == 1){
            if(l == 0)
                cout<<"YES"<<endl;
            else
                cout<<"NO"<<endl;   
        }  
        
}      
}