Problem:
Problem G: Dominating Set

What you have in your hands is a map of Aizu-Wakamatsu City. The lines on this map represent streets and the dots are street corners. Lion Dor Company is going to build food stores at some street corners where people can go to buy food. It is unnecessary and expensive to build a food store on every corner. Their plan is to build the food stores so that people could get food either right there on the corner where they live, or at the very most, have to walk down only one street to find a corner where there was a food store. Now, all they have to do is figure out where to put the food store.

The problem can be simplified as follows. Let G = (V, E) be unweighted undirected graph. A dominating set D of G is a subset of V such that every vertex in V - D is adjacent to at least one vertex in D. A minimum dominating set is a dominating set of minimum number of vertices for G. In the example graph given below, the black vertices are the members of the minimum dominating sets.

Design and implement an algorithm for the minimum domminating set problem.

Input

Input has several test cases. Each test case consists of the number of nodes n and the number of edges m in the first line. In the following m lines, edges are given by a pair of nodes connected by the edge. The graph nodess are named with the numbers 0, 1,..., n - 1 respectively.

The input terminate with a line containing two 0. The number of test cases is less than 20.

Constrants

n ≤ 30

m ≤ 50

Output

Output the size of minimum dominating set for each test case.

Sample Input

5 4
0 1
0 4
1 2
3 4
5 4
0 1
0 4
1 2
3 4
0 0

Output for the Sample Input

2
2

Solution in C# (judge verdict: Time Limit Exceeded)

using System;
using System.Collections.Generic;
using System.Text;

class TEST{
	static void Main(){
		while(true){
			var d=Array.ConvertAll(Console.ReadLine().Split(' '),elem=>int.Parse(elem));
			if(d[0]==0 && d[1]==0)break;
			Sol mySol=new Sol(d);
			Console.WriteLine(mySol.Ans);
		}
	}
}


struct Mark{
	public uint state;
	public uint route;
	public int rem(){
		uint i=state;
		
		i=(i&0x55555555)+((i>>1)&0x55555555);
		i=(i&0x33333333)+((i>>2)&0x33333333);
		i=(i&0x0F0F0F0F)+((i>>4)&0x0F0F0F0F);
		i=(i&0x00FF00FF)+((i>>8)&0x00FF00FF);
		i=(i&0x0000FFFF)+((i>>16)&0x0000FFFF);
		
		return (int)i;
		
	}
	public int depth(){
		uint i=route;
		
		i=(i&0x55555555)+((i>>1)&0x55555555);
		i=(i&0x33333333)+((i>>2)&0x33333333);
		i=(i&0x0F0F0F0F)+((i>>4)&0x0F0F0F0F);
		i=(i&0x00FF00FF)+((i>>8)&0x00FF00FF);
		i=(i&0x0000FFFF)+((i>>16)&0x0000FFFF);
		
		return (int)i;
	}
}


class Sol{
	int ans;
	public int Ans{
		get{return ans;}
	}
	int n;
	int e;
	bool[,] ARR_ADJ;
	public Sol(int[] d){
		n=d[0];
		e=d[1];
		ARR_ADJ=new bool[n,n];
		for(int i=0;i<n;i++)for(int j=0;j<n;j++)ARR_ADJ[i,j]=false;
		for(int i=0;i<n;i++)ARR_ADJ[i,i]=true;
		
		for(int i=0;i<e;i++){
			var arr=Array.ConvertAll(Console.ReadLine().Split(' '),elem=>int.Parse(elem));
			ARR_ADJ[arr[0],arr[1]]=ARR_ADJ[arr[1],arr[0]]=true;
		}
		Mark INI;
		INI.route=0;
		INI.state=0;
		for(int i=0;i<n;i++)INI.state=INI.state|(uint)(0x1<<i);

		Mark[] Put=new Mark[n];
		for(int i=0;i<n;i++){
			Put[i]=INI;
			Put[i].route=Put[i].route|(uint)(0x1<<i);
			for(int j=0;j<n;j++){
				if(ARR_ADJ[i,j])Put[i].state=Put[i].state&~(uint)(0x1<<j);
			}
		}

		ans=0;
		for(int i=0;i<n;i++)if(Put[i].state==0){ans=1;return;}

		List<Mark> L1=new List<Mark>(Put);
		//L1.Sort((A,B)=>(A.rem()-B.rem()));
		bool chk=true;
		while(chk){
			List<Mark> L2=new List<Mark>();
			foreach(Mark S in L1){
				if(S.rem()==0){
					chk=false;
					ans=S.depth();
					break;
				}
				for(int k=0;k<n;k++){
					if((S.state&(uint)(0x1<<k))!=0){
						Mark Next=Sum(S,Put[k]);
						if(L2.Contains(Next)==false)L2.Add(Next);
					}
				}
			}
			L1.Clear();
			foreach(Mark S in L2)L1.Add(S);
			//L1.Sort((A,B)=>(A.rem()-B.rem()));
			L2.Clear();
		}

	}
	
	Mark Sum(Mark A,Mark B){
		Mark ANS;
		ANS.state=A.state&B.state;
		ANS.route=A.route|B.route;
		return ANS;
	}



}