#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
#ifdef local
void CHECK();
void setio(){
freopen("/Users/iantsai/cpp/input.txt","r",stdin);
freopen("/Users/iantsai/cpp/output.txt","w",stdout);
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
#define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
const int mxn = 5e4+5;
int n, m, q, cnt, v[mxn];
vector<tuple<int,int,int>>edges;
struct segtree{
int seg[4*mxn];
void build(int l, int r, int id){
if(l==r){
seg[id] = v[l];
return ;
}
int mm = l+r>>1;
build(l, mm, id*2);
build(mm+1, r, id*2+1);
seg[id] = min(seg[id*2], seg[id*2+1]);
}
void modify(int l,int r,int id,int p,int v){
if(l==r){
seg[id] = v;
return ;
}
int mm = l+r>>1;
if(p<=mm){
modify(l,mm,id*2,p,v);
}
else{
modify(mm+1,r,id*2+1,p,v);
}
seg[id]=min(seg[id*2],seg[id*2+1]);
}
int query(int l,int r,int id,int ql,int qr){
if(r<ql or qr<l){
return 1e18;
}
if(ql<=l and r<=qr){
return seg[id];
}
int mm=l+r>>1;
return min(query(l,mm,id*2,ql,qr),query(mm+1,r,id*2+1,ql,qr));
}
}tr;
signed main(){
TOI_is_so_de;
cin >> n >> m;
for(int i=1;i<=m;i++){
int a, b, c;
cin >> a >> b >> c;
edges.pb({a, b, c});
v[i] = c;
}
if(n==1){
cin>>q;
while(q--){
int ty;
cin>>ty;
if(ty==2){
int x,y;
cin>>x>>y;
cout<<1<<'\n';
}
}
return 0;
}
tr.build(1,n-1,1);
cin >> q;
while(q--){
int ty;
cin >> ty;
if(ty == 1){
int x, y;
cin >> x >> y;
//auto &[v, u, pw] = edges[x-1];
tr.modify(1,n-1,1,x,y);
}
else{
int p,w;
cin>>p>>w;
int l=1,r=p;
while(l<r){
int mm=l+r>>1;
if(tr.query(1,n-1,1,mm,p-1)>=w){
r=mm;
}
else{
l=mm+1;
}
}
int ans = -l;
l=p,r=n;
while(l<r){
int mm=l+r+1>>1;
if(tr.query(1,n-1,1,p,mm-1)>=w){
l=mm;
}
else{
r=mm-1;
}
}
ans+=l+1;
cout<<ans<<'\n';
}
}
#ifdef local
CHECK();
#endif
}
/*
input:
*/
#ifdef local
void CHECK(){
cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
function<bool(string,string)> compareFiles = [](string p1, string p2)->bool {
std::ifstream file1(p1);
std::ifstream file2(p2);
if (!file1.is_open() || !file2.is_open())return false;
std::string line1, line2;
while (getline(file1, line1) && getline(file2, line2)) {
if (line1 != line2)return false;
}
int cnta=0,cntb=0;
while(getline(file1,line1))cnta++;
while(getline(file2,line2))cntb++;
return cntb-cnta<=1;
};
bool check = compareFiles("output.txt","expected.txt");
if (check) cerr<<"ACCEPTED\n";
else cerr<<"WRONG ANSWER!\n";
}
#else
#endif
