lakshith-403

#include <bits/stdc++.h>

using namespace std;
#define int long long

struct Flight
{
    int start, finish, profit;
};

lakshith-403

#include <bits/stdc++.h>

using namespace std;

#define int long long
#define what_is(a) cout << #a << " is " << a << "\n"
#define checker(a) cout << "checker reached " << a << "\n"

inline void io(){
    ios_base::sync_with_stdio(false);

lakshith-403

#include <bits/stdc++.h>

using namespace std;

#define int long long 
#define what_is(a) cout << #a << " is " << a << "\n"
#define checker(a) cout << "checker reached " << a << "\n"

inline void io(){
    ios_base::sync_with_stdio(false);

lakshith-403

#include <bits/stdc++.h>

using namespace std;

#define int long long 
#define what_is(a) cout << #a << " is " << a << "\n"
#define checker(a) cout << "checker reached " << a << "\n"

inline void io(){
    ios_base::sync_with_stdio(false);

lakshith-403

#include <bits/stdc++.h>

using namespace std;

struct subset{int parent,rank;};

struct edge{int u,v,w;};

bool comp(edge a,edge b){
    return a.w < b.w;

lakshith-403

#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define f first
#define s second
#define what_is(a) cout << #a << " is " << a << "\n";
#define shit cout << "shit" << "\n";
#define pi pair<int,int>

lakshith-403

/*
Solution for full marks uses binary search
*/

#include <bits/stdc++.h>

#define ll long long
#define pb push_back
#define f first
#define s second