1Bkop0 - Online IDE & Debugging Tool

#include <bits/stdc++.h>
#define ll long long
using namespace std;

const ll MOD = 1e9 + 7;
ll addd(ll a, ll b) { return ((a % MOD) + (b % MOD)) % MOD; }
ll mul(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
ll sub(ll a, ll b) { return (((a - b) % MOD) + MOD) % MOD; }
ll modExp(ll a, ll b) {
  if (b <= 0)
    return 1;
  ll ret = modExp(a * a % MOD, b / 2);
  if (b % 2)
    ret = ret * a % MOD;
  return ret;
}
ll inverse(ll b) { return modExp(b, MOD - 2); }
ll divv(ll a, ll b) { return ((a % MOD) * (inverse(b) % MOD)) % MOD; }


//prod st


#define int long long
struct SegmentTreeP { // 0-Indexed
    vector<int> tree;
    int skip = 1; // depentent on merge (sum => 0, min => OO, max => -OO)
    int sz;

#define mid ((r + l) >> 1)
#define L node * 2 + 1
#define R node * 2 + 2

    int merge(int a, int b){
        return mul(a,b);
    }

    int build(int l, int r, int node, vector<int> &a){
        if(l == r){
            if(l < (int)a.size()) return (tree[node] = a[l]);
            return skip;
        }
        return tree[node] = merge(build(l, mid, L, a), build(mid + 1, r, R, a));
    }

    int update(int l, int r, int node, int idx, int val){
        if(l == r) return tree[node] = val;
        if(idx <= mid) return tree[node] = merge(update(l, mid, L, idx, val), tree[R]);
        else return tree[node] = merge(tree[L], update(mid + 1, r, R, idx, val));
    }
    int add(int l, int r, int node, int idx, int val){
        if(l == r) return tree[node] += val;
        if(idx <= mid) return tree[node] = merge(add(l, mid, L, idx, val), tree[R]);
        else return tree[node] = merge(tree[L], add(mid + 1, r, R, idx, val));
    }

    int query(int l, int r, int node, int tl, int tr){
        if(tl > r || tr < l) return skip;
        if(l >= tl && r <= tr) return tree[node];
        return merge(query(l, mid, L, tl, tr), query(mid + 1, r, R, tl, tr));
    }

    SegmentTreeP(vector <int> &a){
        int n = (int)a.size(); sz = 1;
        while(sz <= n) sz *= 2;
        tree = vector <int> (2 * sz, skip);
        build(0, sz - 1, 0, a);
    }

    SegmentTreeP(int n){
        sz = 1;
        while(sz <= n) sz *= 2;
        tree = vector <int> (2 * sz, skip);
    }

    void update(int idx, int val){ update(0, sz - 1, 0, idx, val); }
    void add(int idx, int val){ add(0, sz - 1, 0, idx, val); }
    int query(int l, int r){  return query(0, sz - 1, 0, l, r); }

#undef R
#undef L
#undef mid
};
#undef int


//sum st

#define int long long
struct SegmentTreeS { // 0-Indexed
    vector<int> tree;
    int skip = 0; // depentent on merge (sum => 0, min => OO, max => -OO)
    int sz;

#define mid ((r + l) >> 1)
#define L node * 2 + 1
#define R node * 2 + 2

    int merge(int a, int b){
        return addd(a,b);
    }

    int build(int l, int r, int node, vector<int> &a){
        if(l == r){
            if(l < (int)a.size()) return (tree[node] = a[l]);
            return skip;
        }
        return tree[node] = merge(build(l, mid, L, a), build(mid + 1, r, R, a));
    }

    int update(int l, int r, int node, int idx, int val){
        if(l == r) return tree[node] = val;
        if(idx <= mid) return tree[node] = merge(update(l, mid, L, idx, val), tree[R]);
        else return tree[node] = merge(tree[L], update(mid + 1, r, R, idx, val));
    }
    int add(int l, int r, int node, int idx, int val){
        if(l == r) return tree[node] += val;
        if(idx <= mid) return tree[node] = merge(add(l, mid, L, idx, val), tree[R]);
        else return tree[node] = merge(tree[L], add(mid + 1, r, R, idx, val));
    }

    int query(int l, int r, int node, int tl, int tr){
        if(tl > r || tr < l) return skip;
        if(l >= tl && r <= tr) return tree[node];
        return merge(query(l, mid, L, tl, tr), query(mid + 1, r, R, tl, tr));
    }

    SegmentTreeS(vector <int> &a){
        int n = (int)a.size(); sz = 1;
        while(sz <= n) sz *= 2;
        tree = vector <int> (2 * sz, skip);
        build(0, sz - 1, 0, a);
    }

    SegmentTreeS(int n){
        sz = 1;
        while(sz <= n) sz *= 2;
        tree = vector <int> (2 * sz, skip);
    }

    void update(int idx, int val){ update(0, sz - 1, 0, idx, val); }
    void add(int idx, int val){ add(0, sz - 1, 0, idx, val); }
    int query(int l, int r){  return query(0, sz - 1, 0, l, r); }

#undef R
#undef L
#undef mid
};
#undef int


ll power(ll b,ll n)
    {
        b%=MOD;
        ll s=1;
        while(n)
        {
            if(n%2==1)s=s*b%MOD;
            b=b*b%MOD;
            n/=2;
        }
        return s;
    }
void solve() {
  ll n;
  cin >> n;
  vector<ll> v(n);
  ll q;
  cin >> q;
  vector<ll> summ(n);

  for (ll i = 0; i < n; i++){
    cin >> v[i];
    summ[i]=divv(divv(v[i],100),divv(100-v[i],100));
    v[i]=divv(100-v[i],100);
  }
  SegmentTreeP sp(v);
  SegmentTreeS ss(summ);
  while (q--) {
    ll t;
    cin >> t;
    if (t == 1) {
      ll ind,val;
      cin >> ind>>val;
      sp.update(ind-1,divv(100-val,100));
      ss.update(ind-1,divv(divv(val,100),divv(100-val,100)));
    }
    else{
        ll ind;
        cin >> ind;
        //product + product*sum
        ll f=sp.query(ind,n-1);
        ll s=ss.query(ind,n-1);
        cout << addd(f,(mul(f,s)))<<endl;
    }
  }
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ll t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}