Pop Sequence

//每次自增加1入栈，如果栈顶元素与读取的当前元素相同则出栈
//如果栈满也没有匹配当前元素则no

#include <stdio.h>
#include <stdlib.h>

typedef struct Node *Stack;
struct Node {
   
	int Data;
	struct Node *Next;
};

Stack CreateStack();
int IsEmpty(Stack stack);
void Push(int data, Stack stack);
int Pop(Stack stack);


int main() {
   
	int M, N, K;
	scanf ("%d %d %d", &M, &N, &K);
	int input[K][N];
	int analysis[K];
	int i=0;
	int j=0