...Once upon a time a man came to the sea. The sea was stormy and dark. The man started to call for the little mermaid to appear but alas, he only woke up Cthulhu...

Whereas on the other end of the world Pentagon is actively collecting information trying to predict the monster's behavior and preparing the secret super weapon. Due to high seismic activity and poor weather conditions the satellites haven't yet been able to make clear shots of the monster. The analysis of the first shot resulted in an undirected graph with n vertices and m edges. Now the world's best minds are about to determine whether this graph can be regarded as Cthulhu or not.

To add simplicity, let's suppose that Cthulhu looks from the space like some spherical body with tentacles attached to it. Formally, we shall regard as Cthulhu such an undirected graph that can be represented as a set of three or more rooted trees, whose roots are connected by a simple cycle.

It is guaranteed that the graph contains no multiple edges and self-loops.

<image>

Input

The first line contains two integers — the number of vertices n and the number of edges m of the graph (1 ≤ n ≤ 100, 0 ≤ m ≤ <image>).

Each of the following m lines contains a pair of integers x and y, that show that an edge exists between vertices x and y (1 ≤ x, y ≤ n, x ≠ y). For each pair of vertices there will be at most one edge between them, no edge connects a vertex to itself.

Output

Print "NO", if the graph is not Cthulhu and "FHTAGN!" if it is.

Examples

Input

6 6
6 3
6 4
5 1
2 5
1 4
5 4


Output

FHTAGN!

Input

6 5
5 6
4 6
3 1
5 1
1 2


Output

NO

Note

Let us denote as a simple cycle a set of v vertices that can be numbered so that the edges will only exist between vertices number 1 and 2, 2 and 3, ..., v - 1 and v, v and 1.

A tree is a connected undirected graph consisting of n vertices and n - 1 edges (n > 0).

A rooted tree is a tree where one vertex is selected to be the root.

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.*;


 
 
public class ck {

	private static InputStream stream;
	private static PrintWriter pw;
	
	
	
//	static int a;
//	static int b;
//	static int f = 0;
	static int n;
	static int m;
//	static int prob[];
//	static int dp[];
	
//	static int x1;
//	static int x2;
//	static int y1;
//	static int y2;
	
//	static int[][] dir = {{1,0},{0,1},{-1,0},{0,-1}};
//	static ArrayList<Integer> ans;
//	static int m;
//	static int arr[][];
//	static int arr[];
//	static char[][] arr;
	static int[] visited;

	
	static ArrayList<Integer> arr[];

	
	public static void main(String[] args) throws NumberFormatException, IOException{
		//InputReader(System.in);
		//pw = new PrintWriter(System.out);
		
		Scanner in = new Scanner(System.in);
		
		n = in.nextInt();
		m = in.nextInt();
		in.nextLine();
		
		arr = new ArrayList[n];
		visited = new int[n];
		
		for(int i = 0;i<n;i++){
			arr[i] = new ArrayList();
		}
		
		for(int i = 0;i<m;i++){
			int a = in.nextInt()-1;
			int b = in.nextInt()-1;
			arr[a].add(b);
			arr[b].add(a);
		}
		
		
		dfs(0);
		int f =0;
		for(int i = 0;i<n;i++){
			if(visited[i] == 0){
				f = 1;
				break;
			}
		}
	//	System.out.println(f + " " + n+ " " +m);
		if(f == 1){
			System.out.println("NO");
		}else if( f == 0 && n == m){
			System.out.println("FHTAGN!");
		}else if(f == 0 && m != n){
			System.out.println("NO");
		}
		

}

	public static void dfs(int i){
		if(visited[i] == 1){
			return;
		}
		visited[i] = 1;
		//System.out.println(i);
		
		for(int j = 0;j<arr[i].size();j++){
			if(arr[i].get(j)!=i)
			dfs(arr[i].get(j));
		}
	}
	
	
	
