import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ

		Scanner sc = new Scanner(System.in);
		String input = sc.nextLine();
		String[] data = input.split(" ");
		int a = Integer.parseInt(data[0]);
		int b = Integer.parseInt(data[1]);
		int c = Integer.parseInt(data[2]);
		List<Integer> divisors = new ArrayList<Integer>();
		// int n = 0; // divisorsの要素番号
		int count = 0; // a～bまでの範囲の中にcがいくつあるのかをカウントするための変数

		if ((1 <= a && a <= 10000) && (1 <= b && b <= 10000)
				&& (1 <= c && c <= 10000) && (a <= b)) {
			divisors = ArrayDivisors(c);

			for (Integer n : divisors) {
				if (a <= n && n <= b) {
					count++;
				}
			}
			System.out.println(count);
		}

	}

	private static List<Integer> ArrayDivisors(int number) {
		int MinDivisor = 1;
		int MaxDivisor = number;
		List<Integer> divisors = new ArrayList<Integer>();
		for (int i = MinDivisor; i <= MaxDivisor; i++) {
			if (number % i == 0) {
				MinDivisor = i;
				MaxDivisor = number / i;
				if (MinDivisor <= MaxDivisor) {
					divisors.add(MinDivisor);
					if (MinDivisor != MaxDivisor) {
						divisors.add(MaxDivisor);
					} else {
						break;
					}
				}

			}

		}

		Collections.sort(divisors);
		return divisors;

	}

}
 import java.util.ArrayList; ArrayList java.util import java.util.Collections; Collections java.util import java.util.List; List java.util import java.util.Scanner; Scanner java.util public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ

		Scanner sc = new Scanner(System.in);
		String input = sc.nextLine();
		String[] data = input.split(" ");
		int a = Integer.parseInt(data[0]);
		int b = Integer.parseInt(data[1]);
		int c = Integer.parseInt(data[2]);
		List<Integer> divisors = new ArrayList<Integer>();
		// int n = 0; // divisorsの要素番号
		int count = 0; // a～bまでの範囲の中にcがいくつあるのかをカウントするための変数

		if ((1 <= a && a <= 10000) && (1 <= b && b <= 10000)
				&& (1 <= c && c <= 10000) && (a <= b)) {
			divisors = ArrayDivisors(c);

			for (Integer n : divisors) {
				if (a <= n && n <= b) {
					count++;
				}
			}
			System.out.println(count);
		}

	}

	private static List<Integer> ArrayDivisors(int number) {
		int MinDivisor = 1;
		int MaxDivisor = number;
		List<Integer> divisors = new ArrayList<Integer>();
		for (int i = MinDivisor; i <= MaxDivisor; i++) {
			if (number % i == 0) {
				MinDivisor = i;
				MaxDivisor = number / i;
				if (MinDivisor <= MaxDivisor) {
					divisors.add(MinDivisor);
					if (MinDivisor != MaxDivisor) {
						divisors.add(MaxDivisor);
					} else {
						break;
					}
				}

			}

		}

		Collections.sort(divisors);
		return divisors;

	}

} Main public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ

		Scanner sc = new Scanner(System.in);
		String input = sc.nextLine();
		String[] data = input.split(" ");
		int a = Integer.parseInt(data[0]);
		int b = Integer.parseInt(data[1]);
		int c = Integer.parseInt(data[2]);
		List<Integer> divisors = new ArrayList<Integer>();
		// int n = 0; // divisorsの要素番号
		int count = 0; // a～bまでの範囲の中にcがいくつあるのかをカウントするための変数

		if ((1 <= a && a <= 10000) && (1 <= b && b <= 10000)
				&& (1 <= c && c <= 10000) && (a <= b)) {
			divisors = ArrayDivisors(c);

			for (Integer n : divisors) {
				if (a <= n && n <= b) {
					count++;
				}
			}
			System.out.println(count);
		}

	} main {
		// TODO 自動生成されたメソッド・スタブ

		Scanner sc = new Scanner(System.in);
		String input = sc.nextLine();
		String[] data = input.split(" ");
		int a = Integer.parseInt(data[0]);
		int b = Integer.parseInt(data[1]);
		int c = Integer.parseInt(data[2]);
		List<Integer> divisors = new ArrayList<Integer>();
		// int n = 0; // divisorsの要素番号
		int count = 0; // a～bまでの範囲の中にcがいくつあるのかをカウントするための変数

		if ((1 <= a && a <= 10000) && (1 <= b && b <= 10000)
				&& (1 <= c && c <= 10000) && (a <= b)) {
			divisors = ArrayDivisors(c);

			for (Integer n : divisors) {
				if (a <= n && n <= b) {
					count++;
				}
			}
			System.out.println(count);
		}

	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) String input = sc.nextLine(); input sc.nextLine() sc.nextLine sc String[] data = input.split(" "); data input.split(" ") input.split input " " int a = Integer.parseInt(data[0]); a Integer.parseInt(data[0]) Integer.parseInt Integer data[0] data 0 int b = Integer.parseInt(data[1]); b Integer.parseInt(data[1]) Integer.parseInt Integer data[1] data 1 int c = Integer.parseInt(data[2]); c Integer.parseInt(data[2]) Integer.parseInt Integer data[2] data 2 List<Integer> divisors = new ArrayList<Integer>(); divisors new ArrayList<Integer>() int count = 0; count 0 if ((1 <= a && a <= 10000) && (1 <= b && b <= 10000)
				&& (1 <= c && c <= 10000) && (a <= b)) {
			divisors = ArrayDivisors(c);

			for (Integer n : divisors) {
				if (a <= n && n <= b) {
					count++;
				}
			}
			System.out.println(count);
		} (1 <= a && a <= 10000) && (1 <= b && b <= 10000)
				&& (1 <= c && c <= 10000) && (a <= b) (1 <= c && c <= 10000) (1 <= a && a <= 10000) && (1 <= b && b <= 10000)
				&& (1 <= c && c <= 10000) && (a <= b) (1 <= a && a <= 10000) 1 <= a 1 a a <= 10000 a 10000 (1 <= b && b <= 10000) 1 <= b 1 b b <= 10000 b 10000 (1 <= c && c <= 10000) 1 <= c 1 c c <= 10000 c 10000 (a <= b) a b {
			divisors = ArrayDivisors(c);

			for (Integer n : divisors) {
				if (a <= n && n <= b) {
					count++;
				}
			}
			System.out.println(count);
		} divisors = ArrayDivisors(c) divisors ArrayDivisors(c) ArrayDivisors c for (Integer n : divisors) {
				if (a <= n && n <= b) {
					count++;
				}
			} Integer n divisors {
				if (a <= n && n <= b) {
					count++;
				}
			} {
				if (a <= n && n <= b) {
					count++;
				}
			} if (a <= n && n <= b) {
					count++;
				} a <= n && n <= b a <= n a n n <= b n b {
					count++;
				} count++ count System.out.println(count) System.out.println System.out System System.out count String[] args args private static List<Integer> ArrayDivisors(int number) {
		int MinDivisor = 1;
		int MaxDivisor = number;
		List<Integer> divisors = new ArrayList<Integer>();
		for (int i = MinDivisor; i <= MaxDivisor; i++) {
			if (number % i == 0) {
				MinDivisor = i;
				MaxDivisor = number / i;
				if (MinDivisor <= MaxDivisor) {
					divisors.add(MinDivisor);
					if (MinDivisor != MaxDivisor) {
						divisors.add(MaxDivisor);
					} else {
						break;
					}
				}

			}

		}

		Collections.sort(divisors);
		return divisors;

	} ArrayDivisors {
		int MinDivisor = 1;
		int MaxDivisor = number;
		List<Integer> divisors = new ArrayList<Integer>();
		for (int i = MinDivisor; i <= MaxDivisor; i++) {
			if (number % i == 0) {
				MinDivisor = i;
				MaxDivisor = number / i;
				if (MinDivisor <= MaxDivisor) {
					divisors.add(MinDivisor);
					if (MinDivisor != MaxDivisor) {
						divisors.add(MaxDivisor);
					} else {
						break;
					}
				}

			}

		}

		Collections.sort(divisors);
		return divisors;

	} int MinDivisor = 1; MinDivisor 1 int MaxDivisor = number; MaxDivisor number List<Integer> divisors = new ArrayList<Integer>(); divisors new ArrayList<Integer>() for (int i = MinDivisor; i <= MaxDivisor; i++) {
			if (number % i == 0) {
				MinDivisor = i;
				MaxDivisor = number / i;
				if (MinDivisor <= MaxDivisor) {
					divisors.add(MinDivisor);
					if (MinDivisor != MaxDivisor) {
						divisors.add(MaxDivisor);
					} else {
						break;
					}
				}

			}

		} int i = MinDivisor; int i = MinDivisor; i MinDivisor i <= MaxDivisor i MaxDivisor i++ i++ i {
			if (number % i == 0) {
				MinDivisor = i;
				MaxDivisor = number / i;
				if (MinDivisor <= MaxDivisor) {
					divisors.add(MinDivisor);
					if (MinDivisor != MaxDivisor) {
						divisors.add(MaxDivisor);
					} else {
						break;
					}
				}

			}

		} {
			if (number % i == 0) {
				MinDivisor = i;
				MaxDivisor = number / i;
				if (MinDivisor <= MaxDivisor) {
					divisors.add(MinDivisor);
					if (MinDivisor != MaxDivisor) {
						divisors.add(MaxDivisor);
					} else {
						break;
					}
				}

			}

		} if (number % i == 0) {
				MinDivisor = i;
				MaxDivisor = number / i;
				if (MinDivisor <= MaxDivisor) {
					divisors.add(MinDivisor);
					if (MinDivisor != MaxDivisor) {
						divisors.add(MaxDivisor);
					} else {
						break;
					}
				}

			} number % i == 0 number % i number i 0 {
				MinDivisor = i;
				MaxDivisor = number / i;
				if (MinDivisor <= MaxDivisor) {
					divisors.add(MinDivisor);
					if (MinDivisor != MaxDivisor) {
						divisors.add(MaxDivisor);
					} else {
						break;
					}
				}

			} MinDivisor = i MinDivisor i MaxDivisor = number / i MaxDivisor number / i number i if (MinDivisor <= MaxDivisor) {
					divisors.add(MinDivisor);
					if (MinDivisor != MaxDivisor) {
						divisors.add(MaxDivisor);
					} else {
						break;
					}
				} MinDivisor <= MaxDivisor MinDivisor MaxDivisor {
					divisors.add(MinDivisor);
					if (MinDivisor != MaxDivisor) {
						divisors.add(MaxDivisor);
					} else {
						break;
					}
				} divisors.add(MinDivisor) divisors.add divisors MinDivisor if (MinDivisor != MaxDivisor) {
						divisors.add(MaxDivisor);
					} else {
						break;
					} MinDivisor != MaxDivisor MinDivisor MaxDivisor {
						divisors.add(MaxDivisor);
					} divisors.add(MaxDivisor) divisors.add divisors MaxDivisor {
						break;
					} break; Collections.sort(divisors) Collections.sort Collections divisors return divisors; divisors int number number public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ

		Scanner sc = new Scanner(System.in);
		String input = sc.nextLine();
		String[] data = input.split(" ");
		int a = Integer.parseInt(data[0]);
		int b = Integer.parseInt(data[1]);
		int c = Integer.parseInt(data[2]);
		List<Integer> divisors = new ArrayList<Integer>();
		// int n = 0; // divisorsの要素番号
		int count = 0; // a～bまでの範囲の中にcがいくつあるのかをカウントするための変数

		if ((1 <= a && a <= 10000) && (1 <= b && b <= 10000)
				&& (1 <= c && c <= 10000) && (a <= b)) {
			divisors = ArrayDivisors(c);

			for (Integer n : divisors) {
				if (a <= n && n <= b) {
					count++;
				}
			}
			System.out.println(count);
		}

	}

	private static List<Integer> ArrayDivisors(int number) {
		int MinDivisor = 1;
		int MaxDivisor = number;
		List<Integer> divisors = new ArrayList<Integer>();
		for (int i = MinDivisor; i <= MaxDivisor; i++) {
			if (number % i == 0) {
				MinDivisor = i;
				MaxDivisor = number / i;
				if (MinDivisor <= MaxDivisor) {
					divisors.add(MinDivisor);
					if (MinDivisor != MaxDivisor) {
						divisors.add(MaxDivisor);
					} else {
						break;
					}
				}

			}

		}

		Collections.sort(divisors);
		return divisors;

	}

} public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ

		Scanner sc = new Scanner(System.in);
		String input = sc.nextLine();
		String[] data = input.split(" ");
		int a = Integer.parseInt(data[0]);
		int b = Integer.parseInt(data[1]);
		int c = Integer.parseInt(data[2]);
		List<Integer> divisors = new ArrayList<Integer>();
		// int n = 0; // divisorsの要素番号
		int count = 0; // a～bまでの範囲の中にcがいくつあるのかをカウントするための変数

		if ((1 <= a && a <= 10000) && (1 <= b && b <= 10000)
				&& (1 <= c && c <= 10000) && (a <= b)) {
			divisors = ArrayDivisors(c);

			for (Integer n : divisors) {
				if (a <= n && n <= b) {
					count++;
				}
			}
			System.out.println(count);
		}

	}

	private static List<Integer> ArrayDivisors(int number) {
		int MinDivisor = 1;
		int MaxDivisor = number;
		List<Integer> divisors = new ArrayList<Integer>();
		for (int i = MinDivisor; i <= MaxDivisor; i++) {
			if (number % i == 0) {
				MinDivisor = i;
				MaxDivisor = number / i;
				if (MinDivisor <= MaxDivisor) {
					divisors.add(MinDivisor);
					if (MinDivisor != MaxDivisor) {
						divisors.add(MaxDivisor);
					} else {
						break;
					}
				}

			}

		}

		Collections.sort(divisors);
		return divisors;

	}

} Main
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ

		Scanner sc = new Scanner(System.in);
		String input = sc.nextLine();
		String[] data = input.split(" ");
		int a = Integer.parseInt(data[0]);
		int b = Integer.parseInt(data[1]);
		int c = Integer.parseInt(data[2]);
		List<Integer> divisors = new ArrayList<Integer>();
		// int n = 0; // divisorsの要素番号
		int count = 0; // a～bまでの範囲の中にcがいくつあるのかをカウントするための変数

		if ((1 <= a && a <= 10000) && (1 <= b && b <= 10000)
				&& (1 <= c && c <= 10000) && (a <= b)) {
			divisors = ArrayDivisors(c);

			for (Integer n : divisors) {
				if (a <= n && n <= b) {
					count++;
				}
			}
			System.out.println(count);
		}

	}

	private static List<Integer> ArrayDivisors(int number) {
		int MinDivisor = 1;
		int MaxDivisor = number;
		List<Integer> divisors = new ArrayList<Integer>();
		for (int i = MinDivisor; i <= MaxDivisor; i++) {
			if (number % i == 0) {
				MinDivisor = i;
				MaxDivisor = number / i;
				if (MinDivisor <= MaxDivisor) {
					divisors.add(MinDivisor);
					if (MinDivisor != MaxDivisor) {
						divisors.add(MaxDivisor);
					} else {
						break;
					}
				}

			}

		}

		Collections.sort(divisors);
		return divisors;

	}

}

