int n, m;
    cin >> n >> m;

    vector<pair<int,int> > edges;
    for(int i = 0; i < m; i++){
        int u, v;
        cin >> u >> v;
        if(u > v) swap(u, v);
        edges.pb({u, v});
    }
    sort(all(edges));

    vector<pair<int,int> > second;
    for(int i = 0; i < m; i++){
        int u, v;
        cin >> u >> v;
        if(u > v) swap(u, v);
        second.pb({u, v});
    }
    sort(all(second));

    vector<int> ar(n);
    for(int i = 0; i < n; i++)
        ar[i] = i;

    vector<int> br{3, 2, 1, 0, 4};

    do{
        vector<pair<int,int> > temp;
        for(auto c: edges){
            int u = ar[c.first];
            int v = ar[c.second];
            if(u > v) swap(u, v);
            temp.pb({ar[c.first], ar[c.second]});
        }
        sort(all(temp));
        if(temp == second){
            cout <<"ashe"<<endl;
        }

    }while(next_permutation(all(ar)));