	public static void InputReader(InputStream stream1) {
		stream = stream1;
	}
	
//	public static void bfs(int s){
//		
//	
//		if(visited[s] == 1){
//			return;
//		}
//		c++;
//		visited[s] = 1;
//		Queue<Integer> q=new LinkedList<Integer>();
//    	q.add(s);
//  
//    	while(!q.isEmpty()){
//    		int top=q.poll();
//    		v++;
//    		Iterator<Integer> i= adj[top].listIterator();
//    		while(i.hasNext()){
//    			int n=i.next();
//    			if(visited[n] == 0){
//    				q.add(n);
//    				visited[n]=1;
//    				
//    			}
//    		}
//    	}
//		
//		
//	}
//	
//	
//	
//	public static void dfs(int i,int j){
//		System.out.println(i + " " + j + " " + arr[i][j]);
//		if(i == x2 && j == y2 && arr[i][j] == 'X'){
//			f = 1;
//			return;
//		}else if(i == x2 && j == y2){
//			
//			for(int p = 0;p<4;p++){
//				int t1 = i + dir[p][0];
//				int t2 = j + dir[p][1];
//				
//				i =t1;j =t2;
//				
//				
//				if(i < 0 || i >=n || j < 0 || j >= m){
//					// fooled you/...
//				}else if(arr[t1][t2] == '.'){
//					System.out.println(i + " " + j+ " " + " insisis" + " " + arr[i][j]);	
//					f = 1;
//					return;
//				}
//			}
//			
//			return;
//		}else if(arr[i][j] == 'X' && i != x1 && j != y1){
//			return;
//		}else if(arr[i][j] == 'X' && i == x1 && j == y1){
//			for(int p = 0;p<4;p++){
//				int t1 = i + dir[p][0];
//				int t2 = j + dir[p][1];
//				i =t1;j =t2;
//				if(i < 0 || i >=n || j < 0 || j >= m){
//					// fooled you/...
//				}else if(arr[t1][t2] == '.'){
//					dfs(t1,t2);
//				}
//			}
//			
//		}
//		
//		int t1 = i;
//		int t2 = j;
////		if(t1 == 3 && t2 == 4){
////			System.out.println(i + " " + j + " inside");
////		}
////		
//		for(int k = 0;k<4;k++){
//		
//			i = t1 + dir[k][0];
//			j = t2 + dir[k][1];
//			
//			if(t1 == 0 && t2 == 6){
//				System.out.println(i + " " + j + " inside");
//			}
//			
//			if(i < 0 || i >=n || j < 0 || j >= m){
//				// fooled you/...
//			}else if(arr[i][j] == '.'){
//				arr[t1][t2] = 'X';
//				dfs(i,j);
//			}else if(i == x2 & j == y2 && arr[i][j] == 'X'){
//				dfs(i,j);
//			}
//		}
//		
//		
//		
//		
//	}
	
	
	
	
	public static boolean isPrime(int n) {
		// Corner cases
		if (n <= 1)
			return false;
		if (n <= 3)
			return true;
 
		// This is checked so that we can skip 
		// middle five numbers in below loop
		if (n % 2 == 0 || n % 3 == 0)
			return false;
 
		for (int i = 5; i * i <= n; i = i + 6)
			if (n % i == 0 || n % (i + 2) == 0)
				return false;
 
		return true;
	}
	
	
	
	public static void Range(int[] numbers, int target) {
	    if (numbers == null)
	        return;

	    int low = 0, high = numbers.length - 1;
	    // get the start index of target number
	    int startIndex = -1;
	    while (low <= high) {
	        int mid = (high - low) / 2 + low;
	        if (numbers[mid] > target) {
	            high = mid - 1;
	        } else if (numbers[mid] == target) {
	            startIndex = mid;
	            high = mid - 1;
	        } else
	            low = mid + 1;
	    }

	    // get the end index of target number
	    int endIndex = -1;
	    low = 0;
	    high = numbers.length - 1;
	    while (low <= high) {
	        int mid = (high - low) / 2 + low;
	        if (numbers[mid] > target) {
	            high = mid - 1;
	        } else if (numbers[mid] == target) {
	            endIndex = mid;
	            low = mid + 1;
	        } else
	            low = mid + 1;
	    }

	    if (startIndex != -1 && endIndex != -1){
	        for(int i=0; i+startIndex<=endIndex;i++){
	            if(i>0)
	                System.out.print(',');
	            System.out.print(i+startIndex);
	        }
	    }
	}
	
