Modular Inverse

#include<bits/stdc++.h>

using namespace std;
typedef long long int ll;
//#define isvowel(a) (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u')
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define gcd __gcd
#define getl(s) getline(cin, s);
#define setpre(x) fixed << setprecision(x)
#define mset(a) memset(a, 0, sizeof(a))
//#define endl '\n'
const int N=10000000,M=1000000007;
const ll INF=1e18+7;
ll oneline_modulor_inverse(ll a,ll b){
    return 1<a ? b-inverse(b%a,a)*b/a : 1;
}
ll binpow(ll a,ll b){
    ll res=1;
    while(b>0){
        if(b&1) res=(res*a)%M;
        a=(a*a)%M;
        b>>=1;
    }
    return res;
}
vector<ll>inverse_array(int n,int m){
    vector<ll>modu;
    modu.pb(1);
    modu.pb(1);
    for(int i=2;i<=n;++i) modu.pb(modu[m%i]*(m-m/i)%m);
    return modu;
}
int main(){
    ios_base::sync_with_stdio(NULL); cin.tie(nullptr); cout.tie(nullptr);
//    freopen(".inp","r",stdin);
//    freopen(".out","w",stdout);

    return 0;
}
/*
==================================+
INPUT:                            |
------------------------------    |
3
2 6
------------------------------    |
==================================+
OUTPUT:                           |
------------------------------    |

------------------------------    |
==================================+
*/