1051. Pop Sequence (25)

#include<iostream>
#include<stack>
#include<string>
using namespace std;
int main()
{
int M, N, K;
cin >> M >> N >> K;
string str;
while (K--)
{
stack<int> sta;
int i = 1;
for (int t = 0;t < N;t++)
{

int temp;
cin >> temp;
while ((sta.empty()|| sta.top() != temp) && i <= N) sta.push(i++);
if (sta.top() == temp && sta.size()<=M) sta.pop();
else {
cout << "NO" << endl;getline(cin, str);break;
}
if (t == N - 1) { cout << "YES" << endl;break; }
}
}
}