	 // union code starts	
	
	 private static void initialize( int Arr[ ],int size[], int N)
	    {
	        for(int i = 0;i<N;i++)
	        {
	        	Arr[ i ] = i ;
	        	size[ i ] = 1;
	        }
	    }
	 
	 private static int root(int Arr[ ],int i)
	    {
	        while(Arr[ i ] != i)           //chase parent of current element until it reaches root
	        {
	            Arr[ i ] = Arr[ Arr[ i ] ] ; 
	            i = Arr[ i ];
	        }
	        return i;
	    }
	 
	 private static void union(int Arr[ ],int size[ ],int A,int B)
	    {
	        int root_A = root(Arr,A);
	        int root_B = root(Arr,B);
	     
	        if(root_A != root_B){
	        	 if(size[root_A] < size[root_B ])
	 	        {
	        		 Arr[ root_A ] = Arr[root_B];
	        		 size[root_B] += size[root_A];	 	
	 	        }
	 	        else
	 	        {   	
	 	        	Arr[ root_B ] = Arr[root_A];
	 	        	size[root_A] += size[root_B];	 	   
	 	        }	
	        }
	    }
	 
	 private static boolean find(int Arr[],int A,int B)
	    {
	        if( root(Arr,A)==root(Arr,B) )       //if A and B have the same root, it means that they are connected.
	        return true;
	        else
	        return false;
	    }
	 
	 
	 // union code ends
	
	
	 
//	 // Segment tree code begins
//	 
//	 
//	 static void build(int node,int start,int end)
//	 {
//	 if(start==end)
//	 tree[node]=a[start];
//	 else
//	 {
//	 int mid=(start+end)/2;
//	 build(2*node,start,mid);
//	 build(2*node+1,mid+1,end);
//	 if(tree[2*node]<tree[2*node+1])
//	 tree[node]=tree[2*node];
//	 else
//	 tree[node]=tree[2*node+1];
//	 }
//	 }
//	 
//	 
//	 static void update(int node,int start,int end,int idx,int val)
//	 {
//	 if(start==end)
//	 {
//	 a[idx]=val;
//	 tree[node]=val;
//	 }
//	 else
//	 {
//	 int mid=(start+end)/2;
//	 if(idx>=start&&idx<=mid)
//	 update(2*node,start,mid,idx,val);
//	 else
//	 update(2*node+1,mid+1,end,idx,val);
//	 if(tree[2*node]<tree[2*node+1])
//	 tree[node]=tree[2*node];
//	 else
//	 tree[node]=tree[2*node+1];
//	 }
//	 }
//	 
//	 static int query(int node,int start,int end,int l,int r)
//	 {
//	 if(l>end||start>r)
//	 return 100005;
//	 if(l<=start&&r>=end)
//	 return tree[node];
//	 int p1,p2;
//	 int mid=(start+end)/2;
//	 p1=query(2*node,start,mid,l,r);
//	 p2=query(2*node+1,mid+1,end,l,r);
//	 if(p1<p2)
//	 return p1;
//	 else
//	 return p2;
//	 }
//	 
//	 
//	 
//}

}

class Node{
	int a;
	int b;
}


class MyComp2 implements Comparator<Node>{
    
	@Override
	public int compare(Node o1, Node o2) {
		if(o1.b>o2.b){
			return 1;
		}else if(o1.b<o2.b){
			return -1;
		}else{
			return 0;
			
			
		}
		
		
	}
}
