stack

Ctrl + c, Ctrl + vStack is an ordered list of similar data type.
Stack is a LIFO(Last in First out) structure or 
we can say FILO(First in Last out).
push() function is used to insert new elements into the Stack and 
pop() function is used to remove an element from the stack. 
Both insertion and removal are allowed at only one end of Stack called 
Top. Stack is said to be in Overflow state when it is completely full 
and is said to be in Underflow state if it is completely empty.typedef struct Nodo{
   Elem val;
   struct Nodo *next;
} *Stack;
Stack Empty(){return NULL;}
bool IsEmpty(Stack a){return a==NULL;}
Elem Top(Stack a){return a->val;} 
Stack Pop(Stack l){return l->next;}
Stack Push(Elem x,Stack res){
    Stack nuevo=(Stack)malloc(sizeof(struct Nodo));
    nuevo->val=x;
    nuevo->next=res;
    return nuevo;
}` function myFunction() {
  s.getRange(3, 7, 1, 3).clear()
  var ss = SpreadsheetApp.getActiveSpreadsheet();
  var s = ss.getSheets()[0];
  s.getRange(3, 7, 1, 3).clear()
  var celda = s.getRange(3, 1).getValue()
  for (var i = 1; i < 13; i++) 
  {
    var bar = s.getRange(i, 2, 1, 3).getValues(); 
    if (celda == s.getRange(i, 2))
    {s.getRange(3, 7, 1, 3).setValues(bar);
    }
  }
}`