Given are $n$ different concentric circles on the plane.Inside the disk with the smallest radius (strictly inside it),we consider two distinct points $A,B$.We consider $k$ distinct lines passing through $A$ and $m$ distinct lines passing through $B$.There is no line passing through both $A$ and $B$ and all the lines passing through $k$ intersect with all the lines passing through $B$.The intersections do not lie on some of the circles.Determine the maximum and the minimum number of regions formed by the lines and the circles and are inside the circles.
To solve this problem, we need to determine the maximum and minimum number of regions formed by the given lines and circles inside the smallest circle. Let's break down the problem step by step.

1. **Understanding the Problem:**
   - We have \( n \) concentric circles.
   - Inside the disk with the smallest radius, we have two distinct points \( A \) and \( B \).
   - There are \( k \) distinct lines passing through \( A \) and \( m \) distinct lines passing through \( B \).
   - No line passes through both \( A \) and \( B \).
   - All lines passing through \( A \) intersect with all lines passing through \( B \).
   - The intersections do not lie on any of the circles.

2. **Regions Formed by Lines:**
   - Each pair of lines passing through \( A \) and \( B \) will intersect, forming a grid-like pattern.
   - The number of intersection points between \( k \) lines through \( A \) and \( m \) lines through \( B \) is \( k \times m \).

3. **Regions Formed by Circles:**
   - Each circle divides the plane into two regions: inside and outside.
   - Since we are only considering the regions inside the smallest circle, each additional circle will add one more region inside the smallest circle.

4. **Combining Lines and Circles:**
   - The lines and circles together will form regions inside the smallest circle.
   - Each intersection of a line through \( A \) with a line through \( B \) will create a new region.
   - Each circle will further divide these regions.

5. **Calculating the Maximum Number of Regions:**
   - The maximum number of regions formed by \( k \) lines through \( A \) and \( m \) lines through \( B \) is given by the formula for the number of regions formed by \( k \) and \( m \) lines:
     \[
     R_{\text{lines}} = (k+1)(m+1)
     \]
   - Each of the \( n \) circles will divide these regions further. The total number of regions formed by \( n \) circles and the lines is:
     \[
     R_{\text{total}} = (k+1)(m+1) \times n
     \]

6. **Calculating the Minimum Number of Regions:**
   - The minimum number of regions occurs when the lines and circles do not intersect in a way that maximizes the number of regions.
   - The minimum number of regions formed by \( k \) lines through \( A \) and \( m \) lines through \( B \) is:
     \[
     R_{\text{lines}} = k + m + 1
     \]
   - Each of the \( n \) circles will add one more region. The total number of regions formed by \( n \) circles and the lines is:
     \[
     R_{\text{total}} = (k + m + 1) + n - 1
     \]

Conclusion:
The maximum number of regions formed by the lines and circles inside the smallest circle is:
\[
\boxed{(k+1)(m+1) \times n}
\]

The minimum number of regions formed by the lines and circles inside the smallest circle is:
\[
\boxed{(k + m + 1) + n - 1}
\]