sturgle

#include <iostream>
#include <vector>
using namespace std;

struct ListNode {
  vector<int> vec;
  ListNode *next;

  ListNode() : next(NULL) {};
  ListNode(int start, int end) : next(NULL) {

sturgle

#include <iostream>
#include <stack>
using namespace std;

struct TreeNode {
  int val;
  TreeNode *left;
  TreeNode *right;
  TreeNode(int _val) : val(_val), left(NULL), right(NULL) {};
};

sturgle

#include <iostream>
#include <sstream>
using namespace std;

// ******************** m reader mocker *********************

string inputstr;

void initInputStr() {
    string line;

sturgle

#include <vector>
#include <algorithm>
using namespace std;
 
struct Road {
    int start;
    int end;
    int val;
};
 

sturgle

#include <vector>
#include <stack>
#include <iostream>
using namespace std;

struct ListNode {
    int val;
    ListNode *left;
    ListNode *right;
    ListNode(int _val) : val(_val), left(NULL), right(NULL) {}  

sturgle

/*
    by cpcs
*/
#include <cstdio>
#include <vector>
#include <map>
#include <algorithm>

using namespace std;

sturgle

//248_next_min_number.cpp
// by cydu

#include <iostream>
#include <set>
#include <vector>
#include <string>
#include <sstream>
#include <algorithm>

sturgle

#include <iostream>
#include <vector>
#include <string>
using namespace std;

/*
Small data test pass
*/
typedef long long llong;

sturgle

/*
f[i][n] = f[i-1][n-1]*C(n,1) + f[i-1][n02]*C(n,2) + ... + f[i-1][i-1] * C(n, n-(i-1));
*/

#include <iostream>
#include <vector>
using namespace std;

int base = 1000000007;
typedef long long llong;

sturgle

#include <vector>
#include <map>
#include <utility>
#include <iostream>

using namespace std;

class ExMap {
    map<int, int> _map; // key to index of _keyVals
    vector<pair<int,int>> _keyVals;