#include <map>

#include <set>

#include <list>

#include <cmath>

#include <ctime>

#include <deque>

#include <stack>

#include <queue>

#include <cctype>

#include <cstdio>

#include <string>

#include <vector>

#include <climits>

#include <cstdlib>

#include <cstring>

#include <iostream>

#include <algorithm>

#define LL long long

#define PI 3.1415926535897932626

using namespace std;

int gcd(int a, int b) {return a % b ==  ? b : gcd(b, a % b);}

#define MAXN 6066010

int p[MAXN];

int Find(int x) { return x == p[x] ? x : p[x] = Find(p[x]);}

char op;

char res[];

int src,des,nnn,srcstep,desstep;

int read(char *res)

{

    int cnt = , cas = ;

    for (int i = ; i < strlen(res); i++)

        if (res[i] != ' ' && res[i - ] == ' ') cnt++;

    return cnt;

}

int main()

{

    while (gets(res))

    {

        op = tolower(res[]);

        int N;

        if (op == 'd') {sscanf(res,"%*s %d",&N);for (int i = ; i <= N; i++)  p[i] = i; continue;}

        int cnt = read(res);

        if (cnt == )

        {

            sscanf(res,"%*s %d %d",&src,&des);

            nnn = ;

            srcstep = ; desstep = 0;

        }

        if (cnt == )

        {

            sscanf(res,"%*s %d %d %d",&src,&des,&nnn);

            srcstep = ;

            desstep = ;

        }

        if (cnt == )

        {

            sscanf(res,"%*s %d %d %d %d",&src,&des,&nnn,&desstep);

            srcstep = ;

        }

        if (cnt == )

        {

            sscanf(res,"%*s %d %d %d %d %d",&src,&des,&nnn,&desstep,&srcstep);

        }

        if (op == 'c'){

            if (srcstep ==  && desstep==)nnn=;

            for (int i = src , j = des, k = ; k < nnn; i += srcstep,j += desstep,k++)

            {

                int  x = Find(i) , y = Find(j);

                 p[y] = x;

            }

        }

        else

        {

            int ansl =  ,ansr = ;

            for (int i = src , j = des, k = ; k < nnn; i += srcstep,j += desstep,k++)

            {

                int  x = Find(i) , y = Find(j);

                if (x != y) ansr++;

                else ansl++;

            }

            printf("%d - %d\n",ansl,ansr);

        }

    }

    return ;

}