garganshul108

#include<bits/stdc++.h>

using namespace std;

#define ll long long

void NO() { cout << "No\n"; return; }
void YES() { cout << "Yes\n"; return; }

int r, c; ll k;

garganshul108

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

int check_authentication(char* password)
{
    int auth_flag = 0;
    char password_buffer[30];
    
    strcpy(password_buffer, password);

garganshul108

#define ll long long 
#define fr(v,s,n) for(int v=s;((s<n)?v<n:v>n);((s<n)?v++:v--))
#define debug(p) cout<<#p<<' '<<p<<'\n';
#define debuga(a,i) cout<<#a<<"["<<i<<"]"<<" "<<a[i]<<"\n";
#define debugal(a) for(int v=0;v<(sizeof(a)/sizeof(a[0]));v++) cout<<#a<<"["<<v<<"]"<<" "<<a[v]<<"\n";
#define debugm(a,i,j) cout<<#a<<"["<<i<<"]["<<j<<"]"<<" "<<a[i][j]<<"\n";
#define pb push_back
#define mp make_pair
#define vii vector<pair<int,int>>
#define vi vector<int>

garganshul108

#define ll long long 
#define fr(v,s,n) for(int v=s;((s<n)?v<n:v>n);((s<n)?v++:v--))
#define debug(p) cout<<#p<<' '<<p<<'\n';
#define debuga(a,i) cout<<#a<<"["<<i<<"]"<<" "<<a[i]<<"\n";
#define debugal(a) for(int v=0;v<(sizeof(a)/sizeof(a[0]));v++) cout<<#a<<"["<<v<<"]"<<" "<<a[v]<<"\n";
#define debugm(a,i,j) cout<<#a<<"["<<i<<"]["<<j<<"]"<<" "<<a[i][j]<<"\n";
#define pb push_back
#define mp make_pair
#define vii vector<pair<int,int>>
#define vi vector<int>

garganshul108

#include<bits/stdc++.h>
#define ll long long 
#define fr(v,s,n) for(int v=s;((s<n)?v<n:v>n);((s<n)?v++:v--))
#define debug(p) cout<<#p<<' '<<p<<'\n';
#define debuga(a,i) cout<<#a<<"["<<i<<"]"<<" "<<a[i]<<"\n";
#define debugal(a) for(int v=0;v<(sizeof(a)/sizeof(a[0]));v++) cout<<#a<<"["<<v<<"]"<<" "<<a[v]<<"\n";
#define debugm(a,i,j) cout<<#a<<"["<<i<<"]["<<j<<"]"<<" "<<a[i][j]<<"\n";
using namespace std;
#define pb push_back
#define mp make_pair

garganshul108

////https://www.spoj.com/problems/JULKA/


/*
	*
	* 1. strings ko endpoint ni mil rha tha
	*	explicitly add '\0' at end of each char array like 112 => 112\0 
	* 2. index out of bound possible 
	*	garbage return hora tha
	*