#include<cstdio>
const int N=1e5+9;
int L[17][N],R[17][N],n,t,q,X[N],ans;
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;++i)scanf("%d",X+i);
	scanf("%d",&t);
	for(int i=1,it=1;i<=n;++i){
		while(it<n&&X[it+1]-X[i]<=t)++it;
		R[0][i]=it;
	}
	for(int i=n,it=n;i;--i){
		while(it>1&&X[i]-X[it-1]<=t)--it;
		L[0][i]=it;
	}
	for(int i=1;i<17;++i)
	for(int j=1;j<=n;++j)
	R[i][j]=R[i-1][R[i-1][j]],L[i][j]=L[i-1][L[i-1][j]];
	for(scanf("%d",&q);q--;printf("%d\n",ans)){
		int x,y;ans=1;
		scanf("%d%d",&x,&y);
		if(x<=y){
			for(int i=16;~i;--i)
			if(R[i][x]<y)ans+=1<<i,x=R[i][x];
		}else{
			for(int i=16;~i;--i)
			if(L[i][x]>y)ans+=1<<i,x=L[i][x];
		}
	}
	return 0;
}
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
#include <cstring>
using namespace std;
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, 0, sizeof(mat))
typedef long long ll;

int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, k;
  while(cin>>n>>k,n||k) {
    int cost[n][n]; FOR(i,0,n) FOR(j,0,n) cost[i][j] = 1e9;
    FOR(i,0,k) {
      int x; cin >> x;
      if(x == 0) {
        int d[n]; FOR(i,0,n) d[i] = 1e9;
        bool used[n]; CLR(used);
        // ??????????????????
        int a, b; cin >> a >> b;
        a--;b--;
        d[a] = 0;
        while(1) {
          int v = -1;
          for(int u = 0; u < n; u++) {
            if(!used[u] && (v == -1 || d[u] < d[v])) v = u;
          }
          if(v == -1) break;
          used[v] = true;
          for(int u = 0; u < n; u++) {
            d[u] = min(d[u], d[v] + cost[v][u]);
          }
        }
        if(d[b] >= 1e9) d[b] = -1;
        cout << d[b] << endl;
      } else {
        int c, d, e; cin >> c >> d >> e;
        c--;d--;
        cost[c][d] = min(cost[c][d], e);
        cost[d][c] = min(cost[d][c], e);
      }
    }
  }
  return 0;
}