Let <code>d[x]</code> be the distance of the next obstacle after <code>x</code>.

For each query of type 2, we just need to check if <code>max(d[0], d[1], d[2], …d[x - sz]) > sz</code>.

Use segment tree to maintain <code>d[x]</code>.