func_code_string: #include <bits/stdc++.h>   using namespace std;   double areaa(int x1, int x2, int x3, int y1, int y2, int y3);   int gcd(int x, int y);   int lcm(int x, int y);   int egcd(int a, int b, int& x, int& y);   vector<int> prime_possible_factors(int n);   vector<int> primes_included(int n, int m);   map<int, int> factor(int N);   bool isPrime(int N);   int charType(char c);   double areaa(int x1, int x2, int x3, int y1, int y2, int y3) {     double area = abs((x1 * (y2 - y3) + x2 * (y3 - y1) + x3 * (y1 - y2)) / 4.0);     return area;   }   int gcd(int x, int y) { return y == 0 ? x : gcd(y, x % y); }   int lcm(int x, int y) { return (x * y / gcd(x, y)); }   int egcd(int a, int b, int& x, int& y) {     if (b == 0) {       x = 1;       y = 0;       return a;     } else {       int d = egcd(b, a % b, x, y);       x -= a / b * y;       swap(x, y);       return d;     }   }   vector<int> prime_possible_factors(int n) {     bool* isPrime = new bool[n];     for (int i = 0; i < n; i++) {       isPrime[i] = true;     }     vector<int> primes;     for (int i = 2; i * i <= n; ++i) {       if (isPrime[i]) {         primes.push_back(i);         for (int j = i; j < n; j += i) isPrime[j] = false;       }     }     return primes;   }   vector<int> primes_included(int n, int m) {     bool* isPrime = new bool[m];     for (int i = 0; i < m; i++) {       isPrime[i] = true;     }     vector<int> primes;     for (int i = 2; i < m; ++i) {       if (isPrime[i]) {         if (i >= n) primes.push_back(i);         for (int j = i; j < m; j += i) isPrime[j] = false;       }     }     return primes;   }   map<int, int> factor(int N) {     vector<int> primes;     primes = primes_included(0, N);     map<int, int> factors;     for (int i = 0; i < primes.size(); ++i) {       int prime = primes[i], power = 0;       while (N % prime == 0) {         power++;         N /= prime;       }       factors[prime] = power;     }     return factors;   }   bool isPrime(int N) {     vector<int> check = prime_possible_factors(N);     for (int i = 0; i < check.size(); i++) {       if (N % check[i] == 0) {         return false;       }     }     return true;   }   int main() {     int T;     long long int n, s, t;     cin >> T;     int i = 0;     for (i; i < T; i++) {       cin >> n >> s >> t;       cout << max(n - s, n - t) + 1 << endl;     }     return 0;   }   