#UnionFind

class UnionFind():

    def __init__(self, n):

        self.n = n

        self.parents = [-1] * n



    def find(self, x):

        if self.parents[x] < 0:

            return x

        else:

            self.parents[x] = self.find(self.parents[x])

            return self.parents[x]



    def union(self, x, y):

        x = self.find(x)

        y = self.find(y)



        if x == y:

            return



        if self.parents[x] > self.parents[y]:

            x, y = y, x



        self.parents[x] += self.parents[y]

        self.parents[y] = x



    def size(self, x):

        return -self.parents[self.find(x)]



    def same(self, x, y):

        return self.find(x) == self.find(y)



    def members(self, x):

        root = self.find(x)

        return [i for i in range(self.n) if self.find(i) == root]



    def roots(self):

        return [i for i, x in enumerate(self.parents) if x < 0]



    def group_count(self):

        return len(self.roots())



    def all_group_members(self):

        return {r: self.members(r) for r in self.roots()}



    def __str__(self):

        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())





n,m = list(map(int,input().split()))



uf = UnionFind(n+1)

for i in range(m):

    a,b = list(map(int,input().split()))

    uf.union(a,b)

    

ans = 0

for i in range(1,n+1):

    ans = max(ans, uf.size(i))

print(ans)
from collections import deque

n,m = list(map(int,input().split()))

V = [[] for i in range(n+1)]

for i in range(m):

    a,b = list(map(int,input().split()))

    V[a].append(b)

    V[b].append(a)

    

reach = [0]*(n+1)

ans = 0

for i in range(1,n+1):

    if reach[i] != 0:

        pass

    else:

        q = deque([])

        q.append(i)

        reach[i] = 1

        j = 1

        while q:

            x = q.popleft()

            

            for y in V[x]:

                if reach[y] == 0:

                    reach[y] = 1

                    q.append(y)

                    j += 1

                    

            ans = max(ans, j)

            

print(ans)
# UnionFind
class UnionFind:
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return "\n".join("{}: {}".format(r, self.members(r)) for r in self.roots())


n, m = list(map(int, input().split()))
uf = UnionFind(n + 1)
for i in range(m):
    a, b = list(map(int, input().split()))
    uf.union(a, b)
ans = 0
for i in range(1, n + 1):
    ans = max(ans, uf.size(i))
print(ans)

from collections import deque

n, m = list(map(int, input().split()))
V = [[] for i in range(n + 1)]
for i in range(m):
    a, b = list(map(int, input().split()))
    V[a].append(b)
    V[b].append(a)
reach = [0] * (n + 1)
ans = 0
for i in range(1, n + 1):
    if reach[i] != 0:
        pass
    else:
        q = deque([])
        q.append(i)
        reach[i] = 1
        j = 1
        while q:
            x = q.popleft()
            for y in V[x]:
                if reach[y] == 0:
                    reach[y] = 1
                    q.append(y)
                    j += 1
            ans = max(ans, j)
print(ans)

-# UnionFind -class UnionFind: -    def __init__(self, n): -        self.n = n -        self.parents = [-1] * n - -    def find(self, x): -        if self.parents[x] < 0: -            return x -        else: -            self.parents[x] = self.find(self.parents[x]) -            return self.parents[x] - -    def union(self, x, y): -        x = self.find(x) -        y = self.find(y) -        if x == y: -            return -        if self.parents[x] > self.parents[y]: -            x, y = y, x -        self.parents[x] += self.parents[y] -        self.parents[y] = x - -    def size(self, x): -        return -self.parents[self.find(x)] - -    def same(self, x, y): -        return self.find(x) == self.find(y) - -    def members(self, x): -        root = self.find(x) -        return [i for i in range(self.n) if self.find(i) == root] - -    def roots(self): -        return [i for i, x in enumerate(self.parents) if x < 0] - -    def group_count(self): -        return len(self.roots()) - -    def all_group_members(self): -        return {r: self.members(r) for r in self.roots()} - -    def __str__(self): -        return "\n".join("{}: {}".format(r, self.members(r)) for r in self.roots()) - +from collections import deque -uf = UnionFind(n + 1) +V = [[] for i in range(n + 1)] -    uf.union(a, b) +    V[a].append(b) +    V[b].append(a) +reach = [0] * (n + 1) -    ans = max(ans, uf.size(i)) +    if reach[i] != 0: +        pass +    else: +        q = deque([]) +        q.append(i) +        reach[i] = 1 +        j = 1 +        while q: +            x = q.popleft() +            for y in V[x]: +                if reach[y] == 0: +                    reach[y] = 1 +                    q.append(y) +                    j += 1 +            ans = max(ans, j)