#include <iostream>
#include <vector>
#include <stdio.h>
using namespace std;
typedef long long llong;
pair< vector<int>, vector<int> > groups[100111];
int n,m;
int A[100111];
bool blocked[100111];
int groupID[100111];
bool firstPart[100111];

llong gcd(llong a,llong b)
{
    llong r;

    while(b != 0)
    {
        r = a % b;
        a = b;
        b = r;
    }

    return a;
}

void connect(int x,int y)
{
    if (groupID[x] == groupID[y])
    {
        if (firstPart[x] == firstPart[y])
        {
            blocked[ groupID[x] ] = true;
        }

        return;
    }

    int G1 = groupID[x];
    int G2 = groupID[y];
    int sz1 = groups[G1].first.size() + groups[G1].second.size();
    int sz2 = groups[G2].first.size() + groups[G2].second.size();
    int i;

    if (sz1 < sz2)
    {
        connect(y,x);
        return;
    }

    blocked[G1] = blocked[G1] || blocked[G2];

    if (firstPart[x] == firstPart[y])
    {
        for (i=0;i<groups[G2].first.size();i++)
        {
            groups[G1].second.push_back(groups[G2].first[i]);
            groupID[ groups[G2].first[i] ] = G1;
            firstPart[ groups[G2].first[i] ] = false;
        }
        for (i=0;i<groups[G2].second.size();i++)
        {
            groups[G1].first.push_back(groups[G2].second[i]);
            groupID[ groups[G2].second[i] ] = G1;
            firstPart[ groups[G2].second[i] ] = true;
        }
    }
    else
    {
        for (i=0;i<groups[G2].first.size();i++)
        {
            groups[G1].first.push_back(groups[G2].first[i]);
            groupID[ groups[G2].first[i] ] = G1;
            firstPart[ groups[G2].first[i] ] = true;
        }
        for (i=0;i<groups[G2].second.size();i++)
        {
            groups[G1].second.push_back(groups[G2].second[i]);
            groupID[ groups[G2].second[i] ] = G1;
            firstPart[ groups[G2].second[i] ] = false;
        }
    }

    groups[G2].first.clear();
    groups[G2].second.clear();

    return;
}

int main()
{
    //freopen("badtest.in","r",stdin);
    //freopen("ans.out","w",stdout);
    int i,j;
    int cm;
    int x,y,v;
    llong top,bot,nod;
    int ctr = 0;

    scanf("%d %d",&n,&m);

    for (i=1;i<=n;i++)
    {
        scanf("%d",&A[i]);

        groups[i].first.push_back(i);
        groupID[i] = i;
        firstPart[i] = true;
    }

    for (i=1;i<=m;i++)
    {
        scanf("%d",&cm);

        if (cm == 1)
        {
            scanf("%d %d",&x,&v);

            A[x] = v;
        }
        else if (cm == 2)
        {
            scanf("%d %d",&x,&y);

            connect(x,y);
        }
        else
        {
            ctr++;

            scanf("%d %d %d",&x,&y,&v);

            if (groupID[x] == groupID[y])
            {
                if (blocked[ groupID[x] ])
                {
                    printf("0\n");
                }
                else
                {
                    top = (llong)A[x] * (llong)v;
                    bot = (llong)A[y];
                    nod = gcd(top,bot);

                    top /= nod;
                    bot /= nod;

                    if (firstPart[x] != firstPart[y])
                        printf("-");
                    printf("%lld/%lld\n",top,bot);
                }
            }
            else
            {
                printf("0\n");
            }
        }
    }

    return 0;
}