def count_Squares(m, n):
    m = int(m)
    n = int(n)
    if m <= 0 or n <= 0:
        return 0
    k = min(m, n)
    return sum((m - i + 1) * (n - i + 1) for i in range(1, k + 1))